Department of Computer Science, Princeton University

COS 226: Data Structures and Algorithms, Spring 1996

R. Sedgewick


PROGRAMMING ASSIGNMENTS

  • 1: Shellsorting a linked list, due Feb. 15
  • 2: Sorting and merging networks, due Feb. 22
  • 3: Bin packing, due Feb. 29
  • 4: Word searching, due Mar. 7
  • 5: Repeat searching, due Mar. 28 (Sample input: small, medium, large; also in ~cs226/05data)
  • 6: Arithmetic coding, due Apr. 4
  • 7: Point location, due Apr. 11
  • 8: Maze traversal, due Apr. 18
  • 9: Stable matching, due Apr. 25
  • 10: Knapsack, due Dean's Date

    • PROBLEM SETS

  • 1: due Feb. 14
  • 2: due Feb. 21
  • 3: due Feb. 28
  • 4: due Mar. 6
  • 5: due Mar. 27
  • 6: due Apr. 3
  • 7: due Apr. 10
  • 8: due Apr. 17
  • 9: due Apr. 29
    • Copyright (c) 1996, R. Sedgewick