CS 201 Fundamental Structures of Computer Science I, Fall '04

You can see your exam papers on January 13th, Thursday, 2005. Absolutely no other times. We will not announce the final exam grades on Web pages.

Section 1 (15:40-17:30 T, 13:40-15:30 F at BZ02)
Section 2 (13:40-15:30 W, 15:40-17:30 F at BZ02
Dr. Tugrul Dayar
Department of Computer Engineering, EA521
Office Hours (OH): 8:40-12:30 W (or if this is not possible, by appointment from 1981)

Section 3 (15:40-17:30 M, 13:40-15:30 Th at BZ01)
Dr. Ugur Gudukbay
Department of Computer Engineering, EA524
OH: 8:40-10:30 F (or if this is not possible, by appointment from 1386)

Teaching Assistants
Section 1: Umut Tosun (, EA531, OH: 8:40-10:30 M),
Section 2: Gokce Nil Noyan (, EA 501, OH: 10:40-12:30 T),
Section 3: Tarkan Sevilmis (, EA526, OH: 14:40-15:30 M, 15:40-16:30 Th).

Course Description:
The course teaches C++ in a way that emphasizes algorithm design using a structured, modular,
and object-oriented approach. Then it introduces the abstract data types of lists, queues, and
stacks, and shows how one can implement them in C++ using fundamental data structures.
[1] Harvey M. Deitel and Paul J. Deitel, C++ How to Program, 4th edition, Prentice Hall, 2003.
[2] Frank M. Carrano, Data Abstraction and Problem Solving with C++: Walls and Mirrors,
4th edition, Addison-Wesley, 2005.
[3] Mark A. Weiss, Data Structures & Algorithm Analysis in C++, 2nd edition, Addison Wesley,
1999. (recommended)
Course Outline:
When you are in doubt, ask. Use office hours. If you cannot visit us 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.

Please see the Bilkent University policy for academic honesty.

Scores ( Section 1, Section 2, Section 3)