Mathematics for Computer Science, Spring 2005
| Rating: | Not rated yet |
| Rate item | |
| Type: | Course Related Materials |
| Grade Level: | Post-secondary |
Author: Devadas, Srinivas
Subject: Science and Technology
Institution Name:
M.I.T.
Collection Name: MIT OpenCourseWare
Abstract: Mathematical tools and methods for computer science and engineering. Emphasis on development of rigorous thinking, analytical skills, and mathematical sophistication while learning elementary discrete mathematics. Topics: mathematical proofs; induction and well-ordering; divisibility and congruences; asymptotic notation and growth of functions; sets, relations, functions, and graphs; counting theory; recurrences and generating functions; and discrete probability.
Details
Course Type: Full Course
Material Types: Activities and Labs, Assessments, Homework and Assignments, Lecture Notes, Teaching and Learning Strategies, Syllabi
Media Formats: Text/HTML, Downloadable docs
Language: English
Additional Information
Geographic
Regional Relevance: All
