|
|
|
Last revised December 9, 2018
The
contents of this website, the links contained therein directly and
indirectly, and the contents of the said links, are copyrighted.
They are provided exclusively for
non-profit educational use by the students currently enrolled in this
course and for the duration of this semester. No other use or any use
by others is allowed
without authorization of the professor in this course and copyright
holder or holders.
Course
Schedule (subject to revision - please visit
on a weekly basis).
Currently covered chapter (click here) is highlighted white.
- Chap. 1 (Analyzing Algorithms and Problems: Principles and Examples.): Weeks 1,
2 (see the calendar below).
- Chap. 2 (Data Abstraction and Basic Data Structures) - 3 (Recursion and Induction) individual reading
- Chap. 4 (Sorting): Weeks 3, 4, 5,
6.
- Chap. 5 (Selection and Adversary Arguments): Week 7.
- Chap.
7 (Graphs and Graph Traversals) - 8 (Graph Optimization Problems and Greedy Algorithms): Weeks 8, 9, 10.
- Chap. 10 (Dynamic Programming): Weeks 11, 12.
- Chap. 13 (NP-Complete Problems): Week 13, 14.
Calendar
of weeks of Mo classes for Fall 2018 for this course:
week 1: Aug 27
week 2: Sep 10
week 3: Sep 17
week 4: Sep 24
week 5: Oct 1
week 6: Oct 8
week 7: Oct 15
week 8: Oct 22
week 9: Oct 29
week 10: Nov 5
week 11: Nov 19
week 12: Nov 26
week 13: Dec 3
week 14: Dec 10
week 15 (final): Dec 17, 7:45 p.m. - 9:45 p.m
|
|
