Discrete Mathematics G22.2340-001
Tuesdays 6:00-8:20 Room 102 WWH
|Instructor's Information||TA's Information|
|Harper Langston||Chris Wu|
|harper AT cs DOT nyu DOT edu||wu AT cs DOT nyu DOT edu|
|719 Broadway, Room 1212|| ||715 Broadway, Room 704|
|(212) 998 3342||(212) 998 3514|
|Office Hours: Available for appt. anytime(e-mail/call)||Office Hours: Available for appt. anytime(e-mail/call)|
This offering of Discrete Mathematics is designed to be an
introduction to the mathematical techniques and reasonings that are
required of a good computer scientist. Upon succesful completion of
this course, students should be comfortable with tackling the
mathematical issues confronted in an Algorithms and Data Structures course. More importantly, you will begin to learn how to think like a computer scientist and see how solving problems often confronted in computer science can be fun and challenging!
Students should be comfortable with Basic Algebra such as seen at the high school level. The topics we will cover in this course will include logic, proof techniques, induction, recursion, combinatorics, basic probability, algorithm analysis and efficiency, and discrete structures (including elementary graph theory).
If you are curious about the class and would like to know more (or meet with me beforehand to talk about your background), e-mail me!
Class Mailing List
|Please sign up for the class mailing list ASAP. We will use this to send out announcements, etc., and students can use it to ask each other for homework help, discuss challenging problems, etc. Go to http://www.cs.nyu.edu/mailman/listinfo/g22_2340_001_su05 and put in the e-mail address you plan to use for the class (You can subscribe with multiple e-mail addresses) and a password, and you will receive a confirmation e-mail. If you want to send a message to the class, e-mail firstname.lastname@example.org|
There will be one basic textbook and several suggested textbooks, from which sections for reading may be chosen or sample bonus problems.
We will attempt to assign challenge problems continuously (mainly for extra credit).
The homework will be designed to supplement readings and
best way to become adequately mathematically literate in this
material is through continuous exercises, so homework will given semi-regularly and will be due the week following when it is assigned. Students can work with
others, but they must indicate on their homework with whom they have
worked (working together in no way affects your grade). Additionally, homework will be posted on-line the day it is handed out and students can present their solutions via e-mail in case they are unable to attend a lecture.
There will be a midterm and a final. Dates to be decided. However, as noted below in grading, homework will be weighed more heavily, and exams will be mainly used so that students can evaluate their own progress and understanding of the material. The midterm may also be take-home.
Regular attendance is the best way to stay current on the material, especially since we will be reviewing homework assignments and general questions. Plus, new material will be introduced weekly. However, we understand that many students have full-time jobs during the summer. If you are interested in the class and are unsure how often you will be able to attend, e-mail the instructor. Office hours will also be able for students who need to review certain topics. (The goal of the course is to adequately prepare you for the rest of the graduate program, so we want to make sure students feel comfortable.)
Grade distribution has not fully been decided; however, I often feel that homework better reflects students' abilities since not everyone does well on exams,
so homework will factor more heavily into the equation:
Students are encouraged to collaborate but are expected to indicate as such on any homework turned in. Exams will be in class, so no collaboration will be allowed.
There will be a class mailing list, which will be posted here. All students will be required to join.
Still being decided, but the basic structure will follow previous years: (This is last year's syllabus posted here)
|1||May 17||Introduction and Logic of Compound Statements||Chapter 1 and Notes|
|2||May 24||Logic of Quantified Statements||Chapter 2 and Notes|
|3||May 31||Elementary Number Theory and Methods of Proof||Chapter 3 and Notes|
|4||June 7||Mathematical Induction and Set Theory (Lecture 4 Notes)||Sections 3.8, 4.3-4.5 and Chapter 5?|
|5||June 14||Finish Set Theory and Start Counting (Lecture 5 notes)|
|6||June 21||More Counting(Lecture notes)||Chapter 6|
|7||June 28||Midterm and Some Counting(Lecture notes)|
|8||July 5||More Counting(Lecture notes)||Chapter 6|
|9||July 12||Finish Counting and Start Functions||Chapter 6 finish and Chapter 7 beginning(Lecture notes)|
|10||July 19||Finish Functions and Start Recursion||Chapter 7 and Start Chapter 8. Also, read in-class Handouts(Lecture notes)|
|11||July 26||Recursion and Asymptotics|
||Final Class Presentations