COP 4530 - Notes and Resources

Lecture notes from COP 3330 -- pre-requisite course -- (use as needed for review)

COP 4530 Lecture Notes / Outlines

• Math Review
• Some review topics (COP 3330)
  • Recursion
  • Template functions and classes
  • Intro to Data Structures
• From Course textbook material -- review topics with some C++11 features added in
  • Ch.1 -- Basic C++ review topics (powerpoint)
  • Ch. 1 -- C++ template review topics (powerpoint)
• References, parameters, returns - (with some new C++11 features)
• Intro to Iterators
• Functors (Function Objects)
• Ch. 2 -- Algorithm Analysis (powerpoint)
  • Maximum Subsequence algorithms
• Ch 3. ADTs, Iterators, Sequence containers
  • ADTs, Iterators, Vector (powerpoint)
    • Vector class code (from Ch 3)
  • Linked List (powerpoint)
  • Stacks/Queues (powerpoint)
  • Deques (powerpoint)
• Ch 4. Trees
  • Trees - Part 1 (powerpoint)
  • Trees - Binary Trees (powerpoint)
  • Trees - Binary Search Trees (powerpoint)
  • Trees - AVL Trees, B trees (powerpoint)
• Ch 5. Hashing / Hash tables
  • Hash Functions (powerpoint)
  • Hash Tables (powerpoint)
• Ch 6. Priority Queues / Heaps
  • Priority Queues / Heaps (powerpoint)
• (Note: Test 2 goes up through Chapter 6)
• Ch 7. Sorting
  • Sorting Algorithms (powerpoint)
  • Heapsort, Mergesort, and Quicksort (powerpoint)
  • Sort Visualizer -- Here is a very cool web site that helps you visualize various sort algorithms as they run!
• Ch 9. Graph Algorithms
  • Graphs (powerpoint)