90 likes | 209 Views
Computer Science 20. All the Math you need for your Computer Sc ience courses t hat you won’t learn in your Math Courses. Discrete Mathematics for Computer Science. Some Topics. b. a. c. d. f. Formal logic ( p∨q ) ∧¬( p∧q ) Graphs and digraphs Probability Counting
E N D
Computer Science 20 All the Math you need for your Computer Science courses that you won’t learn in your Math Courses Discrete Mathematics for Computer Science
Some Topics b a c d f Formal logic (p∨q) ∧¬(p∧q) Graphs and digraphs Probability Counting Number theory p ≡ qr (mod m) … see the “placement test” on the web site
Skills!!! • How to do proofs • By contradiction • By induction • … • How to read and write mathematics • And typeset! • How to collaborate • How to present clearly and persuasively
3 Principles of Course Philosophy Learning, not competing Learn by doing, not by listening Many small bites
Typical Class Day • Before class: • Reading and check-in problems (30-60 mins) • In class • Mini-lecture (10-20 mins) • Collaborative problem solving in groups of 4 (30-40 mins) • After class and before next class • Homework (60-90 mins) • So class week = • 3 hours class time • ≤ 7.5 hours out-of-class time • Most readings from MIT course notes
Requirements • Attendance is mandatory! • See “Course policies” for details • Official/emergency absences ⇒ email cs20@seas.harvard.edu • Class begins at 10:10 sharp • Homework boxes removed at 10:15, no late submissions • 2 hour exams • 3-hour final during exam period
Tentative Grading Mix Homework 35% Midterms (2) 30% Final exam 25% Check-in questions 10% (Poor attendance: Exclusion or failure)
Support and Resources • Web site • Where schedule, HWs, slides, etc. are posted • TFs • See calendar on web site for office hours • Volunteers • Piazza (after study card day) • Tool for answering check-in questions (see course home page and get an account!) • Reading assignments and check-in questions are on the check-in tool