Class Information

Instructor: Petko Bogdanov

Time and Location: Mon and Wed 2:45PM-4:05PM
Office Hours: TUE/THU 1pm-3pm or by appointment, UAB 416
Prerequisites: CSI 210 (Discrete Math) and CSI 213 (Data Structures).

TAs:
Ashish Jadhav (ajadhav2@albany.edu), Office hours: Tue,Thu 10:30am-11.30am.
Zumrut Akcam (zakcam@albany.edu), Office hours: Tue 3-4pm and Wed 11am-12pm.
Syllabus for the class

Description

Description of common data structures such as lists, push-down stores, queues, trees, and graphs. Definition of algorithm efficiency and efficient algorithms for integer and polynomial arithmetic, sorting, set manipulation, shortest paths, pattern matching, and Fourier transforms.

Text

Thomas H. Cormen, Charles E. Leiserson, Ronald L. Rivest, Clifford Stein, Introduction to Algorithms: Ed. 3", MIT Press

Slides

01. Intro pdf

02. Analysis of Insertion Sort pdf

04. Asymptotic Notation pdf

05. Graphs And Trees pdf

06. Heaps 1 pdf

07. Heaps 2 pdf

08. Quicksort pdf

09. Decision Trees and Closest Pair pdf

Grading and Evaluation

Midterm: Oct. 17, 2016 (M) : In class 20%
Final: Dec. 19, 2016 : 30%
Programming assignments: (2) : 20%
Homeworks: (best 5 out of 6) : 30%