CISC 320 Algorithms and Advanced Programming

Latest Info page, Spring, 2001

Some Java links: Java 1.3 docs , Javadoc

This page contains a brief summary of each class topic and the associated reading and homework assignments. For general course syllabus see general information. This page morphs frequently, being updated at least weekly. You may need to reload it at each viewing to avoid being shown a stale version from your browser cache. Most recent items are at the top. Last updated May 23, 2001.

Some source code

Upcoming

  • Fri, May 25: Final Exam 1-3pm in course classroom.
    Final exam review sheet: pdf form (for acroread), or postscript form.

    Done

  • Tue, May 15: DNA computing.
    hw#4 is due. hw#4 solution sketches.

  • Thu, May 10: Cook's theorem.

  • Tue, May 8: NP completeness.

  • Thu, May 3: More hard problem, Problem classes P, NP.
    hw#3 is due. Hw#3 solution sketches.
    Handout: hw#4 assignment sheet.
    Reading: BVG chapter 13

  • Tue, May 1: Dynamic programming, and harder problem (cromatic number)
    Reading: BVG sections 10.2, 10.3

  • Thu, Apr 26: Matrix multiplication, Strassen's alg.
    Reading: BVG section 12.3.4

  • Tue, Apr 24: All pairs shortest paths, Floyd's & Warshall's algs.
    Reading: BVG sections 9.1-5.

  • Thu, Apr 19: Single source shortest paths in weighted digraphs.
    Reading: BVG section 8.3

  • Tue, Apr 17: Minimal Spanning Trees in weighted graphs (Kruskal's and Prim's algs)
    hw#2 is due at beginning of class.
    Reading: BVG sections 8.2, 8.4

  • Thu, Apr 12: strong components, generic MST.

  • Tue, Apr 10: Depth first search and strong components. hw#2 revised assignment sheet.

  • Thu, Apr 5: Graph basics, breadth first search.
    Reading: BVG sections 7.1, 7.2, 7.3.

  • Tue, Apr 3: Multiplication done best yet (FFT)
    Reading: BVG chapter 12, section 4

  • Thu, Mar 22: Multiplication basics (of integers, polynomials) and Multiplication done better (Karatsuba's algorithm)
    Reading: BVG chapter 12, sections 1-3
    Handouts: hw#1 solutions, and hw#2 assignment sheet, and DDJ Algorithms issue.

  • Tue, Mar 20: finish union-find,
    Reading: BVG chapter 6.6.

  • Thu, Mar 15: Go over exam, Dynamic equivalence relations
    Reading: BVG chapter 6.6.
    Exam model solutions.

  • Tue, Mar 13: Midterm Exam.

  • Thu, Mar 8: Hash tables and review.
    Reading: BVG chapter 6.5.
    Handout: midterm crib sheet

  • Tue, Mar 6: Finish Red-black trees
    Reading: BVG chapter 6.4.
    Handout: Homework set #1 .

  • Thu, Mar 1: Dynamic Sets (red-black trees and 2-3-4 trees).
    Reading: BVG chapter 6.1-4. See also section 2.5.

  • Tue, Feb 27: search engine basics (Substring pattern search)
    Reading: BVG chapter 11.

  • Thu, Feb 22: Introspective sort.
    C++ code (introspective sort is not in the book).
    Also: Job Fair

  • Tue, Feb 20: Heap sort. Sorting summary.
    Reading: BVG chapter 4, specifically section 4.8.

  • Thu, Feb 15: Insertion sort, Merge sort, comparison-based-sorting worst case lower bound.
    Reading: BVG chapter 4, specifically sections 4.2, 4.5, 4.7.2.
    C++ sorting code

  • Tue, Feb 13: Finish on select k-th smallest problem. Quicksort.
    Reading: begin BVG chapter 4.

  • Thu, Feb 8: Order Stats continued and Asymptotic Growth notations. OrderStatistics.java .
    Additional Reading: BVG section 1.5. Notes on first two lectures.

  • Tue, Feb 6: Order Statistics.
    Reading: BVG sections 1.4.6 1.4.7 1.4.8.
    Reading: BVG chapter 5 excluding section 5.5.
    Handout: syllabus.

    saunders@cis.udel.edu