Department of Computer Science, Princeton University

COS 226: Data Structures and Algorithms, Spring 1998

R. Sedgewick


Hardcopy of the assignments will be handed out in class. Before that time, you should regard these online versions as preliminary drafts that are subject to change. During the week that you are working on the assignment, these versions may reflect changes due to bug fixes (as noted on the course home page).


PROBLEM SETS

  • 1: due in precept 2/9 or 2/10.
  • 2: due in precept 2/16 or 2/17.
  • 3: due in precept 2/23 or 2/24.
  • 4: due in precept 3/2 or 3/3.
  • 5: due in precept 3/9 or 3/10.
  • 6: due in precept 4/6 or 4/7.
  • 7: due in precept 4/13 or 4/14.
  • 8: due in precept 4/20 or 4/21.

    • PROGRAMMING ASSIGNMENTS

  • 1: Shellsorting a linked list, due 2/12
  • 2: Sorting and merging networks, due 2/19
  • 3: Bin packing, due 2/26
  • 4: Word searching, due Mar. 5
  • 5: Repeat searching, due Mar. 29 (Sample input: small, medium, large; also in ~cs226/05data)
  • 6: Language modeling, due Apr. 5
  • 7: Point location, due Apr. 9
  • 8: Shortest paths, due Apr. 23
  • 9: Subset sums, due May 10
    • Copyright (c) 1998, R. Sedgewick