CISC 320 Algorithms and Advanced Programming

Reload! This page is updated several times a week. The version in your web browser cache is probably stale. Reload it!

(you're currently looking at the version done 12/11/96)

Next up

  • Dec 19: Final Exam is at 10:30am to 12:30pm in 233a Purnell Hall.

    What we've done (in reverse chronological order)

  • Dec 11: P, NP, NPC,
    review sheet for final exam.
    Assigbment 10 due.
  • Dec 9: NP Completeness, continued
  • Dec 6: NP Completeness
    Reading: Chapter 45
  • Dec 4: Exaustive search
    Reading: Chapter 44
    Exams returned, Go over exam.
    Assigbment 10: exercises 42.5, 44.2, 44.5, 45.9 Due Wed. Dec 11.
  • Dec 2: Dynamic programming
    Reading: Chapter 42
  • Nov 27: Finish transitive closure.
    Reading: Chapter 32 and handout
  • Nov 25: Second Midterm Exam
    2nd midterm review handout is a guide to study.
  • Nov 22: Directed graph algorithms. Review session
    Reading: Chapter 32
  • Nov 20: Solving the spider
  • Nov 18: Minimum Spanning Trees, Kruskal, priority first algs,
    Dijkstra's shortest path algorithm.
    Assignment 9: exercises 30.1, 30.2, 31.2, 31.5 Due Mon, Nov 25.
  • Nov 15: Minimum Spanning Trees, min edge on cut principle
    Assignment 8 due (see handout)
    Reading: Chapter 31
  • Nov 13: Union-Find cont., Weighted graphs
  • Nov 11: Union-Find algorithm
  • Nov 8: Depth First Spanning Trees
    Reading: Chapter 30
    Assignment 8 handout distributed.
  • Nov 6: Regular expressions revisited.
  • Nov 4: Graph algorithms
    Reading: Chapter 29
  • Nov 1: Random Number Generators
    Reading: Chapter 35.
  • Oct 30: Simulating Nondeterministic FSMs
    Assignment 7a: exercises 20.2, 20.3, 23.7 Due Wed, Nov 6.
  • Oct 28: Pattern Matching - Regular Expressions and Finite State Machines
    Reading: Chapter 20.
  • Oct 25: Cryptology - RSA encryption
  • Oct 23: Cryptograpy and Steganography
    Reading: Chapter 23.
  • Oct 21: finish Limpel-Zev file compression.
  • Oct 18: Huffman code finished, Limpel-Zev started.
    Reading: chapter 22, Walsh handout.
    Assignment 6: exercises 19.5, 19.7, 22.6, 22.7 Due Wed, Oct 23.
  • Oct 16: Go over test, Huffman File compression algorithm
    Reading: chapter 22.
  • Oct 14: First midterm test. (Note change from syllabus date)
    Covers initial material on trees, sorting, searching.
  • Oct 11: Review for midterm test.
    Finish chapter 19, Boyer-Moore algorithm
  • Oct 9: String Searching algorithms continued
    midterm review handout .
  • Oct 7: Knuth-Morris-Pratt String Searching algorithm
    Reading: chapter 19
  • Oct 4: B-trees completed.
    Reading: chapter 18
    Assignment 5 (complete): exercises 16.3, 16.4, 18.1, 18.2 (Due Oct 9)
  • Oct 2: B-trees
    Reading: chapter 18
    Assignment 5: exercises 16.3, 16.4 (more to be added friday) (Due Oct 9)
  • Sept 30: Hashing
    Reading: chapter 16
  • Sept 27: red-black trees: splits and rotations
    Assignment 4: exercises 15.1, 15.2 15.4 (due Wed, Oct 2)
    [ for ex 15.2, verify your answer by running ~saunders/320/Dictmain.out.]
  • Sept 25: Searching strategies: red-black trees
    Reading: chapter 15 (pages 220-end)
  • Sept 23: Searching strategies: 2-3-4 Trees
    Reading: chapter 15 (pp 215-219)
  • Sept 20: Searching strategies: overview, naive methods.
    Reading: chapter 14.
  • Sept 18: Quicksort average case analysis, combined sorts, selection.
    Assignment 3: exercises 9.5, 9.10 (due Wed, Sept 25)
  • Sept 16: Quicksort, merge sort
    Reading: chapter 9, 12.
  • Sept 13: Lower bound of \Omega(n lg(n)) for comparison based sorting.
    Quick review of Insertion sort.
    Reading: chapter 8, pages 98-100.
    Assignment 2: exercises 11.1, 11.4, and 11.9 (as modified; see heapMain.cc in ~saunders/320/ ) (due Wed, Sept 18)
  • Sept 11: Priority Queues and Heapsort
    Reading: chapter 11.
  • Sept 9: Finished tree and forest representation, then started Priority Queues (discussed implementation ideas).
    Reading: chapter 11.
  • Sept 6: Tree terminology, representation, traversals.
    Reading: chapters 4, 6.
    Assignment 1: exercises 4.7, 4.8, 4.10 (due Wed, Sept 11)
  • Sept 4: Intro, syllabus handed out, Trees (chapter 4).
    Reading: Scan chapters 1-7.

    saunders@cis.udel.edu