CSE 213: Fundamentals of Computer Science II (Section 01 - Spring 2026)

1 Class Meetings

Lectures: MoWe, 11:00 am - 12:20 pm in ENGINEERING 145
Instructor: Omkant Pandey, omkant [at] cs stonybrook edu.
Office hours: MoWe 12:45 pm to 1:45 pm in NCS 345

Teaching Assistants, office hours, and email contacts:

Paavan Parekh:	Th 2-3 pm, Fr 1-2 pm	`pmparekh`
Vir Pathak:	MoWe 10-11 am	`vpathak`
Ethan Recientes:	Tu 2-3 pm, Th 12:30-1:30 pm	`erecientes`

TA office hours are held in the "TA Room" at Old CS 2126.
Office hours are spread over the week, so someone is available each day of the week.
Add @cs.stonybrook.edu to the username listed for each TA above to get their email address.

Recitations:
- R01: Mo 9:00 am - 9:55 am (Vir) - COMPUTER SCI 2311
- R02: Tu 10:00 am - 10:55 am (Paavan) - COMPUTER SCI 2129
- R03: We 9:00 am - 9:55 am (Ethan) - COMPUTER SCI 2311
- R04: Th 10:00 am - 10:55 am (Paavan) - COMPUTER SCI 2114
- R05: Tu 1:00 pm - 1:55 pm (Ethan) - COMPUTER SCI 2311
- R06: Th 1:00 pm - 1:55 pm (Vir) - COMPUTER SCI 2311
Announcements: All announcements will be made through Brightspace.

2 Course Description

A continuation of CSE 113 covering the mathematical foundations of computer science. Topics include counting techniques, graph theory, and finite automata.

3 Prerequisite

CSE 113

4 Course Learning Outcomes

Students will develop proficiency in advanced counting techniques, graph theory algorithms, and formal language theory. They will gain the ability to apply mathematical reasoning to analyze computational problems and understand the theoretical foundations of computer science.

5 Textbook

6 Grading

The grading will be based on the following examinations and assignments:

Homework Assignments: 7 Homeworks (Best 5 count): 5% each (Total 25%)
Midterm Exams: Two Midterms: 20% each (Total 40%)
Final Exam: 35%

Note the following:

Students will have exactly one week to review their graded answer sheets following the release of scores for each assignment/exam. The scores will be final after this week and no further reviews will be entertained.
Exams are open book and open notes. However, access to electronic notes or resources will NOT be permitted during the exams. No make-up exams or assignments will be provided except when mandated by university regulations.
Homework assignments must be completed in LaTeX, and submitted on time. Students will be responsible for learning LaTeX on their own. Late submissions will not be accepted.
Students must complete their work independently. Offering or accepting solutions from others is an act of plagiarism, which is a serious offense. All parties involved in academically dishonest behavior will be penalized according to the Academic Integrity Policy provided below.

7 Tentative Examination Dates

Midterm 1: Monday, March 02 (in class)
Midterm 2: Wednesday, April 01 (in class)
Final Exam: Friday, May 15, 11:15 AM to 1:45 PM (Venue TBD)

8 Syllabus and Tentative Class Schedule

Section numbers come from Discrete Mathematics with Applications by Susanna Epp.

Week	Date	Topic	Reading (Epp)
1	Jan 28	Introduction to Probability; Possibility Trees and the Multiplication Rule	Secs. 9.1-9.2
2	Feb 02, Feb 04	Counting Elements of Disjoint Sets: The Addition Rule; The Pigeonhole Principle	Secs. 9.3-9.4
3	Feb 09, Feb 11	Counting Subsets of a Set: Combinations; r-Combinations with Repetition Allowed	Secs. 9.5-9.6
4	Feb 16, Feb 18	Pascal’s Formula and the Binomial Theorem	Sec. 9.7
5	Feb 23, Feb 25	Probability Axioms and Expected Value	Sec. 9.8
6	Mar 02	Midterm 1	-
	Mar 04	Conditional Probability, Bayes’ Formula, and Independent Events	Sec. 9.9
7	Mar 09, Mar 11	Trails, Paths, and Circuits	Sec. 10.1
8	Mar 16 - Mar 22	Spring Recess	-
9	Mar 23, Mar 25	Matrix Representations of Graphs	Sec. 10.2
10	Mar 30	Isomorphisms of Graphs	Sec. 10.3
	Apr 01	Midterm 2	-
11	Apr 06, Apr 08	Trees: Examples and Basic Properties; Rooted Trees	Secs. 10.4-10.5
12	Apr 13, Apr 15	Spanning Trees and a Shortest Path Algorithm	Sec. 10.6
13	Apr 20, Apr 22	Formal Languages and Regular Expressions	Sec. 12.1
14	Apr 27, Apr 29	Finite-State Automata	Sec. 12.2
15	May 04, May 06	Simplifying Automata, Context Free Grammars	§12.3, Ch. 2 (Sip)
-	May 15	Final Exam, 11:15 AM to 1:45 PM, venue TBD	-

9 Academic Integrity Statement

http://www.stonybrook.edu/commcms/academic_integrity/index.html

Each student must pursue his or her academic goals honestly and be personally accountable for all submitted work. Representing another person's work as your own is always wrong. Faculty is required to report any suspected instances of academic dishonesty to the Academic Judiciary. Faculty in the Health Sciences Center (School of Health Technology & Management, Nursing, Social Welfare, Dental Medicine) and School of Medicine are required to follow their school-specific procedures. For more comprehensive information on academic integrity, including categories of academic dishonesty please refer to the academic judiciary website.

10 Student Accessibility Support Center Statement

If you have a physical, psychological, medical, or learning disability that may impact your course work, please contact the Student Accessibility Support Center, Stony Brook Union Suite 107, (631) 632-6748, or at sasc@stonybrook.edu. They will determine with you what accommodations are necessary and appropriate. All information and documentation is confidential.

11 Critical Incident Management

Stony Brook University expects students to respect the rights, privileges, and property of other people. Faculty are required to report to the Office of University Community Standards any disruptive behavior that interrupts their ability to teach, compromises the safety of the learning environment, or inhibits students' ability to learn.