DATA STRUCTURES

CS 202 at Sabancι University, Istanbul, Turkey
Spring 2007

Instructor

Name:

Pierre Flener

Office:

Email:

Telephone:

very

Office Hours:

Lecture Hours:

Coordinating TA:

TA Office Hours:

Recitation Hours:

Data Structures and Algorithm Analysis in C++

after

Introduction, lectures of 22/2
Complexity 1 and Complexity 2, lectures of 24/2 and 7/3
Writing Efficient Code and Program Optimisation, lecture of 7/3
Lists 1 and Lists 2, lectures of 9/3 to 21/3
Stacks and Queues, lectures of 21/3 and 23/3
Trees 1, Trees 2, and Trees 3, lectures of 23/3 to 4/4
Hashtables 1 and Hashtables 2, lectures of 6/4 and 11/4
Heaps, lectures of 11/4 to 25/4
Disjoint Sets, lectures of 25/4 and 27/4
Sorting 1 (Shell-sort not seen), Sorting 2, and Sorting 3, lectures of 25/4 to 9/5
Graphs 1 and Graphs 2, lectures of 9/5 to 16/5
Algorithmic Paradigms, lectures of 18/5 and 30/5

not

Popular-science description of algorithms and data structures
My Algorithms and Data Structures course at Uppsala University
Slide 36 of Algorithm Analysis has a look-up table for determining the closed forms of some common recurrences.
The so-called Master Theorem yields another look-up table for determining the closed forms of some other common recurrences.

Last modified: Wed May 30 15:40:32 MET 2007