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.
Section 1
Instructor: | Ercüment Çiçek (Office: EA 514, Email: cicek[at]cs.bilkent.edu.tr) |
---|---|
Lectures: | Tue 15:30-17:20 (EE 05), Fri 10:30-12:20 (EE 05) |
Section 2
Instructor: | Selim Aksoy (Office: EA 422, Email: ) |
---|---|
Lectures: | Wed 08:30-10:20 (B Z01), Fri 13:30-15:20 (B Z01) |
Section 3
Instructor: | Selim Aksoy (Office: EA 422, Email: ) |
---|---|
Lectures: | Mon 08:30-10:20 (EE 05), Wed 13:30-15:20 (EE 05) |
Teaching Assistants
- Mahmud Sami Aydın (EA 507; sami.aydin[at]bilkent.edu.tr)
- Aydamir Mirzayev (EA 505; aydamir.mirzayev[at]bilkent.edu.tr)
- Hakan Türkmenoğlu (EA 525; h.turkmenoglu[at]bilkent.edu.tr)
Office Hours
- Ercüment Çiçek: by appointment
- Selim Aksoy: by appointment
Attendance
- Section 1: https://forms.gle/3CLsvB31CuKxeNCg9
- Section 2: https://forms.gle/NY1m4tSZ73KaSN959
- Section 3: https://forms.gle/y64yjmWDhSJ5ZSAbA
Texts
- Frank M. Carrano and Timothy Henry, Data Abstraction and Problem Solving with C++: Walls and Mirrors, any edition, Pearson, 2013 or newer (textbook, ebook).
- Harvey M. Deitel and Paul J. Deitel, C++ How to Program, any edition, Prentice Hall, 2011 or newer (recommended).
Lectures
Topics |
Contents |
---|---|
Introduction[ Slides ] |
|
Functions[ Slides ] |
|
Pointers and Arrays[ Slides ] |
|
Case Study[ Slides ] |
|
Multidimensional Arrays[ Slides ] |
|
Recursion[ Slides ] |
|
Algorithm Analysis[ Slides ] |
|
Lists |
|
Stacks[ Slides ] |
|
Queues[ Slides ] |
|
Exams
- The midterm exam will be held at EB-101, EB-102, EB-103, EB-104,
EB-202, EB-203, and EB-204
during 17:30-20:00 on November 19, 2021.
It will be a closed-book and closed-notes exam.
The exam will cover until the end of multidimentional arrays.
Exam locations are as follows:
- EB-101: Section 1 (AKKUŞ-HIGAZY)
- EB-102: Section 1 (KABADAYI-UZUN)
- EB-103: Section 1 (ÜNAL-YÜCEL), Section 2 (AAMIR-DİLAVERLER)
- EB-104: Section 2 (DURAN-ŞENYÜZ)
- EB-202: Section 2 (TAMCI-YILMAZYILDIZ), Section 3 (AĞÇALI-BİLEN)
- EB-203: Section 3 (CEREN-KERVAN)
- EB-204: Section 3 (KHOSHBAKHT-YILDIZ)
- The final exam will be held at EB-101, EB-102, EB-103, EB-104,
EB-202, EB-203, and EB-204
during 09:00-11:00 on January 8, 2022.
It will be a closed-book and closed-notes exam.
The exam will cover the whole semester.
Exam locations are as follows:
- EB-101: Section 1 (AYDIN-GÜZELKAYA)
- EB-102: Section 1 (HIGAZY-YAKAR)
- EB-103: Section 1 (YAŞAR-YÜCEL), Section 2 (AAMIR-DERKÖKEN)
- EB-104: Section 2 (DİLAVERLER-ÖZKARAHAN)
- EB-202: Section 2 (POLAT-YILMAZ), Section 3 (AĞÇALI-ARICAN)
- EB-203: Section 3 (ASLAN-KERVAN)
- EB-204: Section 3 (KHOSHBAKHT-YALIN)
Homework
- Assignment 1: Due 23:59 on November 19, 2021
- Assignment 2: Due 23:59 on December 5, 2021
- Assignment 3: Due 23:59 on December 20, 2021
- Assignment 4: Due 23:59 on January 3, 2022
Homework assignments will be posted on this page. Assignments are expected to be turned in by 23:55 on the due date. You should upload your solutions to the homework assignments using Moodle before the deadline.
For the late submissions, each student will be given two grace days for each homework assignment (with no deduction of points). If no submission is received within two days after the homework deadline, no submission will be accepted for that homework.
Please make sure you fully understand the Bilkent University Policy on Academic Honesty (in Turkish) and the Rules and Regulations of the Higher Education Council (YOK) (in Turkish). Cheating and plagiarism on exams and homework assignments will be punished according to these regulations.
A very important guideline on academic integrity is the Honor Code for Introductory Programming Courses (CS 101/2 and 201/2) in our department. Please make sure that you are fully aware of these guidelines.
Grading Policy
Homework: | 20% |
Midterm exam: | 40% |
Final exam: | 40% |
In order to be able to take the final exam, a student must
- collect at least 30% of EACH of the first three homework grades, AND
- collect at least 30% of the midterm grade.
The instructors also reserve the right to set other thresholds for passing grades.
Due to the YOK (Higher Education Council) regulations, we are taking attendance and will report it to the Department at the end of the semester.
Advice
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.
Related Links
- Textbooks
- Data Abstraction and Problem Solving with C++: Walls and Mirrors (7th ed., Carrano and Henry) home page
- Data Abstraction and Problem Solving with C++: Walls and Mirrors (6th ed., Carrano and Henry) home page
- Mark Allen Weiss home page
- Deitel & Deitel home page
- Dive Into GNU C++ on Linux
- Dive Into GNU C++ with Cygwin on Windows
- Dive Into Microsoft Visual C++ .NET
- Dive into Microsoft Visual C++ 6
- Dive Into Borland C++ 5.5
- Compilers and Integrated Development Environments
- GCC: GNU Compiler Collection
- Minimalist GNU for Windows
- Microsoft Visual C++ (If you would like to obtain Visual C++ through the MSDN Academic Alliance program, you should follow the link at the Department home page.
- Eclipse Open Source IDE
- Dev C++ IDE
- Code::Blocks C++ IDE
- Documentation and Tutorials
- C/C++ Reference
- C++ Resources Network
- GNU Standard C++ Library
- Microsoft Visual C++ Language Reference
- Linux tutorial by the course TAs
- Linux command summary [ summary1 | summary2 ]
- C Programming in Linux by Ibrahim Korpeoglu
- Compiling C and C++ Programs
- GCC and Make: Compiling, Linking and Building C/C++ Applications
- Makefile Tutorial
- Operating Systems and Emulators
- Other Software