CISC 320 Algorithms and Advanced Programming

Spring, 1999

LATEST INFO frequently updated 320 Course Syllabus Saunders' Home McGeary's Home Computer Science Dept Home

Corrections, suggestions and comments to saunders@cis.udel.edu


Latest Info

This is a summary in reverse chronological order of lecture topics, assignments, etc. (last updated on 5/21/99).

  • Tuesday, May 25:
    Final Exam
    1:00-3:00pm in 101 Recitation Hall (our normal classroom).

  • Tuesday, May 25: 9:00-10:00am. Office hour for review, 456 Smith.

  • May 18: NP Completeness, review. Reading: Chapter 45.

  • May 13: Project 2 oral presentations with convex hull contest. Project 2 info.

  • May 11: Exaustive Search, Travelling sales vs MST. Reading: Chapter 44.
    Project2 phase two written due.

  • May 6: Weighted Graphs, minimal spanning trees. Reading: Chapter 31.
    Project2 phase one due.

  • May 4: Graph Connectivity. union-find. Reading: Chapter 30. HW#6 due.

  • Apr 29: Basic Graph Algorithms, depth first spanning trees. Reading: Chapter 29.

  • Apr 27: Cryptology (RSA public key encryption) Reading: Chapter 23.
    Homework #6 due Tues, May 4: RSA and Limpel-Zev

  • Apr 22: Basic Geometry for Graphics. (theta and ccw) Reading: Chapter 24.
    Convex Hull (package wrapping and Graham scan) Reading: Chapter 25.

  • Apr 20: File Compression (Limpel-Zev) Reading: lz.cc handout. Project 2 assigned.

  • Apr 15: File Compression (Huffman codes). Reading: Chapter 22. HW#5 Due.

  • Apr 13: Finish string searching. Quiz Chapters 18, 19.

  • Apr 8: String searching, Reading: Chapter 19.
    Homework #5 due Thurs, Apr 15: Chapter 19 Ex 5, 7, 8.

  • Apr 6: External searching, Reading: Chapter 18. HW#4 Due.

  • Mar 25: Sorting Project presentations and performance competition.
    Relevant files: 320dir/makefile, intSortMain.cc, floatSortMain.cc, stringSortMain.cc.

  • Mar 23: Continue on Hashing, Chapter 16
    Homework #4 due Tues, Apr 6: Chapter 16 Ex 3, 4, 8.

  • Mar 18: Hashing. Reading: Chapter 16. HW#3 Due.

  • Mar 16: Red-Black trees. See 320dir/dictionary/new/dictmain.cc and randmain.cc and rbt.h
    See also the demo at http://wyoming.hcca.ohio.gov/HTML/RedBlack/redblack.html, brought to my attention by Raj Thakkar.
    Quiz#3 on ch 14, 15.

  • Mar 11: 2-3-4 Trees.
    Homework #3 due Thurs, Mar 18: Chapter 14 Ex 4, Chapter 15 Ex 3 and 4.
    Project due date postponed to Mar 23.

  • Mar 9: Generic programming with templates.
    Reading: Chapter 16, 2-3-4 Trees.

  • Mar 4: finish interpolation search, binary search trees.
    Reading: Chapter 15. Project 1 assigned. HW#2 Due.

  • Mar 2: Searching in arrays: Sequential, Binary, Interpolation
    Reading: Chapter 14. Handout: Paper on introspective sort (used in STL) by David Musser. Quiz-2. On sorting.

  • Feb 25: Heap Sort, see heapSort.cc , sorting wrapup.
    Reading: Chapter 11. Homework #2 due Thurs, Mar 4: Chapter 11, Exercises 2, 4, and 8 .

  • Feb 23: Mergesort and external sorting.
    Guest lecturer: Foster McGeary (click to find sample mergesort codes)
    Reading: Chapters 12 & 13 .

  • Feb 18: Quicksort and not yet Heapsort.
    Reading: Chapter 9 & not yet 11. Quiz-1.

  • Feb 16: Elementary sorting algorithms, timings and analysis, use of templates
    HW#1 due. Reading Chapters 8 .

  • Feb 11: Tree traversal including level order traversal of forests represended as binary trees.

  • Feb 9: Intro, syllabus handed out, Trees (chapter 4).
    Reading: Scan chapters 1-7, read chapters 4 and 6 carefully. Homework #1 due Tue, Feb 16: Chapter 4, Exercises 4, 7, and 8 .