CSE 34872 is an elective course in the Computer Science and Engineering program at the University of Notre Dame. This course encourages the development of practical programming and problem solving skills through extensive practice and guided learning. The bulk of the class revolves around solving brain-teaser and puzzle-type problems that often appear in programming contests, online challenges, and job interviews. Additionally, basic software engineering practices such as planning, debugging, testing, and source code management may be discussed.
Upon successful completion of this course, students will be able to:
Parse a variety of inputs and model problems.
Utilize appropriate data structures to represent and solve problems.
Implement common problem solving techniques and algorithms.
Employ modern software development methods and tools.
Debug and test code within an automated testing environment.
Unit | Date | Topics | Assignments |
---|---|---|---|
Preparation | 05/29 | Preparation | Reading 00 |
I/O, Sequence Containers | 06/03 | I/O, Complexity, Coding Style, Linting Slides Slides Video | Reading 01 |
06/05 | Arrays, Lists, Stacks, Queues Slides Video | ||
06/08 | Programming Challenges | Challenge 01 Challenge 02 Challenge 03 | |
Searching, Sorting, Associative Containers | 06/10 | Searching, Sorting Slides Video | Reading 02 |
06/12 | Sets, Maps, Testing Slides Video | ||
06/15 | Programming Challenges | Challenge 04 Challenge 05 Challenge 06 | |
Complete Search, Greedy Algorithms | 06/17 | Subsets, Permutations, Backtracking Slides Video | Reading 03 |
06/19 | Optimization, Compression Slides Video | ||
06/22 | Programming Challenges | Challenge 07 Challenge 08 Challenge 09 | |
Bit Manipulation, Dynamic Programming | 06/24 | Bitsets, Memoization Slides Video | Reading 04 |
06/26 | Table Building, Profiling Slides Video | ||
06/29 | Programming Challenges | Challenge 10 Challenge 11 Challenge 12 | |
Trees | 07/01 | Representation, Traversal Slides Video | Reading 05 |
07/03 | Divide and Conquer Video | ||
07/06 | Programming Challenges | Challenge 13 Challenge 14 Challenge 15 | |
Graphs I | 07/08 | Representation, Traversal Slides Video | Reading 06 |
07/10 | Shortest Paths, Spanning Trees Video | ||
07/13 | Programming Challenges | Challenge 16 Challenge 17 Challenge 18 | |
Graphs II | 07/15 | Topological Sorting Slides Video | Reading 07 |
07/17 | Paths, Flows and Cuts Slides Video | ||
07/20 | Programming Challenges | Challenge 19 Challenge 20 Challenge 21 | |
In-Class Contest | 07/22 | Contest | |
07/24 | Contest |
Component | Points |
---|---|
Readings Weekly reading assignments. | 6 × 4 |
Challenges Weekly programming challenges. | 19 × 6 |
Style Programming style for each challenge. | 18 × 2 |
External External programming contest. | 2 × 30 |
Contests In-class programming contests. | 36 |
Participation Regular class attendation and contribution to course community. | 30 |
Total | 300 |
Grade | Points | Grade | Points | Grade | Points |
---|---|---|---|---|---|
A | 285-300 | A- | 270-284 | ||
B+ | 260-269 | B | 250-259 | B- | 240-249 |
C+ | 230-239 | C | 220-229 | C- | 210-219 |
D | 195-209 | F | 0-194 |
All Readings and Challenges are to be submitted to your own private GitLab repository. Unless specified otherwise:
Readings are due at noon on the Monday of each week.
Challenges are due at noon on the Saturday of each 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.
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, there is a penalty of 25% per day late (except where noted). You may submit some parts of an assignment on time and some parts late. Each submission must clearly state which parts it contains; no part can be submitted more than once.
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.
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.
The following table summarizes how you may work with other students and use print/online sources:
Resources | Solutions | |
---|---|---|
Consulting | Allowed | Not Allowed |
Copying | Cite | 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.
This is our main textbook for the semester. It contains background information regarding the algorithms and data structures we will be utilizing and implementing to solve different problems.
This contains a list of topics and links to resources to help students become competitive at programming contests.
This site has information about common questions and concepts often used in technical programming interviews, along with some answers to the questions.
This is a long list of common data structures and algorithm problems.
This is another list of common data structures and algorithms.
This site is an online judge for programming challenges found in the book Programming Challenges.
This site is contains a variety of programming challenges similar to what is found in ACM programming contests. It also includes non-programming contest type problems as well and is a platform for evaluating and testing your programming skills.
This is another site that contains a variety of programming challenges.
This is another site that contains a variety of programming challenges. It also periodically runs contests and learning resources.
This site is a large set of mathematical and programming problems designed to test your abilities and sharpen your skills. The problems make for good practice.
This is global programming competition where programmers test their skills by solving multiple rounds of algorithmic puzzles.
This is an annual series of programming challenges.