6.042J / 18.062J Mathematics for Computer Science, Spring 2010
Name
6-042j-spring-2010/contents/index.htm
Size
36.89 KB
Format
HTML
Checksum (MD5)
ff2df7649108936eaf92abf55fb37a43
Author(s)
Meyer, Albert R.
Alternative Title
Mathematics for Computer Science
Date Issued
June 2010
Abstract
This subject offers an introduction to Discrete Mathematics oriented toward Computer Science and Engineering. The subject coverage divides roughly into thirds: Fundamental concepts of mathematics: definitions, proofs, sets, functions, relations. Discrete structures: graphs, state machines, modular arithmetic, counting. Discrete probability theory. On completion of 6.042, students will be able to explain and apply the basic methods of discrete (noncontinuous) mathematics in Computer Science. They will be able to use these methods in subsequent courses in the design and analysis of algorithms, computability theory, software engineering, and computer systems.
Subjects
discrete mathematics
definitions
proofs
sets
functions
relations
discrete structures
graphs
state machines
modular arithmetic
counting
discrete probability theory
MIT Department
Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science
Massachusetts Institute of Technology. Department of Mathematics
Terms of Use
Persistent DSpace Link
