CompSci 165 notes

• Big arrays in C procedures
• Coding standards
• Documentation standards
• Handling interrupts in C
• Make: a Unix programming aid
• Testing and verification
• Optimal binary search trees
• Dynamic binary search trees - AVL and splay trees

More recently modified

• Memory allocation
• Timing
• Binary I/O
• Static Huffman coding