CSE 20289 is a core Computer Science and Engineering course at the University of Notre Dame that explores the fundamentals of computing systems. This course introduces students to the Unix programming environment where they will explore various command line utilities, files, processes, memory management, system calls, data structures, networking, and concurrency. Examining these topics will enable students to become familiar and comfortable with the lower level aspects of computing, while providing the foundation for further study in subsequent systems courses such as computer architecture and operating systems.
Upon successful completion of this course, students will be able to:
Utilize unix commands to navigate filesystems, edit files, manage processes, explore system and network properties, produce documents and plots, and manipulate multimedia files.
Employ Unix development tools to compile, link, build, debug, trace, profile, and test software applications.
Compose shell scripts to automate tasks.
Construct regular expressions and small programs to filter and process a variety of datasets.
Develop basic Python scripts that process data and orchestrate processes.
Manage memory and other system resources manually and utilize tools to help debug and profile applications.
Utilize basic system calls to create processes that interact with each other via various forms of inter-process communication such as files, pipes, and sockets.
Discuss the core tenets of the "Unix Philosophy" and how it is applied to modern software development.
|Introduction||01/17||Introduction, Syllabus, Shell Slides Slides|
|01/19||Git, Markdown Slides||Reading 00|
|Using The Shell||01/22||MLK Celebration Luncheon||Reading 01|
|01/26||Processes, I/O Redirection Slides Slides||Homework 01|
|Scripting The Shell||01/29||Networking Slides||Reading 02|
|01/31||Bourne Shell Slides|
|02/02||Bourne Shell||Homework 02|
|Filtering Text||02/05||Regular Expressions Slides||Reading 03|
|Scraping Data||02/12||Python, Variables, Control Flow Slides||Reading 04|
|02/16||Checklist 01 Exam 01|
|Visualizing Data||02/19||Jupyter, Data Structures, Files, Regular Expressions, Requests||Reading 05|
|02/21||Matplotlib, CSV, JSON, HTML, Widgets|
|02/23||Processes, Modules, OOP||Homework 04|
|Processing Data||02/26||Functional Programming, Generators||Reading 06|
|Fury + Hulk||03/05||Makeflow|
|03/09||Exam 02||Project 01|
|Pointers, Arrays, Strings||03/19||Compiling, Building, I/O||Reading 07|
|03/21||Pointers, Arrays, Strings|
|03/23||Debugging (GDB, Valgrind)||Homework 06|
|Dynamic Memory||03/26||Memory Allocation||Reading 08|
|03/28||Structs, Linked Lists|
|04/04||Data Representation, Bitsets, Unions|
|04/06||Hashing, Hash Tables, Bloom Filters||Homework 07|
|Thor + Spidey||04/30||VPS|
|05/04||Reading Day||Project 02|
|Readings Weekly reading assignments.||10 × 4|
|Homeworks Weekly homework assignments.||5 × 10, 5 × 12|
|Projects Periodic group projects.||10 + 20|
|Exams Midterm and Final Exams.||30 + 30 + 60|
All Readings and Homeworks are to be submitted to your own private GitLab repository. Unless specified otherwise:
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.
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.
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.
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, a late penalty, as determined by the instructor, will be assessed to any late submission of an assignment. In general, the late penality is 25% off for less than a week and 50% off for more than a week. The instructor reserves the right to refuse any unexcused late work.
Notre Dame has implemented a classroom recording system. This system allows us to record and distribute lectures to you in a secure environment. You can watch these recordings on your computer, tablet, or smartphone. The recordings can be accessed within Sakai.
Because we will be recording in the classroom and/or using an active learning environment, your questions and comments may be recorded. (Video recordings typically only capture the front of the classroom.) If you have any concerns about your voice or image being recorded, please speak to me to determine an alternative means of participating. No content will be shared with individuals outside of your course without your permission except for faculty and staff that need access for support or specific academic purposes.
These recordings are jointly copyrighted by the University of Notre Dame and your instructor. Posting them to other websites, including YouTube, Facebook, Vimeo, or elsewhere without express, written permission may result in disciplinary action and possible civil prosecution.
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 look at solutions.
For further guidance please refer to the CSE Honor Code or ask the instructor.