Lecture Materials

Coursepack: pdf

The lectures can be watched live via streaming video. If you get a message saying that no live events scheduled, wait a brief time and then refresh the page in your browser.

To ask questions during lecture, you can enter the CSCIE119 chat room. Go to http://chat.dce.harvard.edu. The first time, you will need to register by clicking on the Register link under Account management. A password will be emailed to you. Once you receive it, you can login, selecting CSCIE119 from the Select a chat room... drop-down menu.

Recorded versions of the lectures are available using the video links below. These links become active within 24-48 hours of the actual lecture. If you get an error message saying that you don't have permission, that means that the video isn't ready yet, and you should try again later.

Instructions for obtaining the example source-code files are available here.

1. Introduction (9/5)
notes (pdf), video (see note above), optional readings

2. Recursion and Backtracking (9/12)
notes (pdf), video (see note above), optional readings, map-coloring example

3. Sorting and Algorithm Analysis I (9/19)
notes (pdf) video, optional readings, Lafore's sorting-demo applets

4. Sorting and Algorithm Analysis II (9/26)
notes (see last week), video, optional readings, Lafore's sorting-demo applets, Ellard's sorting demos, Lang's sorting demos

5. Linked Lists (10/3)
notes (pdf), video, optional readings, Lafore's linked-list applet

6. Lists, Stacks, and Queues I (10/10)
notes (pdf; updated 10/15 to add a missing slide for LLQueue remove),
video, optional readings, Lafore's linked-list and stack applets

7. Lists, Stacks, and Queues II (10/17)
notes (see last week, plus the start of the notes on state-space search), video, optional readings, Lafore's stack and queue applets

8. State-Space Search (10/24)
notes (pdf), video, optional readings,
a graph applet from Lafore that allows you to build a tree and step through BFS and DFS,
a search-demo applet from RMIT that steps through different search algorithms applied to the eight puzzle (instructions)

9. Binary Trees and Huffman Encoding; Binary Search Trees (10/31)
notes (pdf), video, optional readings, Lafore's binary tree applet

10. Balanced Search Trees; Heaps and Priority Queues I (11/7)
notes (balanced trees, heaps), video, optional readings, Lafore's binary tree applet and heap applet

11. Heaps and Priority Queues II; Hash Tables (11/14)
notes (last week's notes on heaps, hash tables), video, optional readings,
RMIT's search-demo applet, which allows you to step through greedy search and A* search (instructions),
Lafore's applets: linear probing, quadratic probing and double hashing, separate chaining
(note: h1 = key % table_size, h2 = 5 - (key % 5))

12. Graphs I (11/28)
notes (earlier notes on hash tables; graphs), video, optional readings, Lafore's graph-demo applets

13. Graphs II (12/5)
notes (see last week), video, optional readings, Lafore's graph-demo applets

14. Final-Exam Review (12/12)
practice final, solutions, video