PIC 60. Data Structures and Algorithms (4 units). Lecture,
three hours; discussion, one hour, laboratory, five hours. Enforced requisite:
course 10B, Mathematics 31A, 31B, 61; course 10C is recommended. (Math 113 can
be accepted in place of Math 61.) Review of basic data structures: arrays, stacks,
queues, lists, trees. Advanced data structures: priority queues, heaps, balanced
trees. Sorting, searching techniques. Corresponding algorithms.