Class Notes

• Syllabus
• Chapter 1, Basic C++
  • Part 1
• Chapter 3, Analysis Tools
  • Part 1
  • Part 2
  • Part 3
  • Part 4
• Chapter 10, Sorting
  • Merge Sort
  • Lower Bound on Sorting
  • Other Sorts
• Chapter 4, Stacks and Queues
  • Stacks
  • Queues
  • STL
  • An example
  • Another Example
  • Stack Example
• Chapter 5, We have covered this in our discussions in chapter 4.
• Chapter 6, Trees
  • ADT Tree
  • Basic Tree Algorithms
  • Binary Trees
  • Data Structures for Trees
  • An example
  • Huffman code and Greedy Algorithms
• Chapter 7, Priority Queues
  • ADT Priority Queue
  • Implementing A Priority Queue
  • Heaps
  • Implementing a Heap
  • Heapsort
• Chapter 9, Search Trees
  • Binary Search Trees
  • AVL Trees
  • Red Black Trees
• Chapter 12, Graphs
  • Introduction
  • Representation
  • Traversals/BFS
  • DFS
  • Directed Graphs
  • MST
  • Shortest Path
• Chapter NP
  • Basic Definitions
  • The Class NP-Complete
  • Circuit Satisfiability
  • Some other NP-Complete Problems