Mo We 1:00-4:00PM, Remote
Weekly notes (Summary notes and PDF slides are posted here)
Date | Announcement |
Create a gradescope account and a Piazza account with your UMB email if you don't have one. Make sure you are added. | |
The midterm exam will take place on August 6th. | The final exam will take place on August 24th. |
A systematic study of the methods of structuring and manipulating data in computing. Application programming interfaces, data abstraction, and the encapsulation of implementations. The design and analysis of algorithms. Advanced techniques for program development and organization.
Prerequisites are CS210 (Intermediate Computing), CS220 (Applied Discrete Math), and CS240 (C/Unix), or permission from the instructor.
Required: Algorithms (4th Edition), by Robert Sedgewick and Kevin Wayne, |
|
Algorithms Design, by Jon Kleinberg and Eva Tardos |
|
Recommended
supplement to help with JAVA: |
|
Recommended supplement to help with Algorithms: Introduction to Algorithms, Third Edition |
|
Another Recommended Supplement: The Algorithm Design Manual, Second Edition |
Homework and Programming assignments: | 25% |
Weekly Quiz: | 20% |
Midterm Exam: | 25% |
Final Exam: | 30% |
Final grades will be assigned based on the following standard scale
A | > 100 - 93 (the Registrar does not accept an A+ grade) |
A - | 92 - 90 |
B + | 89 - 86 |
B | 85 - 83 |
B - | 82 - 80 |
C + | 79 - 76 |
C | 75 - 73 |
C - | 72 - 70 |
D + | 69 - 66 |
D | 65 - 63 |
D - | 62 - 60 |
F | < 60 |
Homework assignments and Programming assignments: No late submission without permission (points will be taken off)
Week |
Topic |
Book Chapters |
Session Dates |
Session Info |
Slides/notes |
---|---|---|---|---|---|
1 |
Introduction |
K&T, Ch. 1-2 |
Monday, |
Introduction |
|
Wednesday, |
Matching |
||||
2 |
Matching |
K&T, Ch. 1-2 |
Monday, |
Matching | |
Wednesday, |
Matching |
||||
2 |
Runtime |
S&W, Ch. 1.4 |
Monday, |
Run time |
|
S&W, Ch. 1 |
Wednesday, |
Collections |
|||
3 |
Collections |
S&W, Ch. 3.1, 3.4 |
Monday, |
Lists, Sets, Maps | |
Wednesday, |
Wrap up collections Hash functions |
|
|||
3 |
Hash Tables |
S&W Ch. 3.4 |
Monday, |
Presidents' day |
|
Wednesday, |
Hashing Deletion |
||||
4 |
Graphs |
S&W Ch. 4.1-4.2 |
Monday, |
Undirected graphs | |
Wednesday, |
|||||
5 |
Undirected Graphs |
S&W Ch. 4.1 |
Monday, |
Wrap up undirected graphs |
K&T Graph slides S&W Directed Graph slides |
Wednesday, |
|||||
6 |
Directed Graphs |
S&W Ch. 4.2 |
Monday, |
DAGStrong Connectivity |
|
Wedneseday, |
MST Shortest paths |
||||
6 |
Shortest Paths |
K&T Ch. 4 |
Monday, |
Weighted Shortest Paths |
|
Wednesday, |
Graph Shortest Paths |
Read course specific instructions here.
Accommodations: Section 504 of the Americans with Disabilities Act of 1990 offers guidelines for curriculum modifications and adaptations for students with documented disabilities. If applicable, students may obtain adaptation recommendations from the Ross Center for Disability Services, Campus Center, UL Room 211, (617-287-7430). The student must present these recommendations and discuss them with each professor within a reasonable period, preferably by the end of Drop/Add period.