Week |
Date |
Topic |
Reading |
Notes |
1 |
08/28 |
Introduction | Course Syllabus | |
08/30 | Combinatorics: Counting, Multiplication Rule | Rosen 6.1,6.3 | 01counting.pdf | |
2 |
09/04 | Combinatorics: Counting, Addition Rule | Rosen 6.1, 6.3 | 02counting.pdf |
09/06 | Combinatorics: Combinations | Rosen 6.3, 6.5 | ||
3 | 09/11 | Combinations Binomial coefficients |
Rosen 6.5 | 03counting.pdf |
09/13 | Binomial coefficients | Rosen 6.4 | ||
4 | 09/18 | Combinatorial Identities Pigeonhole Principle |
||
09/20 | Probability | Rosen 7.1 | 04probability-1.pdf | |
5 | 09/25 | Conditional Probability, Independence | Rosen 7.2 | 04probability-2.pdf |
09/27 | Bernoulli Trials, Random variables | Rosen 7.3, 7.4 | 04probability-3.pdf | |
6 | 10/02 | Probability: Expected value and Variance | Rosen 7.4 | |
10/04 | Algorithm runtime analysis | Rosen 3.1, 3.2 | 06runtime.pdf | |
7 | 10/09 | Recurrences | Rosen 5.3, 8.1 | 07recurrences.pdf |
10/11 | Solving recurrences | Rosen 8.2, Solving recurrences with annihilators | 08recurrences.pdf | |
8 | 10/16 | Solving recurrences and proving correctness by induction (induction review) | Rosen 5 | |
10/18 | Midterm | |||
9 | 10/23 | Solving recurrences. Divide and conquer: merge sort | Rosen 8.3 | 09divide-and-conquer.pdf |
10/25 | Divide and Conquer | |||
10 | 10/30 | Trees | 10trees.pdf | |
11/01 | Binary trees | |||
11 | 11/06 | Binary search trees | ||
11/08 | Balanced BST: AVL trees | 12trees.pdf | ||
12 | 11/13 | Balanced BST: AVL trees | ||
11/15 | Hashing | 13hashing.pdf | ||
13 | 11/20 | Hashing | ||
11/25 | No class: Thanksgiving! | |||
14 | 11/27 | Sorting | 14sorting.pdf | |
11/29 | Sorting | |||
15 | 12/04 | Priority queues, heaps | 15heap_priority.pdf | |
12/06 | Relations. Graphs | 16relations.pdf | ||
Final |
12/12 | 10:30 12:30 220 Douglas Hall See the schedule. Let the course instructor know if there is a conflict |
---|
I | Attachment | Action | Size | Date | Who | Comment |
---|---|---|---|---|---|---|
![]() |
01counting.pdf | manage | 1388.6 K | 2012-08-30 - 06:17 | UnknownUser | |
![]() |
02counting.pdf | manage | 547.7 K | 2012-09-04 - 05:01 | UnknownUser | |
![]() |
03counting.pdf | manage | 617.5 K | 2012-09-11 - 05:12 | UnknownUser | |
![]() |
04probability-1.pdf | manage | 1481.8 K | 2012-09-20 - 17:58 | UnknownUser | |
![]() |
04probability-2.pdf | manage | 159.7 K | 2012-09-25 - 07:40 | UnknownUser | |
![]() |
04probability-3.pdf | manage | 572.1 K | 2012-09-27 - 00:18 | UnknownUser | |
![]() |
06runtime.pdf | manage | 194.5 K | 2012-10-02 - 06:37 | UnknownUser | |
![]() |
07recurrences.pdf | manage | 139.3 K | 2012-10-11 - 14:05 | UnknownUser | |
![]() |
08recurrences.pdf | manage | 172.4 K | 2012-10-11 - 14:05 | UnknownUser | |
![]() |
09divide-and-conquer.pdf | manage | 425.0 K | 2012-10-26 - 04:01 | UnknownUser | |
![]() |
10trees.pdf | manage | 1817.4 K | 2012-11-05 - 08:55 | UnknownUser | |
![]() |
12trees.pdf | manage | 2402.5 K | 2012-11-06 - 19:34 | UnknownUser | |
![]() |
13hashing.pdf | manage | 412.1 K | 2012-11-27 - 07:16 | UnknownUser | |
![]() |
14sorting.pdf | manage | 1060.3 K | 2012-11-27 - 07:16 | UnknownUser | |
![]() |
15heap_priority.pdf | manage | 580.1 K | 2012-11-27 - 07:17 | UnknownUser | |
![]() |
16relations.pdf | manage | 402.1 K | 2011-11-30 - 19:07 | UnknownUser | |
![]() |
recurrences-handout.pdf | manage | 577.2 K | 2010-10-28 - 04:12 | UnknownUser |
Copyright 2016 The Board of Trustees of the University of Illinois.webmaster@cs.uic.edu |
WISEST Helping Women Faculty Advance Funded by NSF | ![]() | ![]() |