- Course URL: http://prof.msoltys.com/?page_id=6829
- Canvas Page: https://cilearn.csuci.edu/courses/25100
- Course Material
- CI Catalogue URL
- Instructor: Michael Soltys <michael.soltys@csuci.edu>
- Course Outline: This course is an introduction to the analysis of algorithms. We are going to cover some basics of proving algorithm correctness (pre/post-condition, loop invariants, and termination), and then we are going to spend the bulk of the time on three classical categories of algorithms: Greedy, Divide-and-Conquer, and Dynamic Programming. We are going to see examples of problems that yield to these types of algorithms. We will discuss NP-completeness when we meet Dynamic Programming algorithms.
- Lectures: W 6:00-7:00 online
- Textbook: Introduction to the Analysis of Algorithms, by Michael Soltys
- Grading: 10 quizzes, worth 5% each, and 4 assignments, worth 5% each, and two midterms and a final exam worth 10% each.
- How to avoid plagiarism: Verbal discussions of problems among students are allowed, but you should not show written notes, and you should not leave such discussions with written notes.
- Attendance: Students are encouraged but not required to attend the lectures. All quizzes, assignments, midterms and the final exam will be written online.
Course outline
| – Course Introduction | Aug 23 | |
| – Proving correctness | 1.1 | Aug 30 |
| – Stable Marriage – Quiz 1 | 1.2.2 | Sep 6 |
| – Greedy: MCST – Quiz 2 | 2.1 | Sep 13 |
| – Greedy: Jobs with deadlines & profits – Quiz 3 – Assignment 1 (Google) | 2.2 | Sep 20 |
| – Greedy: Other examples – Quiz 4 | 2.3 | Sep 27 |
| Midterm 1 – Greedy | Oct 4 | |
| – Divide & Conquer: Mergesort – Quiz 5 – Assignment 2 (Make Change) | 3.1 | Oct 11 |
| – Divide & Conquer: Binary Multiplication – Quiz 6 | 3.2 | Oct 18 |
| – Divide & Conquer: Savitch – Quiz 7 – Assignment 3 (Strassen Algorithm) | 3.3 | Oct 25 |
| Midterm 2 – Divide & Conquer | Nov 1 | |
| – Dynamic Programming: Longest Monotone Subsequence Problem – Quiz 8 | 4.1 | Nov 8 |
| – Dynamic Programming: All Pairs Shortest Path Problem – Quiz 9 | 4.2 | Nov 15 |
| – Dynamic Programming: Knapsack Problem – Quiz 10 – Assignment 4 () | 4.3 | Nov 22 |
| Final Exam | Nov 29 |
Students with disabilities: Cal State Channel Islands is committed to equal educational opportunities for qualified students with disabilities in compliance with Section 504 of the Federal Rehabilitation Act of 1973 and the Americans with Disabilities Act (ADA) of 1990. The mission of Disability Accommodation Services is to assist students with disabilities to realize their academic and personal potential. Students with physical, learning, or other disabilities are encouraged to contact the Disability Accommodation Services office at (805) 437-8510 for personal assistance and accommodations. Please discuss your arrangements with the instructor as soon as possible.