COP 3503H - Fall 2002 - LECTURE NOTES PAGE

  • Day 2 - (8/21)

  • Day 3 - (8/26)

  • Day 4 - (8/28)

  • Day 5 - (9/4)

  • Day 6 - (9/9)

  • Day 7 - (9/11)

  • Day 8 - (9/16)

  • Day 9 - (9/18) Backtracking algorithms

  • Day 9 Supplement - (9/18)

  • Day 10 - (9/23) Basic sorting techniques

  • Day 11 - (9/25) Advanced sorting techniques

  • Sorting Supplement - (9/25)

  • Day 12 - (9/30) Randomization and probability distributions

  • Mid-Term Exam   - Day 13 - (10/2)

  • Day 14 - (10/7) Linked list implementation issues

  • Day 15 - (10/9) Tree implementation issues and applications

  • Day 16 - (10/14) Tree applications and Binary Search Trees

  • Day 17 - (10/16) Search trees and Balancing Trees

  • Day 18 - (10/21) Advanced Search Trees - AVL Trees

  • Day 19 - (10/23) More Details on Tree Rotations

  • Day 20 - (10/28) Beyond Binary Search Trees

  • Day 21 - (10/30) Priority Queues and Binary Heaps

  • Day 22 - (11/4) Introduction to Graphs

  • Day 23 - (11/6) Graph Traversals and Shortest Path Algorithms

  • Day 24 - (11/13) Euler Circuits, Spanning Trees, and Topological Sorting

  • Day 25 - (11/18) Cycle Detection, Kruskal's Algorithms, All-to-All Shortest Path Problems

  • Day 26 - (11/20) Hamiltonian Cycle Problem

  • Day 26 and Day 27 - (11/20 and 11/25) Hashing

  • Day 28 - Wednesday November 27th - Oral Presentations of Selected Data Structures

  • Day 29 - Finish Oral Presentation (if needed) and Final Exam Review - (12/2)

  • Day 30 - Wednesday December 4th - FINAL EXAM - 1:00PM-2:50PM - ENG2 105

    • Last updated: 11/20/02
    Return to COP 3503H home page