Course Description
CS 251
covers the specification, representation,
and manipulation of basic data structures:
linked lists, arrays, stacks, queues, trees, strings,
optimal search trees, priority queues, heaps, and
hash tables, symbol tables, Huffman codes. Fundamental concepts for the
analysis of algorithms are introduced.
Storage allocation, garbage collection, compaction, and
reference counts are covered as time allows.
Click here for
Syllabus with Grading Policy
Click here
here to get summary of
math formulas needed for the course.
Instructor:
Professor Wojciech Szpankowski,
Computer Science Building, Room #144
494-6703; spa@cs.purdue.edu
Office Hours: Wednesday, Friday 3:30 - 4:30
Teaching Assistants
-
Head TA
Bingwu Liu
Office: MT409
Office Hours:
-
Section 01, 10:30 Main TA
Lei Liu
G072 Computer Science Building
494-7810; lliu@cs.purdue.edu
Office Hours:
-
Section 02, 1:30 Main TA
Wei Zhou
G072 Computer Science Building
494-7810; zhouw@cs.purdue.edu
Office Hours:
-
Main Project TA
Ameya Limaye
OfficeL MT 403,
49 45005, limaye@cs.purdue.edu
Office Hours: