Announcements

  1. (Sep 23) Course page is online.
  2. (Sep 23) Syllabus is available.
  3. (Oct 15) Homework assignment 1 is available.
  4. (Nov 2) Homework assignment 2 is available.
  5. (Dec 3) Homework assignment 3 is available.
  6. (Dec 16) Homework assignment 4 is available.
  7. (Jan 1) Homework assignment 5 is available.
  8. (Jan 17) Final exam locations can be found in the seating plan.

Course Description

This course introduces the abstract data types of lists, stacks and queues, and shows how one can implement them in C++ using fundamental data structures. It also introduces recursion and algorithm analysis.

The syllabus contains more information about the course.

Section 1

Instructor: Selim Aksoy (Office: EA 422, Email: )
Lectures: Tue 13:40-15:30 (B204), Thu 15:40-17:30 (B204)

Section 2

Instructor: Selim Aksoy (Office: EA 422, Email: )
Lectures: Wed 13:40-15:30 (B204), Fri 15:40-17:30 (B204)

Section 3

Instructor: Aynur Dayanık (Office: EA 426, Email: adayanik[at]cs.bilkent.edu.tr)
Lectures: Tue 15:40-17:30 (EB102), Fri 13:40-15:30 (EB102)

Section 4

Instructor: Aynur Dayanık (Office: EA 426, Email: adayanik[at]cs.bilkent.edu.tr)
Lectures: Tue 10:40-12:30 (EB204), Fri 8:40-10:30 (EB204)

Teaching Assistants

Office Hours

Texts

  1. Frank M. Carrano, Data Abstraction and Problem Solving with C++: Walls and Mirrors, 5th edition, Addison-Wesley, 2006. (required)
  2. Harvey M. Deitel and Paul J. Deitel, C++ How to Program, 8th edition, Prentice Hall, 2011. (recommended)

Lectures

Topics

Contents

Introduction

[ Slides ]
  • Introduction to Classes and Objects (Ch.3 of Deitel book)
  • Control Statements: Part I (Ch.4 of Deitel book)
  • Control Statements: Part II (Ch.5 of Deitel book)
  • Code examples
  • Recitation: Part 1, Part 2, Part 3

Functions

[ Slides ]
  • Functions (Ch.6 of Deitel book)

Arrays

[ Slides ]

Pointers

[ Slides ]

Case Study

[ Slides ]
  • Classes: A Deeper Look, Part I (Ch.9 of Deitel book)
  • Classes: A Deeper Look, Part II (Ch.10 of Deitel book)

Recursion

[ Slides ]
  • Recursion: The Mirrors (Ch.2 of Carrano book)

Algorithm Analysis

[ Slides ]
  • Handout at library electronic reserve

Lists

[ Slides: Part 1 | Part 2 ]
  • Data Abstraction: The Walls (Ch.3 of Carrano book)
  • Linked Lists (Ch.4 of Carrano book)
  • Recitation

Stacks

[ Slides ]

Queues

[ Slides ]
  • Queues (Ch.7 of Carrano book)

Exams

Homework

  1. Questions, Due: October 31, 2011
  2. Questions, Due: November 21, 2011
  3. Questions, Due: December 14, 2011 (implementations of the three algorithms)
  4. Questions, Due: December 30, 2011
  5. Questions, Due: January 13, 2012

Homework assignments will be posted on this page about two weeks before their due date. Assignments are expected to be turned in by 18: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 1st 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 2nd assignment 5 hours late, s/he will have used her/his remaining late day. If Student A submits her/his 3rd assignment 1 minute late, this assignment will not be accepted. Note that no late submission will be allowed for the last homework.

You should upload your homework using the online submission form before the deadline. Your submission must include your source code; no hardcopy (printer output) will be required if it is not announced otherwise. Always make sure that the code you submit does compile and run correctly. Graded assignments are to be picked up from the TAs during their office hours. Late submissions should also be done through the online submission form.

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.

Academic integrity is a problem on programming assignments. Please refer to the "Honor Code Statement" to understand which actions violate the academic integrity. Each student is expected to read and understand this "Honor Code Statement". Students caught cheating on assignments will also be subject to disciplinary action.

Grading Policy

Quiz:15%
Homework:20%
Midterm exam:30%
Final exam:35%

Related Links