Department of Computer Science

Kent State University

CS 46101/56101 - Spring 2002

Design and Analysis of Algorithms

• All homework assignments are due by 5:00 p.m. on the assigned due date.

• Assignments may be left in my mail box in the computer science department main office or may be submitted via emailed.

• Late assignments will be penalized by a 20% reduction in grade per day.

• Emailed assignments must be PDF documents.

• Assignment #1 - Due January 28th.

  p. 13 1-1 Comparison of running times
  p. 27 2.2-2 Analysis of selection sort
  p. 37 2.3-5 Write a program - psudeocode is acceptable,
  p. 58 3-3 Order by asymptotic growth rates
  p. 85 4-1 (a, c, e, and g) Recurrences
  
  

• Assignment #2 - Due February 11th.

  p. 132 6.2-3, 6.2-4 Heapsort
  p. 135 6.3-3
  p. 136 6.4-3, 6.4-4
  p. 148 7.1-3 Quicksort
  p. 159 problem 7-1
  p. 168 8.1-3 Linear Time Sorting
  p. 170 8.2-2, 8.2-3
  p. 173 8.3-3
  

• Assignment #3 - Due February 18th.

  p. 208 10.2-1 Set operation bounds
  p. 213 10.3-2 Single-array representation
  p. 216 10.4-2 Binary Tree
  p. 217 10-1 Comparisions among lists
  p. 236 11.3-4 Hash tables
  p. 244 11.4-1 Open addressing
  p. 244 11.4-4 Analysis
  

• Assignment #4 - Due March 4th.

  p. 256 12.1-2,12.1-5 Binary Search Trees
  p. 260 12.2-4, 12.2-8
  p. 264 12.3-5
  p. 268 problem 12-1
  p. 277 13.1-6 Red-Black Trees
  p. 287 13.3-2
  p. 294 13.4-7
  

• Assignment #5 - Due March 11th.

  p. 440 18.1-2 B-Trees
  p. 441 18.1-4
  p. 447 18.2-3
  p. 307 14.1-4, Augmenting Data Structures
  p. 310 14.2-2
  p. 317 14.3-6
  

• Assignment #6 - Due March 18th.

  p. 338 15.2-2, 15.2-5 Dynamic Programming
  p. 356 15.4-2
  p. 378 16.1-1 Greedy Algorithms
  p. 379 16.1-3, 16.1-4
  

• Assignment #7 - Due April 8th.

  p. 538 22.2-2 Breadth-first search
  p. 539 22.2-3
  p. 547 22.3-2 Depth-first search
  P. 549 22.3-10
  p. 566 23-1.1, 23-1.4 Minimum Spanning Trees
  

• Assignment #8 - Due April 15th.

  p. 573 23.2-1, 23.2-2 Minimum Spanning Trees
  p. 591 24.1-1 Bellman-Ford algorithm
  p. 594 24.2-4 DAG
  

• Assignment #9 - Due April 29th.

  p. 600 24.3-2 Dijkstra's algorithm
  p. 910 32.1-1, 32.1-2 Naive string-matching
  Distributed by email -- Boyer-Moore algorithm
  Distributed by email -- KMP algorithm
  

• Assignment #10 - Due April 29th.

  Cancelled