COP 3502H-01 - Spring 2003 - LECTURE NOTES PAGE

  • Introduction - (Day 1 - 1/7)

  • Algorithms - Part 1- (Days 2 & 3 - 1/9 & 1/14)

  • Algorithms - Part 2 & Review of C - (Day 4 - 1/16)

  • Asymptotic Analysis - (Day 5 - 1/21)

  • Computational Complexity - (Day 6 - 1/23)

  • Number Systems - (Day 7 - 1/28)

  • Files and Libraries in C - (Day 8 - 1/30)

  • Modular Programming and Functions - (Day 9 - 2/4)

  • Functions and Pointers - Part 2 - (Day 10 - 2/6)

  • Exam #1 Review Notes - (Day 11 - 2/22)

  • Thursday February 13th - EXAM #1

  • Test #1 KEY

    •
  • Searching and Sorting Algorithms - Part 1 - (2/18)

  • Recursion - (2/20)

  • Introduction to Data Structures - (2/25)

  • Advanced List Structures - (2/27)

  • Stacks and Queues - (3/4)

  • Binary Trees - (3/6)

  • Implementation Details for Linked Lists in C - (3/11)

  • Implementation Details for Doubly-Linked Lists in C - (3/13) REMINDER: CLASS MEETS IN CSB 101 TODAY

  • Return to Day 18 notes to continue material on binary trees.

  • Exam #2 Review Notes - (Day 22 - 3/27)

  • EXAM #2 - Tuesday April 1st NOTE: Class will meet in CSB 101 for the exam

  • Test #2 KEY

    •
  • Priority Queues and Binary Heaps - (Day 24 - 4/3)

  • AVL Trees - (Day 25 - 4/8)

  • More on Tree Rotations - (Day 26 - 4/10)

  • Graphs - (Day 27 - 4/15)

  • Finish Graphs and Final Exam Review - (Day 28 - 4/17)

    •

    Last updated: 4/16/2003
    Return to COP 3502H-01 home page