CSE 30341 is the one of the core classes in the Computer Science and Engineering program at the University of Notre Dame. This course introduces many different aspects of modern operating systems. Topics may include process structure and synchronization, interprocess communication, concurrency and parallelism with threads, virtual memory, resource allocation, file systems, security, and distributed systems.

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

Class Information

Lecture
T/TH 9:30 AM - 10:45 AM
Location
129 DeBartolo Hall
Zoom Meeting
934 4779 0536
Mailing List (Class)
fa23-cse-30341-01-group@nd.edu
Mailing List (Staff)
fa23-cse-30341-01-staff-list@nd.edu
Slack
#cse-30341-fa23
GitHub
nd-cse-30341-fa23

Instructor

Instructor
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
Matthew Carbonaro (mcarbona@nd.edu)
Teaching Assistant
Josh Chun (jchun2@nd.edu)
Teaching Assistant
Danielle Croft (dcroft@nd.edu)
Teaching Assistant
Tommy Deiser (tdeiser@nd.edu)
Teaching Assistant
Mary Hanstad (mhanstad@nd.edu)
Teaching Assistant
Anna Klempay (aklempay@nd.edu)
Teaching Assistant
Jozef Porubcin (jporubci@nd.edu)
Teaching Assistant
Matt Spadafore (mspadafo@nd.edu)
Teaching Assistant
Coleen Joelle Valencia (cvalenc3@nd.edu)
Teaching Assistant
Kelly Williams (kwilli29@nd.edu)

Help Protocol

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

Office Hours

Unit Date Topics Assignments
Unit 01: System Calls and Processes
Hardware, Operating Systems Tue 08/22 Syllabus, Computer Hardware, Boot Sequence Slide 00 Slide 01 Panopto Reading 01
Thu 08/24 OS Taxonomy, History, Themes Slide 02 Panopto
System Calls, Processes Tue 08/29 System Calls Slide 03 Panopto Reading 02
Thu 08/31 Processes Slide 04 Panopto
Scheduling Tue 09/05 Scheduling (FIFO, Round Robin) Slide 05 Panopto Reading 03
Thu 09/07 Scheduling (MLFQ, Lottery) Slide 06 Panopto
Sat 09/09 Project Project 01
Unit 02: Concurrency with Threads
Concurrency Tue 09/12 Events Slide 07 Panopto Reading 04
Thu 09/14 Threads Slide 08 Panopto
Locks, Condition Variables Tue 09/19 Locks Slide 09 Panopto Reading 05
Thu 09/21 Condition Variables Slide 10 Panopto
Semaphores, Structures Tue 09/26 Semaphores Slide 11 Panopto Reading 06
Thu 09/28 Structures Panopto
Concurrency Bugs Tue 10/03 Patterns Panopto Reading 07
Thu 10/05 Race Conditions, Deadlock Slide 12 Panopto
Sat 10/07 Project Project 02
Exam 01: System Calls, Processes, Threads
Exam 01 Tue 10/10 Review Slide R01 Panopto
Thu 10/12 Exam 01
Fall Break
Unit 03: Virtual Memory
Virtual Memory Tue 10/24 Address Space, Translation Slides 13 Panopto Reading 08
Thu 10/26 Free-Space Management Slides 14 Panopto
Heap Management, Segmentation Tue 10/31 Heap Management Panopto Reading 09
Thu 11/02 Segmentation Slides 15 Panopto
Paging Tue 11/07 Paging Slides 16 Panopto Reading 10
Thu 11/09 TLB / Multi-Level Slides 17 Panopto
Sat 11/11 Project Project 03
Unit 04: File Systems
Swapping, Devices Tue 11/14 Swapping Slides 18 Panopto Reading 11
Thu 11/16 I/O Devices Slides 19 Panopto
RAID Tue 11/21 RAID Slides 20 Panopto Reading 12
Thu 11/23 Thanksgiving
File Systems Tue 11/28 File Systems Slides 21 Panopto Reading 13
Thu 11/30 LFS, FFS Slides 22 Panopto
Consistency, Integrity Tue 12/05 Consistency, Integrity Slides 23 Panopto
Thu 12/07 Review Slides R02 Panopto Project 04
Exam 02: Virtual Memory, File Systems
Exam 02 Fri 12/15 Exam 02

Coursework

Component Points
Readings Weekly individual reading assignments. 10 × 6
Projects Periodic group projects. 4 × 30
Exams Two timed exams. 2 × 60
Total 300

Grading

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 are to be submitted to your own private GitHub repository. Unless specified otherwise:

  • Readings are due by noon on the Tuesday of each week.
  • Projects are due by noon on the Saturday of each week.

Policies

Participation

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.

Community

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 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 25% late penalty for assignments turned in 12 hours past the specified deadline.

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.

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 judgement, academically dishonest, he is required to file either an Honor Code Violation Report or a formal report to the College of Engineering Honesty Committee.