CS202 - Fundamental Structures of Computer Science II

Summer 2013

Syllabus is available here

Check this page regularly for updates.
Assignment 1 - Sorting (pdf) Due: June 27, 2013 Input Generator: generate.cpp, dict.txt
Sample Input: sample_input.txt
Assignment 2 - BST & 2-3 Trees (pdf) Due: July 17, 2013
Assignment 3 - Graphs (pdf) Due: July 26, 2013

Past Quizzes (Spring 2013)

Quiz 1 - Algorithm Analysis (Section 1, Section 2)
Quiz 2 - Sorting (Section 1 & 2)
Quiz 3 - Binary Search Trees (Section 1, Section 2)
Algorithm Analysis (slides) Algorithm Efficiency
Algorithm Analysis
Substitution, Recursive Trees
Sorting (slides) Sorting
Trees (slides) Trees
Binary Trees
Binary Search Trees
Priority Queues and Heaps (slides) Tables
Priority Queues
Heaps
Heapsort
Balanced Search Trees (AVL Trees) (2-3 Trees & Red Black Trees) (Examples) AVL Trees
2-3 Trees
2-3-4 Trees
Red-black Trees
Graphs (slides) Graphs
Hashing (slides) Hashing
Data Abstraction and Problem Solving with C++. Walls and Mirrors, F. M. Carrano, 6th edition, Addison-Wesley, 2012.
B-Trees Reading Material (pdf)
INSTRUCTOR: Dr. Ali Aydın Selçuk
Office: EA 428
Phone: 290-1352
Office Hour: Tuesday 10:40-11:30 or by appointment
E-mail: selcuk@cs.bilkent.edu.tr
TA: Shatlyk Ashyralyyev
Office: EA 505
Office Hour: Monday 11:40-12:30 or by appointment
E-mail: shatlyk@cs.bilkent.edu.tr