| dc.contributor.author | Meyer, Albert R. | en_US |
| dc.coverage.temporal | Spring 2010 | en_US |
| dc.date.issued | 2010-06 | |
| dc.identifier | 6.042J-Spring2010 | |
| dc.identifier | local: 6.042J | |
| dc.identifier | local: 18.062J | |
| dc.identifier | local: IMSCP-MD5-86225fc28fea74cd6827fa0f4dd080f9 | |
| dc.identifier.uri | http://hdl.handle.net/1721.1/104426 | |
| dc.description.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. | en_US |
| dc.language | en-US | en_US |
| dc.relation | | en_US |
| dc.rights.uri | Usage Restrictions: This site (c) Massachusetts Institute of Technology 2016. 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.rights.uri | Usage Restrictions: Attribution-NonCommercial-ShareAlike 3.0 Unported | en_US |
| dc.rights.uri | http://creativecommons.org/licenses/by-nc-sa/3.0/ | en_US |
| dc.subject | discrete mathematics | 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 | graphs | en_US |
| dc.subject | state machines | en_US |
| dc.subject | modular arithmetic | en_US |
| dc.subject | counting | en_US |
| dc.subject | discrete probability theory | en_US |
| dc.title | 6.042J / 18.062J Mathematics for Computer Science, Spring 2010 | en_US |
| dc.title.alternative | Mathematics for Computer Science | en_US |
