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
Teaching Assistants

Head Teaching-Assistant : Vinay Paradkar (paradkar@cs)
Office Hours : W 11:30 - 12:30, or by appt, MATH 405


Teaching Assistant #2 : Gleb Bahmutov (bahmutov@cs)
Office Hours : M 10:30 - 11:30, or by appt, MATH-409

Teaching Assistant #3 : Om Prakash Pitta (pitta@cs)
Office Hours : T 4:30 - 5:30, or by appt, MATH-403

Teaching Assistant #4 : Weichao Wang (wangwc@cs)
Office Hours : R 9:00 - 10:00, or by appt, MATH-410

Teaching Assistant #5 : Robert Gwadera (gwadera@cs)
Office Hours : F 11:20-12:20, or by appt, CS254


PSOs:

PSO 1 : M, 09:30-11:20, SC 189 [Paradkar, Bahmutov]
PSO 2 : M, 11:30-01:20, SC 189 [Pitta]
PSO 3 : M, 01:30-03:20, SC 189 [Bahmutov]
PSO 4 : R, 03:30-05:20, SC 189 [Paradkar]
PSO 5 : F, 09:30-11:20, SC 189 [Gwadera]
PSO 6 : F, 11:30-01:20, SC 189 [Wang]
PSO 7 : F, 01:30-03:20, SC 189 [Pitta]


Class Times