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

Author(s)
Leiserson, Charles; Lehman, Eric; Devadas, Srinivas; Meyer, Albert R.
Thumbnail
Download6-042j-spring-2005/contents/index.htm (36.81Kb)
Alternative title
Mathematics for Computer Science
Terms of use
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. Usage Restrictions: Attribution-NonCommercial-ShareAlike 3.0 Unported http://creativecommons.org/licenses/by-nc-sa/3.0/
Metadata
Show full item record
Abstract
This 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.
Date issued
2005-06
URI
http://hdl.handle.net/1721.1/104427
Other identifiers
6.042J-Spring2005
local: 6.042J
local: 18.062J
local: IMSCP-MD5-93296a97c674a64f720e4e9e7e25ac4e
Keywords
Elementary discrete mathematics for computer science and engineering, mathematical definitions, proofs and applicable methods, formal logic notation, proof methods, induction, well-ordering, sets, relations, elementary graph theory, integer congruences, asymptotic notation and growth of functions, permutations and combinations, counting principles, discrete probability, recursive definition, structural induction, state machines and invariants, recurrences, generating functions, 6.042J, 6.042, 18.062J, 18.062
Collections