CS140 -- Lecture Notes

James S. Plank

• Migration from C++ to C -- some Basics.

• Read this on your own: Introduction, review of compilation, C, and a little computer organization.

• C types and pointers, plus some hexadecimal.

• Pointers, string routines and malloc().

• Structs and Fields.

• Another pointer-laden program with picture examples.

• Malloc, fields, variance.

• Void Stars and Information Hiding.

• More Information Hiding/(Void *)'s - PGM Files.

• Unions.

• Jvals.

• Stacks.

• Queues.

• Singly-linked lists.

• Dllists and an example program of using the val.v part of a Dllist to hold a pointer to a struct.

  The midterm covers all material up to this point in the class.

• Big O.

• Hashing.

• Recursion.

• A recursive Sudoku solver - brief notes.

• Enumeration and The Recursive Matrix.

• The tree data structure

• Binary search trees, AVL trees, Splay trees, B-Trees.

• See the following lecture notes on Red-Black Trees for reference material on red-black trees.

• Heaps and heapsort.

• The Disjoint Set API and Examples