CSE 2321

Foundations I: Discrete Structures

Diego S. Zaccai

Course Topics

Propositional logic, Boolean algebra, first-order logic, sets, functions, basic proof techniques, graphs and trees, analysis of algorithms, asymptotic analysis, combinatorics, graph algorithms.

Course Information

Instructor: Diego Zaccai.
Office Hours: available here.

Text(required): "Introduction to Algorithms," Third Edition, by Corman, Leiserson, Rivest and Stein.
A note on the book from Professor Supowit: This book is huge; we’ll cover about 15% of it. The next course in this sequence (CSE 2331 – Foundations of Computer Science II) will cover another 25% of it or so. If you make a career in computer science, you (and your employers) will probably benefit from your keeping it as a reference.

Syllabus: Can be downloaded here.

Pre-requisite: CSE 2122, 2123, or 2221; and Math 1151 or 1161.
Co-requisite: CSE 2231.

More information about the course will be posted on Carmen.

Piazza: This term we will be using Piazza for class discussion. Rather than emailing questions to the teaching staff, I encourage you to post your questions on Piazza. Find our class page at: piazza.com.


Midterm 1: Wednesday, September 27, 8:00 - 9:45 p.m. in Mendenhall Lab 100
Midterm 2: Wednesday, November 1, 8:00 - 9:45 p.m. in Mendenhall Lab 100
1:50 p.m. Section:Wednesday, December 13, 2:00 - 3:45 p.m. in DL 369
4:10 p.m. Section: Thursday, December 14, 4:00 - 5:45 p.m. in DL 369

Grading Scheme (tentative)

Programming Assignments5%
Pop Quizzes8%
Midterm 120%
Midterm 220%


Homework is due at the beginning of class. Late homework will not receive credit.

There will be two programming assignments for the class that will be assigned in parallel to the homework. Their due date will be posted on Carmen, for a maximum credit of 100 points. The maximum credit is reduced by 20 points per day, or part there of, the assignment is late. No credit will be given to a programming assignment that is more than 48 hours late.

Students are expected to attend class regularly. In the event that a student must miss a class, the student is responsible for finding out what assignments were made, what due dates were announced, and what material was covered.