6.042J / 18.062J Mathematics for Computer Science, Spring 2005
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...
| Main Authors: | , , , |
|---|---|
| Other Authors: | |
| Format: | Learning Object |
| Language: | en-US |
| Published: |
2005
|
| Subjects: | |
| Online Access: | http://hdl.handle.net/1721.1/104427 |
| _version_ | 1826200512488275968 |
|---|---|
| author | Leiserson, Charles Lehman, Eric Devadas, Srinivas Meyer, Albert R. |
| author2 | Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science |
| author_facet | Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science Leiserson, Charles Lehman, Eric Devadas, Srinivas Meyer, Albert R. |
| author_sort | Leiserson, Charles |
| collection | MIT |
| description | 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. |
| first_indexed | 2024-09-23T11:37:37Z |
| format | Learning Object |
| id | mit-1721.1/104427 |
| institution | Massachusetts Institute of Technology |
| language | en-US |
| last_indexed | 2025-03-10T09:55:25Z |
| publishDate | 2005 |
| record_format | dspace |
| spelling | mit-1721.1/1044272025-02-25T16:48:02Z 6.042J / 18.062J Mathematics for Computer Science, Spring 2005 Mathematics for Computer Science Leiserson, Charles Lehman, Eric Devadas, Srinivas Meyer, Albert R. Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science Massachusetts Institute of Technology. Department of Mathematics 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 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. 2005-06 Learning Object 6.042J-Spring2005 local: 6.042J local: 18.062J local: IMSCP-MD5-93296a97c674a64f720e4e9e7e25ac4e http://hdl.handle.net/1721.1/104427 en-US 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/ text/html Spring 2005 |
| spellingShingle | 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 Leiserson, Charles Lehman, Eric Devadas, Srinivas Meyer, Albert R. 6.042J / 18.062J Mathematics for Computer Science, Spring 2005 |
| title | 6.042J / 18.062J Mathematics for Computer Science, Spring 2005 |
| title_full | 6.042J / 18.062J Mathematics for Computer Science, Spring 2005 |
| title_fullStr | 6.042J / 18.062J Mathematics for Computer Science, Spring 2005 |
| title_full_unstemmed | 6.042J / 18.062J Mathematics for Computer Science, Spring 2005 |
| title_short | 6.042J / 18.062J Mathematics for Computer Science, Spring 2005 |
| title_sort | 6 042j 18 062j mathematics for computer science spring 2005 |
| topic | 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 |
| url | http://hdl.handle.net/1721.1/104427 |
| work_keys_str_mv | AT leisersoncharles 6042j18062jmathematicsforcomputersciencespring2005 AT lehmaneric 6042j18062jmathematicsforcomputersciencespring2005 AT devadassrinivas 6042j18062jmathematicsforcomputersciencespring2005 AT meyeralbertr 6042j18062jmathematicsforcomputersciencespring2005 AT leisersoncharles mathematicsforcomputerscience AT lehmaneric mathematicsforcomputerscience AT devadassrinivas mathematicsforcomputerscience AT meyeralbertr mathematicsforcomputerscience |