CS 202 Fundamental Structures of Computer Science II, Spring '18
Dr. Tugrul Dayar
Department of Computer Engineering (EA521) e-mail: email@example.com
Section 3 (8:40-10:30 M, 10:40-12:30 W at EE517)
OH: 13:40-15:30 Th (or if this is not possible, by appointment from x1981)
(Hasan Balci, EA525, firstname.lastname@example.org, OH: 13:40-15:30 Th, or if this is not possible, by appointment from x3474,
Ilkin Safarli, EA525, email@example.com, OH: 13:40-15:30 W, or if this is not possible, by appointment from x3474,
Leonard Dervishi, EA525, firstname.lastname@example.org, OH: 13:40-15:30 T, or if this is not possible, by appointment from x3474)
The course picks up from where the first semester course left by discussing
concepts related to algorithmic efficiency on basic abstract data types and some sorting
algorithms that utilize recursion. Then the course introduces the abstract data types of trees,
tables, priority queues, and graphs, and shows how one can implement them in C++ using
fundamental data structures by emphasizing run-time complexity analysis.
 Frank M. Carrano and Timothy M. Henry, Data Abstraction and Problem Solving with C++:
Walls and Mirrors, 6th edition, Pearson, 2013. (Textbook)
 Frank M. Carrano, Data Abstraction and Problem Solving with C++: Walls and Mirrors,
edition, Addison-Wesley, 2006. (You can also use the 4th edition.)
 Mark A. Weiss, Data Structures & Algorithm Analysis in C++, 3rd edition, Addison Wesley,
 Harvey M. Deitel and Paul J. Deitel, C++ How to Program, 8th edition, Prentice Hall, 2011.
When you are in doubt, ask. Use office hours. If you cannot visit me during office hours, you can
always ask questions or arrange meetings by e-mail. Study regularly for the course and attend
classes. Do your assignments on time and pay attention to the instructions for submitting
assignments. Always make sure that the code you submitted does compile and run correctly.
2 (25%) April 12 (Thursday), 17:40-19:40, EE03,04,05,214
(a closed book/notes exam, covers chapters 16-19 from )
(25%) 27 May (Sunday), 9:00-11:30, BZ01,02,04,05,08
(a comprehensive closed book/notes exam, covers chapters 10-11, 15-20 from )
In order to be able to
take the final exam,
one must obtain a weighted sum of at least 40% from the quiz, midterm, first 3 homework grades,
and at least 30% from the first 3 homework grades;
else one will receive FZ.
Please see the Bilkent University policy on Academic honesty.
CS202 other sections.