CSE 20312 is the second part of a two-course introduction-to-computing sequence intended for Computer Science and Engineering students at the University of Notre Dame. This course deepens and broadens student exposure to imperative and object-oriented programming and data structures. Topics covered include modularity, specification, data abstraction, classes and objects, genericity, inheritance. This course will focus these topics on design and use of elementary data structures such as lists, stacks, queues, and trees, as well as advanced techniques such as divide-and-conquer, sorting, searching and graph algorithms. More advanced data structures such as priority queues and search trees will also be covered.

Upon successful completion of this course, students will be able to:

  1. Write clear, efficient, and high-quality code.

  2. Understand how computers represent data and allocate memory.

  3. Utilize basic data structures such as arrays, lists, stacks, queues, sets, and maps.

  4. Apply algorithms for searching and sorting data.

  5. Represent trees and graphs and traverse such data structures using a variety of algorithms.

  6. Develop software that employs objects or recursion.

  7. Analyze the efficiency and complexity of software implementations.

Class Information

M/W/F 10:30 AM - 11:20 AM
Location (Lecture)
136 DeBartolo Hall
Location (Lab)
228 DeBartolo Hall
Zoom Meeting
985 8574 0080
Mailing List (Class)
Mailing List (Staff)


Peter Bui (pbui@nd.edu)
Office Hours
M/W/TH/F 2:00 PM - 3:30 PM, and by appointment
Office Location
326D Cushing Hall

Teaching Assistants

Teaching Assistant
Jerrick Ban (jban@nd.edu)
Teaching Assistant
Luke Braby (lbraby@nd.edu)
Teaching Assistant
Meredith Heller (mheller5@nd.edu)
Teaching Assistant
Mayleen Liu (mliu5@nd.edu)
Teaching Assistant
Thomas Mercurio (tmercuri@nd.edu)
Teaching Assistant
Cat Pardi (cpardi@nd.edu)
Teaching Assistant
Kyle Phan (kphan2@nd.edu)

Help Protocol

  1. Think
  2. Slack
  3. Think
  4. Zoom
  5. Think
  6. Email

Office Hours

Unit Date Topics Assignments
Developer Tools Tue 08/22 Syllabus, Unix Programming Environment Slides 00 Slides 01 Panopto 01 Panopto 02 Reading 00
Wed 08/23 Git, Make Slides 02 Panopto
Fri 08/25 Complexity, GDB, Valgrind Slides 03 Panopto
Data Allocation Mon 08/28 Types, Pointers, Arrays Slides 04 Panopto Reading 01
Wed 08/30 Strings, I/O Slides 05 Panopto Homework 01
Fri 09/01 Address Space Slides 05 Panopto
Arrays, Stacks Mon 09/04 Structs, OOP Slides 06 Panopto Reading 02
Wed 09/06 Dynamic Arrays Slides 07 Panopto Homework 02
Fri 09/08 Stacks Slides 08 Panopto
Lists, Queues Mon 09/11 Linked Lists Slides 09 Panopto Reading 03
Wed 09/13 Queues Slides 10 Panopto Homework 03
Fri 09/15 Deques Slides 11 Panopto
Search, Sets Mon 09/18 Search Slides 12 Panopto Reading 04
Wed 09/20 Sets Slides 13 Panopto Homework 04
Fri 09/22 Bitsets Slides 14 Panopto
Sorting Mon 09/25 Bubble, Insertion, Selection Sort Slides 15 Panopto Reading 05
Wed 09/27 Merge Sort Slides 16 Panopto Homework 05
Fri 09/29 Quick Sort Slides 17 Panopto
Hash Tables, Maps Mon 10/02 Hash Tables, Linear Probing Slides 18 Panopto Reading 06
Wed 10/04 Maps, Separate Chaining Slides 19 Panopto Homework 06
Fri 10/06 Memoization Slides 20 Panopto
Exam 01 Mon 10/09 Counting, Bucket Sort Slides 21 Panopto Reading 07
Wed 10/11 Review Checklist 01 Panopto Homework 07
Fri 10/13 Exam 01
Fall Break
Python Mon 10/23 Variables, Types, Expressions, Control Flow, Modules Slides 22 Panopto
Wed 10/25 Data Structures Slides 23 Panopto Reading 08
Fri 10/27 Classes, Typing, Testing Slides 24 Panopto
Binary Trees, Divide and Conquer Mon 10/30 Binary Trees Slides 25 Panopto Reading 09
Wed 11/01 Divide and Conquer Slides 26 Panopto Homework 08
Fri 11/03 Comprehensions, Generators Slides 27 Panopto
Binary Heaps, Priority Queues Mon 11/06 Binary Heaps Slides 28 Panopto Reading 10
Wed 11/08 Priority Queues Slides 29 Panopto Homework 09
Fri 11/10 Compression Slides 30 Panopto
Binary Search Trees Mon 11/13 Binary Search Trees Slides 31 Panopto Reading 11
Wed 11/15 Treaps Slides 32 Panopto Homework 10
Fri 11/17 Red-Black Trees Slides 33 Panopto
Graphs - Representation Mon 11/20 Representation Slides 34 Panopto Reading 12
Wed 11/22 Thanksgiving Homework 11
Fri 11/24 Thanksgiving
Graphs - Traverals Mon 11/27 DFS, BFS Slides 35 Panopto Reading 13
Wed 11/29 SSSP Slides 36 Panopto Homework 12
Fri 12/01 MST Slides 37 Panopto
Exam 02 Mon 12/04 Topological Sort Slides 38 Panopto
Wed 12/06 Review Slides R02 Panopto Homework 13
Thu 12/14 Exam 02


Component Points
Readings Weekly reading assignments. 12 × 3
Homeworks Weekly homework assignments. 12 × 12
Exams Exams covering each unit. 50 + 70
Total 300


Grade Points Grade Points Grade Points
A 280-300 A- 270-279
B+ 260-269 B 250-259 B- 240-249
C+ 230-239 C 220-229 C- 210-219
D 195-209 F 0-194

Due Dates

All Readings and Homeworks are to be submitted to your own private GitHub repository. Unless specified otherwise:

  • Readings are due by noon on the Monday of the assigned week.
  • Homeworks are due by noon on the Wednesday of the assigned week.



Students are expected to attend and contribute regularly in class. This means answering questions in class, participating in discussions, and helping other students.

Foreseeable absences should be discussed with the instructor ahead of time.


Recalling one of the tenets of the Hacker Ethic:

Hackers should be judged by their hacking, not criteria such as degrees, age, race, sex, or position.

Students are expected to be respectful of their fellow classmates and the instructional staff.

Students with Disabilities

Any student who has a documented disability and is registered with Disability Services should speak with the professor as soon as possible regarding accommodations. Students who are not registered should contact the Office of Disabilities.

Academic Honesty

Any academic misconduct in this course is considered a serious offense, and the strongest possible academic penalties will be pursued for such behavior. Students may discuss high-level ideas with other students, but at the time of implementation (i.e. programming), each person must do his/her own work. Use of the Internet as a reference is allowed but directly copying code or other information is cheating. It is cheating to copy, to allow another person to copy, all or part of an exam or a assignment, or to fake program output. It is also a violation of the Undergraduate Academic Code of Honor to observe and then fail to report academic dishonesty. You are responsible for the security and integrity of your own work.

Late Work

In the case of a serious illness or other excused absence, as defined by university policies, coursework submissions will be accepted late by the same number of days as the excused absence.

Otherwise, there is an automatic penalty of 25% late penalty for assignments turned in 12 hours past the specified deadline.

Note, there are opportunities for extensions as described below.

Classroom Recording

This course will be recorded using Zoom and Panopto. This system allows us to automatically record and distribute lectures to you in a secure environment. You can watch these recordings on your computer, tablet, or smartphone. In the course in Canvas, look for the "Panopto" tool on the left hand side of the course.

Because we will be recording in the classroom, your questions and comments may be recorded. Recordings typically only capture the front of the classroom, but if you have any concerns about your voice or image being recorded please speak to me to discuss your concerns. Except for faculty and staff who require access, no content will be shared with individuals outside of your course without your permission.

These recordings are jointly copyrighted by the University of Notre Dame and your instructor. Posting them to other websites (including YouTube, Facebook, SnapChat, etc.) or elsewhere without express, written permission may result in disciplinary action and possible civil prosecution.

Self-Service Extensions

Each Homework assignment has an associated Leet Point, which is an extra credit opportunity. To avoid a late penalty, a student may choose to forgo or give up that week's Leet Point in exchange for two more days in which the student can work on the assignment for full credit.

For instance if an assignment is due on Wednesday, then the student will have until Friday to submit their work.

To take advantage of this, a student simply makes a note on the Pull Request for the assignment and refrains from getting credit for the Leet Point.

Note, there are no free extensions for Readings. Instead, students should be aware that they can drop one Reading grade.

CSE Guide to the Honor Code

For the assignments in this class, you may discuss with other students and consult printed and online resources. You may quote from books and online sources as long as you cite them properly. However, you may not look at another student's solution, and you may not copy any significant portions of other's solutions. Furthermore, you may not utilize AI powered tools such as Co-Pilot, Tabnine, or ChatGPT for any of your programming assignments.

The following table summarizes how you may work with other students and use print/online sources:

Resources Solutions AI Tools
Consulting Allowed Not Allowed Not Allowed
Copying Cite Not Allowed Not Allowed

See the CSE Guide to the Honor Code for definitions of the above terms.

If an instructor sees behavior that is, in his judgment, academically dishonest, he is required to file either an Honor Code Violation Report or a formal report to the College of Engineering Honesty Committee.