| Syllabus | Latest Info | Saunders' homepage | TA homepage | CISC homepage | UDel homepage |

CISC 320 Algorithms and Advanced Programming

Latest Info page, Fall, 2007

Some useful links: The Standard Template Library. The STL Documentation at SGI.

Some source code

The homework assignments are described here. For other course information see the syllabus.

This page contains a brief summary of each class topic and the associated reading. 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 Dec 4, 2007.

Future: CISC320010

Mon, Dec 10, 10:30AM-12:30PM Final Exam in room MKL061

Wed, Dec 5

Past:

Mon, Dec 3

Fri, Nov 30

  • A range of NP-Complete problems. (selections from 8.5, 8.7, 8.8)

Wed, Nov 28

  • Reading: KT section 8.3, 8.4
  • Definition of NP and NP-Complete. Cook's theorem.

Mon, Nov 26

Wed, Nov 21

  • Homework 5 is due today.
  • Reading: KT section 8.2, 8.3
  • Algorithms for Independent Set

Mon, Nov 19

  • Reading: KT section 8.1
  • polynomial time reductions.
  • Independent Set, Vertex Cover, Set Cover

Fri, Nov 16

  • Reading: KT section 6.6
  • Sequence similarity

Wed, Nov 14

  • Homework set #5 assigned: Due Wed, Nov 21.
  • Ordered digraph pathlength (ex 6.3)

Mon, Nov 12

  • Reading: KT section 6.5
  • RNA Secondary structure

Fri, Nov 9

  • catch up.

Wed, Nov 7

  • Reading: KT section 6.3
  • Segmented least squares

Mon, Nov 5

  • Reading: KT section 6.1, 6.2
  • Weighted interval scheduling

Fri, Nov 2

  • Homework 4 is due today.
  • Reading: KT section 5.1, 5.2
  • Solving divide and conquer recurrence relations

Wed, Oct 31

  • Reading: KT section 5.6
  • Fast Fourier Transform

Mon, Oct 29

  • Reading: KT section 5.6
  • Roots of unity and exponentiation

Fri, Oct 26 fall break

Wed, Oct 24

  • Homework set #4 assigned: Due Fri, Nov 2.
  • Polynomial multiplication
  • Divide and conquer recurrence relations

Mon, Oct 22

  • Reading: KT section 5.5
  • Integer multiplication

Fri, Oct 19 Midterm exam

Wed, Oct 17

  • Reading: KT section 4.3
  • optimal caching
  • sample old exam

Mon, Oct 15

  • Lower bound argument for sorting.
  • review

Fri, Oct 12

  • Homework 3 is due today.
  • Reading: KT section 4.1
  • interval scheduling

Wed, Oct 10

  • Reading: KT chapter 5 thru section 5.3
  • Closest pair of points
  • Final remark on union-find

Mon, Oct 8

  • Homework discussion

Fri, Oct 5

  • Homework set #3 assigned: Due Fri, Oct 12.
  • Reading: KT Section 4.7
  • path compression in Union-find
  • clustering

Wed, Oct 3

  • Kruskal's algorithm
  • Union-fnd with union by size

Mon, Oct 1

Fri, Sept 28

  • Prim's algorithm

Wed, Sept 26

  • Reading: KT Section 4.5 and 4.6
  • Minimum Spanning Trees

Mon, Sept 24

  • Reading: KT Section 4.4
  • Dijkstra's algorithm

Fri, Sept 21

  • Homework 2 is due today.
  • Reading: KT Sections 4.1, 4.2
  • Revisit Breadth first search and depth first search
  • Interval scheduling, time permitting

Wed, Sept 19

  • Reading: KT Chapter 2 exercises (including solved exercises)
  • Solve exercise 2.7
  • BFS, DFS examples

Mon, Sept 17

  • Reading: KT Chapter 3
  • Homework set #2: (a) KT exercise 2.2, (b) 2.6 or 2.8
  • Graph terminology
  • Breadth first search and depth first search

Fri, Sept 14

  • Reading: KT Chapter 3
  • Homework set #1 is due today
  • finish up on sorting
  • from gridNode to graphs

Wed, Sept 12

  • Sorting examples from strauss:~saunders/320/sort/
  • combine insertion sort, heap sort, quick sort into introspective sort

Mon, Sept 10

  • Reading: KT Chapter 2, concentrate on 2.5
  • Priority Queues - the heap implementation.
  • heapsort.

Fri, Sept 7 We used the period to analyze randomized select-k-th-largest, finding

  • about (1/2)n2 comparisons needed in the worst case,
  • n-1 in the best case,
  • about 4n in a "nice" scenario, and
  • an expectation bounded by 8n for the number of comparisons as a random variable.

Wed, Sept 5

  • Reading: KT Section 13.5
  • Order statistics (median, select k-th largest).
  • Discussion of merge sort.

Fri, Aug 31

  • Reading: KT Section 1.1
  • Scan: KT Section 1.2
  • Homework set 1: KT exercises 1.1, 1.2, 1.4.
  • Course organization, syllabus handout.
  • Gale-Shipley stable matching algorithm.

Wed, Aug 29, 8:00am. First Class.

  • Introduction to order statistics: Max, Max&Min.
  • Max: n-1 comparisons necessary and sufficient.
  • Max&min: 3n/2 - 2 comparisons necessary and sufficient.
  • Max&min lower bound argument

saunders@cis.udel.edu