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!

• Friday, May 24: Final exam 1:00-3:00pm
  

  Exam Location is Purnell 116

• Thursday, May 23: Optional review session 4:00-5:00pm
• May 15: Summary and review
  Closest pair, Ch 28
• May 13: Convex Hull, Ch 25
• May 10: NP completeness, what it means and how to do it, Ch 45
• May 8: Exaustive search example. Partition problem.
  Homework, Due May 15:
  44.1, 44.1a: If a single "step" takes 1 microsecond, how long is 2^n steps and how long is n^5 steps for n = 10, 20, 30, and 40?
  45.1, 45.4, 45.5, 45.6.
  Claim problems assigned: 44.2 (ref fig. 29.15 pg 434), 45.2
• May 6: Formal definition of computational problem, TSP and HCP, Ch 44
• May 3: review test. Finish minimal spanning trees
• Wednesday, May 1, Second Midterm Exam
  
• Apr 29: Review for midterm.
• Apr 26: Weighted graphs, min spanning trees and traveling salesmen. Chapter 31
• Apr 24: Union-Find, Chapter 30
  Claim problems assigned (graphs group): 29.1 29.5 29.8 30.1 30.2 30.3 30.4
• Apr 22: Union-Find, Chapter 30
• Apr 19: Depth first search and components
• Apr 17: Connectivity, biconnectivity, depth and breadth first search, Chapter 29, 30.
  handout: A Graph class containing a depth first search function .
• Apr 15: More depth first search, Chapter 30
• Apr 12: Graph algorithms, depth first search, Chapter 29
  Assignment Due Wed, Apr 17 on RSA and LZW.
  Claim problems (rsa group): 1 2
• Apr 10: Still more RSA, issues on making and breaking keys.
• Apr 8: More RSA including signatures.
• Apr 5: Encryption - RSA algorithm and PGP. Chapter 23.
• Apr 3: Limpel-Zev completed.
• Apr 1: Text Compression: Limpel-Ziv algorithm.
  Written Homework Due Fri, April 5: 19.2 19.3 19.6
  6th claim problem assigned: 19.7
• Mar 22: Text Compression: Once over lightly on Chapter 22, compression via Huffman Codes.
• Mar 20: Boyer-Moore algorithm, Rabin-Karp algorithm,
  See ~saunders/320/rksearch.cc for an implementation of Rabin-Karp. Chapter 19
• Mar 18: Knuth-Morris-Pratt algorithm,
  handout: C++ code for Boyer-Moore string search.
• Mar 15: Several claim problems
• Mar 13: Finite state machines, number of bits vs number of states. About numbers which are beyond astronomical.
• Mar 13: Text Search. Chapter 19.
• Monday, March 11, First Midterm Exam
  
  coverage: Chapters 4, 6, 8(pp 98-103), 9, 11, 14, 15, 16, 18.
• Mar 8: Review tree representations and traversals, sorting, and searching
  Start Text Search. Chapter 19.
• Mar 6: Finish B-Trees
  6th claim problem assigned: 18.2
• Mar 4: Finish hashing, External search, Chapter 18.
• Mar 1: Hash Tables, point about tries. Written Homework Due Fri, March 1: 16.3 16.4 5th claim problem assigned: 16.8
• Feb 28: R-B trees, Hash Tables, Chapter 16.
• Feb 26: Red-Black trees (implement dictionary), Chapter 15. Written Homework Due Fri, March 1: 15.5 15.7 4th claim problem assigned: 15.4
• Feb 23: Homework (due date postponed to Feb 26) discussion,
  2-3-4 Trees, Chapter 15.
• Feb 21: Searching, Chapter 14.
• Feb 19: Priority Queues and Heapsort. Chapter 11. Written Homework Due Fri, Feb 23: 9.5 9.10 11.2 11.4 Claim problems: 4.10 9.8 11.7
• Feb 16: quicksort tuning including use of insertion sort for small partitions.
  Selection and median computation in theta(N) time. Chapter 9.
  Problems 4.5, 4.6, 4.7, 4.8 due. (4.10 postponed)
  Relevant codes shown: basic quicksort, and tuned quicksort, and
• Feb 14: quicksort: average case analysis, timing comparasons of quicksort and insertionsort. Chapter 9.
  
  Assigned: (chapter 9) 9.5, 9.8, 9.10. Target date: Fri, Feb 23.
  
• Feb 12: Finish chapter 6 with discussion of 5 sample recurrences. 2 of these were discussed today in the context of quicksort.
  Sorting: insertion sort and quick sort.
  Reading: chapter 8 pages 98-103 on insertion sort, chapter 9.
• Feb 9: Representing forests as binary trees.
  Functions used for algorithm analysis.
  Asymptotic comparators: big O, theta, and "is about."
  Reading: chapter 6.
• Feb 7: Trees: binary, full binary, complete binary. Basic properties.
  Traversals: preorder, inorder, postorder, level order.
  Reading: chapter 4.
  
  Assigned: (chapter 4) exercises 4.5, 4.6, 4.7, 4.8, 4.10. Target date: Fri, Feb 16.
  
• Feb 5: Intro, syllabus handed out, Trees.
  Reading: Scan chapters 1-7.

saunders@cis.udel.edu