CIS 350 Lecture Notes - Fall 2000

• Abstract Data Types (part 1)
• Abstract Data Types (part 2), Stacks and Queues, Program Compexity (part 1)
• Program Complexity (part 2), Recursion (part 1)
• Linked Lists (part 1)
• Link Lists (part 2), Searching, Hashing (part 1)
• Hashing (part2) and Binary Trees
• Trees
• AVL Trees
• Graphs
• Digraphs
• Sorting Algorithms
• Parallel Algorithms
• Algorithm Design