| dc.contributor.author | Nagpal, Radhika | en_US |
| dc.contributor.author | Meyer, Albert R. | en_US |
| dc.coverage.temporal | Fall 2002 | en_US |
| dc.date.issued | 2002-12 | |
| dc.identifier | 6.042J-Fall2002 | |
| dc.identifier | local: 6.042J | |
| dc.identifier | local: 18.062J | |
| dc.identifier | local: IMSCP-MD5-59b9039bdcbbcc7146535fa3512b7f0c | |
| dc.identifier.uri | http://hdl.handle.net/1721.1/70477 | |
| dc.description.abstract | This is an introductory course in Discrete Mathematics oriented toward Computer Science and Engineering. The course divides roughly into thirds: Fundamental concepts of Mathematics: definitions, proofs, sets, functions, relations. Discrete structures: modular arithmetic, graphs, state machines, counting. Discrete probability theory. This course was also taught as part of the Singapore-MIT Alliance (SMA) programme as course number SMA 5512 (Mathematics for Computer Science). Contributors Srinivas Devadas Lars Engebretsen David Karger Eric Lehman Thomson Leighton Charles Leiserson Nancy Lynch Santosh Vempala | en_US |
| dc.language | en-US | en_US |
| dc.rights.uri | Usage Restrictions: This site (c) Massachusetts Institute of Technology 2012. Content within individual courses is (c) by the individual authors unless otherwise noted. The Massachusetts Institute of Technology is providing this Work (as defined below) under the terms of this Creative Commons public license ("CCPL" or "license") unless otherwise noted. The Work is protected by copyright and/or other applicable law. Any use of the work other than as authorized under this license is prohibited. By exercising any of the rights to the Work provided here, You (as defined below) accept and agree to be bound by the terms of this license. The Licensor, the Massachusetts Institute of Technology, grants You the rights contained here in consideration of Your acceptance of such terms and conditions. | en_US |
| dc.subject | discrete mathematics | en_US |
| dc.subject | computer science | en_US |
| dc.subject | definitions | en_US |
| dc.subject | proofs | en_US |
| dc.subject | sets | en_US |
| dc.subject | functions | en_US |
| dc.subject | relations | en_US |
| dc.subject | discrete structures | en_US |
| dc.subject | modular arithmetic | en_US |
| dc.subject | graphs | en_US |
| dc.subject | state machines | en_US |
| dc.subject | counting | en_US |
| dc.subject | discrete probability theory | en_US |
| dc.subject | probability | en_US |
| dc.subject | 6.042J | en_US |
| dc.subject | 18.062J | en_US |
| dc.subject | 6.042 | en_US |
| dc.subject | 18.062 | en_US |
| dc.title | 6.042J / 18.062J Mathematics for Computer Science (SMA 5512), Fall 2002 | en_US |
| dc.title.alternative | Mathematics for Computer Science (SMA 5512) | en_US |
| dc.type | Learning Object | |
| dc.contributor.department | Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science | |
| dc.contributor.department | Massachusetts Institute of Technology. Department of Mathematics | |
