CS140 -- Lecture Notes

If I cover a significant amount of material that is not in the book, I will provide lecture notes for the material, and include it here. I will also try to keep track of what the lecture material is for each day here.

The topics that I anticipate covering are:

General C review
Pointers and I/O using the fields library
Linked lists: using the dlist library
Stacks and queues
Basic Algorithm Analysis
Binary trees: search trees, AVL trees, splay trees
Binary trees: writing binary tree code
Hashing
Sorting (if time permits)

Reading Assignments/Lecture Notes

January 13: Introduction, review of compilation, C, and a little computer organization.
January 18: C types and pointers, plus
some hexidecimal.
January 20: Pointers, string routines and malloc(). A small test on pointers.
January 25: Structs and Fields.
January 27: Fields continued.
February 1: Malloc and Fields (the first TokenGen lecture). No notes necessary since you've already handed in notes for this lecture.
February 3: Void Stars (the second TokenGen lecture).
February 8: Finishing up Void Stars (the second TokenGen lecture) and then Unions.
February 10:
- Weiss 3.1-3.2
- Jvals.
- Singly Linked Lists
February 15: Finishing Singly Linked Lists, and then doing Doubly Linked Lists.
February 17: Midterm
February 22:
- Weiss 3.3
- Stacks and the beginning of the stack implementation lecture.
February 24:
- Weiss 3.4
- Finishing the stack implementation lecture, and then going over Queues.
March 1:
- Finishing the Queues lecture (you've already outlined this part)
- Weiss Chapter 2
- Big-O.
March 3: More Big-O.
March 8: More Big-O.
March 10:
- Bits and
- Hashing: Weiss 5.1-5.3
March 15 : Weiss 5.4-5.5--Open addressing and rehashing
March 17: Midterm
March 29:
- Introduction to trees: Weiss 4.1-4.2
- Binary Search Trees: Weiss 4.3 and Binary Search Trees.
March 31: More binary search trees.
April 5 and 7: Finishing binary search trees. Starting AVL trees (section 4.4 in the book), and these supplemental lecture notes.
April 12 and 14: Finishing AVL trees and moving on to Splay trees.
April 19: Midterm 3
Final Exam: Tues. May 3, 12:30-2:30pm

Not Yet Assigned

April 21: End of Recursion.
April 26: Catch up
Final: Date/Time not yet known