Lecture Fl syllabus and overview .
Course logistics I . Resources 2 . . Grade Breakdown 3 " Discrete Mathematics " ? " Discrete structures " / What is 4 . 5 . Topics
. Coursings I Mm÷F HEFEI - concepts , illustrative - low-level QA , lots of sample problems examples , ohsaisgiou - - WH 131 ) and - both available live ( recorded ) online synchronous / asynchronous ( , recitations on collab on Zoom ( why ? ) - lectures . - links to recordings will be posted .
readfsqmassignedreadiugsowr.fm?hyraswo. ① v ④ treating ③ featured 7- Cwedftri ) + participate ! ) / ( ↳ ③ Attempt problem sett review assigned reading
Textbook ② website : I http://moss.cs.iit.edu/cs 330 ③ Blackboard { ④ Discord →
Li Zhang ( email on website ) TA : - help of assignments - assignment grading challenge ( cc me ) - office hours on Discord .
. Grade Breakdown 3 - - Assignments 35% - Participation * 10% Exam 2 } open I midterm Exam 15% - - book holes , cumulative , - midterm 15% online ( platform TBD ) - Final Exam 25% { A , C : to -79 b. D: Go -692 , E :C Gob } , B : so -89% : I go to
Assignments ~ 10 problem sets , equally weighted . - posted to website on Blackboard as PDF - submit . - MUST BE TYPED .
Participation - points will track participation ( voice / text ) I - accumulated across semester - if a 1040 , worth of final exam increases max final exam worth = 35 %) can make it up ( so you
" / " Discrete Mathematics " " Discrete structures 4. y ÷ mean ? does this . distinct countable separate host continuous unconnected
I Nou - discrete objects Halves Discrete objects Halves : : - real numbers - diet dice roll results - temperature - integers - time measurement - coins - analog watch - cities onamap time binary data - - IP addresses - stepsinanalgonthm - lines of code in a graph - nodes - digital watch time
them obyeits ? we represent - how do - describe Ares ! sets , trees , graphs , e. g . , random variables truth tables - how do we reason about them ? - discrete mates !
" Mathematics " hands in polar # of possible starting y # of steps carried out by - rigor some ✓ algorithm for given input to roll X M two dice - counting / enumerating - # of ways # of ways to traverse locations \ on a map ↳ of possible pass . codes for a device - optimization - shortest path between two locations \ min # operations to multiply matrices \ efficiently sort a large list - proofs - argument that establishes the truth of some conjecture by logical steps proceeding from some \ known facts . . will my algorithm always sat its input correctly ? e.g
5. epics - logic t proof tedunqis - sets , Functions , Relations - Algorithms t Runtime complexity - Induction t Recursion + combinatorics counting - - Discrete probability - Graphs + Trees - Languages t Grammars Automata : FS Ms t Turing machines -
Recommend
More recommend