Course Description

CS 251 covers the specification, representation, and manipulation of basic data structures: linked lists, arrays, stacks, queues, trees, strings, binary search trees, priority queues, heaps, and hash tables, symbol tables, Huffman codes. Fundamental concepts for the analysis of algorithms are introduced.

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
Office Hours: Wednesday, Friday 3:00 - 4:00

Class Times

Division 1: MWF, 10:30-11:20, UNIV 303
Division 2: MWF 1:30-2:20, GO66

Teaching Assistants

Bingwu Liu ( Head TA - ALL ADMINISTRATIVE QUESTIONS SHOULD BE SENT TO HIM!)
Office: MT409
494-5010; liubw@cs.purdue.edu
Office Hours: Mon 3:30-5:20, and Thu 4:30-5:20
Lei Liu ( Section 01, 10:30 Main TA)
G072 Computer Science Building
494-7810; lliu@cs.purdue.edu
Office Hours: Mon 11:30-1:20, and Fri 11:30-12:20
Wei Zhou ( Section 02, 1:30 Main TA)
G072 Computer Science Building
494-7810; zhouw@cs.purdue.edu
Office Hours: Mon 9:30-11:20, and Wed 11:30-12:20
Ameya Limaye ( Project TA)
Office: MT 403
494-5005; limaye@cs.purdue.edu
Office Hours: Mon 1:30-3:20, and Tue 11:30-12:20

P/S/O Times

Division 1: Monday, 9:30-11:20, ENAD 135; TA: Wei Zhou
Division 2: Monday, 11:30-1:20, ENAD 135; TA: Lei Liu
Division 3: Monday, 1:30-3:20, ENAD 135; TA: Ameya Limaye
Division 4: Monday, 3:30-5:20, ENAD 135; TA: Bingwu Liu