CS
201: Fundamental Structures of Computer Science I
Spring 2020
Instructors: |
Ercüment Çiçek (Section 1)
Aynur Dayanık (Section 2) |
TAs: |
Mete Han Kahraman, Alper Kagan Kayalı, Aydamir Mirzayev (see the syllabus for their office hours and contact information) |
Announcements:
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.
Moodle page of the course for homework submissions:
Homework submissions must be done on the Moodle page of the course CS 201.
Textbooks:
Introduction[ Slides ] |
Ch. 2, Ch. 3, Ch.4, Ch. 5 (Deitel) |
Functions[ Slides ] |
Ch.6 (Deitel) |
Pointers & Arrays[ Slides ] |
Ch.8 (Deitel) |
Case Study[ Slides ] |
Ch.9, Ch. 10 (Deitel) |
Multidimensional Arrays[ Slides ] |
Ch.8 (Deitel) |
Recursion[ Slides ] |
Ch.2 (Carrano) |
Algorithm Analysis[ Slides ] |
Handout will be available |
Linked Lists |
Ch.8, Ch.9 (Carrano) |
Stacks[ Slides ] |
Ch.6, Ch.7 (Carrano) |
Queues[ Slides ] |
Sec.13-1, Sec.13-2, Sec.13-4, Sec. 14-1 (Carrano) |
Exams:
Homework: