Stony Brook University • Department of Computer Science

CSE 213: Fundamentals of Computer Science II (Section 02 - Fall 2026)

Lectures: MoWe, 2:00 pm - 3:20 pm in JAVITS LECTR 103 WESTCAMPUS
Instructor: Omkant Pandey  ()
Office hours: Mo, We 12:45 PM - 1:45 PM in NCS 345
TAs & Office Hours: Location: TA Room at Old CS 2126
• Harish: Tu 11:00 AM - 12:00 PM •
• Tom: We 10:30 AM - 11:30 AM •
• Gilvir: Th 11:00 AM - 12:00 PM •
• Paavan: Fr 12:45 PM - 1:45 PM •
Recitations: • R04: Tu 10:00 AM - 10:55 AM in New Computer Science Bldg 115 (Harish)
• R05: Th 9:00 AM - 9:55 AM in Computer Science 2129 (Gilvir)
• R06: Th 5:00 PM - 5:55 PM in New Computer Science Bldg 115 (Paavan)
Credit Hours: 4 Credits
Announcements: All announcements will be made through Brightspace.

Course Description & Learning Outcomes

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

Prerequisites: CSE 113 or CSE 215 or CSE 150; CSE major

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.

Textbooks

Grading Policy

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

Important Policies:

  • 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 Policy Change: All homework assignment submissions must be handwritten and scanned (or otherwise done on an iPad, drawing tablet, etc.). Typeset solutions in LaTeX, Google Docs, Microsoft Word, etc. will not be accepted. The only exceptions to this policy will be students who have a legitimate need for accomodation due to issues such as a physical disability, in which case requests for accomodation should be handled by first reaching out to SASC. Late submissions will not be accepted.
    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.
  • Course AI Policy: All work you submit must be your own unless a written exception has been granted by the instructor with an alternative policy. Do not use any type of help including AI/LLM to complete your assignments. This policy will supersede the university generative AI policy (found here: https://www.stonybrook.edu/commcms/academic_integrity/generative-ai/) and the default CS department policy (found here: https://www.cs.stonybrook.edu/students/policies-guidelines/ai-usage.html) if there is a conflict.

Tentative Examination Dates

Syllabus and Tentative Class Schedule

Section numbers reference Discrete Mathematics with Applications by Susanna Epp.

Week Date Topic & Milestones Reading (Epp)
1 Aug 24 Introduction to Probability; Possibility Trees and the Multiplication Rule Secs. 9.1-9.2
Aug 26 Counting Elements of Disjoint Sets: The Addition Rule Sec. 9.3
2 Aug 31 The Pigeonhole Principle Sec. 9.4
Sep 02 Counting Subsets of a Set: Combinations Sec. 9.5
3 Sep 07 Labor Day (No Class) -
Sep 09 r-Combinations with Repetition Allowed Sec. 9.6
4 Sep 14, Sep 16 Pascal’s Formula and the Binomial Theorem Sec. 9.7
5 Sep 21, Sep 23 Probability Axioms and Expected Value Sec. 9.8
6 Sep 28 Midterm 1 (in class) -
Sep 30 Conditional Probability, Bayes’ Formula, and Independent Events Sec. 9.9
7 Oct 05, Oct 07 Trails, Paths, and Circuits; Planar Graphs, Dual Graphs, Euler Relationship, Coloring, and Independent Sets Sec. 10.1
- Oct 12 - Oct 13 Fall Break (No Class Oct 12) -
8 Oct 14 Matrix Representations of Graphs Sec. 10.2
9 Oct 19, Oct 21 Matrix Representations of Graphs; Isomorphisms of Graphs Secs. 10.2-10.3
10 Oct 26 Midterm 2 (in class) -
Oct 28 Trees: Examples and Basic Properties; Rooted Trees Secs. 10.4-10.5
11 Nov 02, Nov 04 Trees: Examples and Basic Properties; Rooted Trees; Spanning Trees and a Shortest Path Algorithm Secs. 10.4-10.6
12 Nov 09, Nov 11 Spanning Trees and a Shortest Path Algorithm; Formal Languages and Regular Expressions Sec. 10.6, Sec. 12.1
13 Nov 16, Nov 18 Formal Languages and Regular Expressions; Finite-State Automata Secs. 12.1-12.2
14 Nov 23 Finite-State Automata Sec. 12.2
- Nov 25 - Nov 29 Thanksgiving Break (No Class Nov 25) -
15 Nov 30, Dec 02 Simplifying Automata, Context Free Grammars §12.3, Ch. 2 (Sip)
16 Dec 07 Course Review / Review for Final Exam -
- Dec 14 (Mon) Final Exam: 2:15 PM - 5:00 PM (Venue TBD) -

University Statements & Policies

Academic Integrity Statement

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 at http://www.stonybrook.edu/commcms/academic_integrity/index.html.

Course AI Policy

All work you submit must be your own unless a written exception has been granted by the instructor with an alternative policy. Do not use any type of help including AI/LLM to complete your assignments. This policy will supersede the university generative AI policy (found here: https://www.stonybrook.edu/commcms/academic_integrity/generative-ai/) and the default CS department policy (found here: https://www.cs.stonybrook.edu/students/policies-guidelines/ai-usage.html) if there is a conflict.

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.

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.