Show simple item record

6.042J / 18.062J Mathematics for Computer Science, Spring 2005

dc.contributor.authorLeiserson, Charlesen_US
dc.contributor.authorLehman, Ericen_US
dc.contributor.authorDevadas, Srinivasen_US
dc.contributor.authorMeyer, Albert R.en_US
dc.coverage.temporalSpring 2005en_US
dc.date.issued2005-06
dc.identifier6.042J-Spring2005
dc.identifierlocal: 6.042J
dc.identifierlocal: 18.062J
dc.identifierlocal: IMSCP-MD5-93296a97c674a64f720e4e9e7e25ac4e
dc.identifier.urihttp://hdl.handle.net/1721.1/104427
dc.description.abstractThis course is offered to undergraduates and is an elementary discrete mathematics course oriented towards applications in computer science and engineering. Topics covered include: formal logic notation, induction, sets and relations, permutations and combinations, counting principles, and discrete probability.en_US
dc.languageen-USen_US
dc.relationen_US
dc.rights.uriUsage 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.uriUsage Restrictions: Attribution-NonCommercial-ShareAlike 3.0 Unporteden_US
dc.rights.urihttp://creativecommons.org/licenses/by-nc-sa/3.0/en_US
dc.subjectElementary discrete mathematics for computer science and engineeringen_US
dc.subjectmathematical definitionsen_US
dc.subjectproofs and applicable methodsen_US
dc.subjectformal logic notationen_US
dc.subjectproof methodsen_US
dc.subjectinductionen_US
dc.subjectwell-orderingen_US
dc.subjectsetsen_US
dc.subjectrelationsen_US
dc.subjectelementary graph theoryen_US
dc.subjectinteger congruencesen_US
dc.subjectasymptotic notation and growth of functionsen_US
dc.subjectpermutations and combinationsen_US
dc.subjectcounting principlesen_US
dc.subjectdiscrete probabilityen_US
dc.subjectrecursive definitionen_US
dc.subjectstructural inductionen_US
dc.subjectstate machines and invariantsen_US
dc.subjectrecurrencesen_US
dc.subjectgenerating functionsen_US
dc.subject6.042Jen_US
dc.subject6.042en_US
dc.subject18.062Jen_US
dc.subject18.062en_US
dc.title6.042J / 18.062J Mathematics for Computer Science, Spring 2005en_US
dc.title.alternativeMathematics for Computer Scienceen_US


Files in this item

Thumbnail
Name:
6-042j-spring-2005/contents/in ...
Size:
36.81Kb
Format:
HTML
View/Open

This item appears in the following Collection(s)

Show simple item record