CSE150 Fall 2009. Honors Foundations of Computer Science

 Lecturer: Rob Johnson TA: Spyros Hadjichristodoulou Location: Lecture: Social & Behavioral Sciences N310 Recitation: Library N4006 Time: Lecture: TuTh 2:25-3:40 Recitation: Mo 2:20pm-3:15pm Office Hours: Rob: Tu 4:00pm-6:30pm, 2313D Computer Science Building Spyros: MoFr 11-12:30, 2110 Computer Science Building Home page: http://www.cs.sunysb.edu/~rob/teaching/cse150-fa09

News

• You may look at the 2008 exam or the 2007 exam for practice problems.
• Homework 5 is now available, with source. Due 12/10.
• Homework 4 is now available, with source. Due 12/3.
• Homework 3 is now available, with source. Due 11/19.
• The midterm is now available, with source. Remember that part (b) of the "Analyzing the Extended Euclidean Algorithm" problem has an error in it. Just do parts (a) and (c) instead.
• The midterm will be given on Thursday, Oct. 29th.
• The error in HW2 has been corrected.
• Homework 2 is now available, with source. Due 10/15.
• Homework 1 is now available, with source. Due 9/24.

Overview

This class will introduce foundational concepts needed for an advanced understanding of all areas of computer science. We will cover basics of sets, propositional logic and proof strategies, induction, recurrence relations and their solution, lists, trees, graphs, elementary number theory, counting, and probability. The course objectives are
• To provide students with a rigorous introduction to proof techniques including propositional logic and mathematical induction.
• Introduce recursion as a basic paradigm for computing with functions
• Introduce fundamental discrete structures such as functions, graphs, and trees.
• To build a strong theoretical foundation for subsequent courses in the computer science curriculum.

Subject to tweaks throughout the semester.
• Class participation (20%)
• Homeworks (25%).
• Midterm exam (25%).
• Final exam (30%). The final is cumulative, so it will have questions covering topics from the entire semester.

Resources

The online book, Mathematics for Computer Science, by Eric Lehman and Tom Leighton, is the "official" textbook.

Leif Walsh, the TA for this class in 2007, prepared an excellent reference for writing math in LaTex. The source is also available.

Lecture Schedule

Note: the schedule may change throughout the semester.