1. (Aug 4) Course page is online.
  2. (Aug 31) Syllabus is available.
  3. (Sep 18) Midterm date is finalized.
  4. (Oct 2) Added linux command summary examples.
  5. (Oct 6) Homework assignment 1 is available.
  6. (Oct 9) Homework assignment 1 is updated.
  7. (Nov 1) Homework assignment 2 due date is postponed to November 17.
  8. (Nov 1) Slides for algorithm analysis are available.
  9. (Nov 3) Homework assignment 2 is available.
  10. (Nov 20) Homework assignment 3 is available.
  11. (Nov 23) Detailed midterm exam information is available.
  12. (Dec 4) Homework assignment 4 is available.
  13. (Dec 4) Late homeworks can now be submitted from the online submission form. See below.
  14. (Dec 18) Homework assignment 5 is available.
  15. (Dec 27) Detailed final exam information is available.

Section 1 (Home Page)

Instructor: Çiğdem Gündüz Demir (Office: EA 407A, Email: gunduz[at]
TA: Süleyman Tuncer Erdoğan (Office: EA 529, Email: serdogan[at]
Lectures:Mon 10:40-12:30 (BZ 05), Thu 8:40-10:30 (BZ 05)

Section 2 (Home Page)

Instructor: Çiğdem Gündüz Demir (Office: EA 407A, Email: gunduz[at]
TA: Umut Tosun (Office: EA 501, Email: umutt[at]
Lectures:Mon 15:40-17:30 (BZ 05), Thu 13:40-15:30 (BZ 05)

Section 3 (Home Page)

Instructor: Selim Aksoy (Office: EA 423, Email: )
TA: Hüseyin Gökhan Akçay (Office: EA 522, Email: akcay[at]
Lectures:Tue 15:40-17:30 (BZ 05), Fri 13:40-15:30 (BZ 05)

Section 4 (Home Page)

Instructor: Selim Aksoy (Office: EA 423, Email: )
TA: Emel Doğrusöz (Office: EA 522, Email: emelkaya[at]
Lectures:Tue 10:40-12:30 (BZ 05), Fri 8:40-10:30 (BZ 05)


  1. Harvey M. Deitel and Paul J. Deitel, C++ How to Program, 5th edition, Prentice Hall, 2005. (required)
  2. Frank M. Carrano, Data Abstraction and Problem Solving with C++: Walls and Mirrors, 4th edition, Addison-Wesley, 2005. (required)
  3. Mark A. Weiss, Data Structures & Algorithm Analysis in C++, 3nd edition, Addison Wesley, 2006. (recommended)

Lecture Schedule



Introduction, Classes and Objects, Control Statements


Arrays and Vectors


Classes: A Deeper Look

Operator Overloading


Algorithm Analysis

  • Handout at library electronic reserve (slides)

Abstract Data Types






  1. Questions, Due: October 20, 2006
  2. Questions, Due: November 17, 2006
  3. Questions, Due: December 4, 2006
  4. Questions, Due: December 18, 2006
  5. Questions, Due: January 4, 2007

Assignments will be posted on this page about two weeks before their due date. Assignments are expected to be turned in by 17:00 on the due date. For the late assignments, each student will be given a total of three grace days (whole or partial) for the whole semester. Once these late days have been exhausted, no late assignments will be accepted. As an example, if Student A submits her/his 2nd assignment 29 hours late, s/he will have used two late days and have only one day left. If Students A then submits her/his 4th assignment 5 hours late, s/he will have used her/his remaining late day. If Student A submits her/his 5th assignment 1 minute late, this assignment will not be accepted.

You should turn in your homework as a hardcopy (printer output) and also upload it using the online submission form (both before the deadline). Your submission must include both source code and sample output; otherwise, it will not be graded. Always make sure that the code you submit does compile and run correctly. Sample outputs should test a sufficient number of inputs so as to demonstrate that your program works correctly. Graded assignments are to be picked up from the TAs during their office hours.

Late submissions should be done through e-mailing them to your instructor or TA, they should also include both source code and sample outputs. Starting with homework 3, you can submit your late homeworks using the online submission form before your late days are exhausted. You should also turn in the hardcopy of your submission to your instructor or TA before the late days that you will be using being exhausted.

Please make sure you fully understand the Bilkent University Policy on Academic Honesty / Öğrenci Disiplin İlke ve Kuralları. Cheating and plagiarism on homework assignments will be punished according to the regulations of the University.

Grading Policy

Midterm exam:30%
Final exam:40%

Related Links