Schedules

Week 1 (08/30):

Introduction

Week 2 (09/04 and 09/06):

Lists

Week 3 (09/11 and 09/13):

Linked lists

Week 4 (09/18 and 09/20):

Stacks and queues

Week 5 (09/25 and 09/27):

Recursions.

Week 6 (10/02 and 10/04):

Algorithms Analysis

Week 7 (10/09 and 10/11):

Trees

Week 8 (10/18):

BST and AVL

Week 9 (10/23 and 10/25):

Hashing

Week 10 (10/30 and 11/01):

Priority queues

Week 11 (11/06 and 11/08):

Sorting

Week 12 (11/13 and 11/15):

Some interesting algorithms

Week 13 (11/20):

Divide and conquer

Week 14 (11/27 and 11/29):

Greedy algorithms

Week 15 (12/04 and 12/06):

Dynamic programming