Computer Science City College of New York
  CSc21200 Section FG Data Structures, Fall 2014

Class Meets:

Office Hours:
Professor Zhigang  Zhu
Mr Wai L. Khoo <>
M,W        04:00-05:40PM
Wed:11:00 am - 12:00 pm;  2:00 pm - 3:00 pm

Course Update Information 

Course Objectives

This course teaches the basic techniques to orgranize data in running programs.  You will know about well-known data structures as listed in the Quick Syllabus. You will be able to
(1) implement these structures as classes in C++;
(2) determine which structures are appropriate in various situations;
(3) confidently learn new structures beyond what are presented in this class. 
You will also learn part of object-oriented programming and software development methodology.
Quick Syllabus
To become a Data Structures Expert 
start by learning...
  • Precondition/Postcondition specifications 
  • Time analysis techniques 
  • Container classes 
  • Pointers and dynamic arrays 
  • Linked lists 
  • Templates and iterators 
  • Stacks 
  • Queues 
  • Recursive thinking 
  • Trees 
  • Sorting and searching techniques
  •  Graphs
  • Textbook and References

    Textbook: Data Structures and Other Objects Using C++,  Third Edition, by Michael Main and Walter Savitch , Addison Wesley, softcover.

    Supplements:  The Code for the Book and the Corrections for the Text will be useful and can be found by clicking here.

    References: Lots of good sample codes are found in CSc102's C++ How to Program by Dietel & Dietel, 3rd Ed., Prentice Hall 2001. This course involves some of C++ language details that could be found in this book.


    CSc103 (Introduction to Computing to CS and CpE Majors) and CSc104 (Discrete Mathematical Structure I).  You should feel confident in your ability to design and implement simple programs using arrays and functions. As a rough guideline, all the materials before Chapter 5 (Pointers and Strings) of C++ How to Program by Dietel & Dietel are assumed to be understood. You should be familiar with some programming environment--either a PC or a Unix system.


    The following schedule is based on Fall 2014 academic calendar:

    Date Planned Lecture Topics Read/Assign/Exam
    Sep 01 (M)
    Sep 03 (W)
    Labor Day; college is closed - no class!
    Lecture 1. Introduction & Software Development  

    Ch. 1 ;  Assignment 1
    Sep 08 (M )
    Sep 10 (W) 
    Lecture 2. ADT & C++ Classes  (code)
    Lecture 3. More Classes and Operator Overloading 
    Ch 2.1-2.3
    Ch 2.4-2.5 
    Sep 15 (M)
    Sep 17 (W) 
    Lecture 4/5.  Container Classes (slides for Lectures 4&5) 
    Lecture 6. Pointers and Dynamic Arrays (I)   (Slides for Lectures 6 &7)
    Ch 3 (code), Assignment 2
    Ch 4.1 - 4.2
    Sep 22 (M)
    Sep 24 (W)
    Lecture 7. Pointers and Dynamic Arrays (II) (point code with pointers)
    NO CLASSES (College Open)  
    Ch. 4.2 - 4.5

    Sep 29 (M)
    Oct 01 (W)
    Lecture 8. Dynamic Classes and the Big Three (code)
    Exam Review 1      
    Assignment 3

    Oct 06 (M)
    Oct 08 (W) 
    First Exam (Chapters 1-4)
    Lecture 9.  Linked Lists ( code)  

    Ch. 5.1-5.2
    Oct 13 (M)
    Oct 15 (W) 
    Columbus Day: college is closed - no class! 
    Lecture 10. Building &Using the Linked List Toolkit  (code)  & Exam 1 Discussions 

    Ch. 5.3 - 5.5, Assignment 4
    Oct 20 (M)
    Oct 22 (W) 
    Lecture 11. Software Development using Templates and Iterators
    Lecture 11a. Software Development using Templates and Iterators (cont.)
    Ch. 6,  code (bag4&5, node2)

    Oct 27 (M)
    Oct 29 (W) 
    Lecture 12. Stacks (code) and Queues (code)  
    Lecture 13. Introduction to Recursion
    Ch. 7, Ch 8 
    Ch. 9.1 , Assignment 5
    Nov 03 (M)
    Nov 05 (W)
    Lecture 14. Using and Reasoning about Recursion 
    Exam Review 2
    Ch. 9.2 - 9.3

    Nov 10 (M)
    Nov 12 (W) 
    Second Exam (Chapters 5-9)
    Lecture 15. Trees and Traversals  (code

    Ch. 10.1-10.4
    Nov 17 (M)
    Nov 19 (W) 
    Lecture 16. Binary Search Trees and the Bag Class with a BST; Exam 2 Discussions
    Lecture 17. B-Trees and Set Class (code
    Ch. 10.5, Assignment 6
    Ch. 11.2
    Nov 24, 26
    Dec 01 (M)
    Lecture 18. Heaps and Priority Queues(slides) ; Time Analysis of Trees(slides)
    Lecture 19. Serial Searching and Binary Searching
    Ch. 11.1, 11.3
    Ch. 12.1-12.3
    Dec 03 (W)
    Dec 08 (M)
    Lecture 20. Hashing; Lecture 21. Quadratic Sorting
    Lecture 22. Recursive Sorting , Heapsort & the STL Quicksort (code)
    Ch. 12.4, Ch. 13.1
    Ch. 13.2-13.4
    Dec 10 (W)

    Lecture 23. Graph Basics;   Exam Review 3 
    Ch. 15
    Dec 15 (M) Third Exam (mainly Ch 10-13, 15),  NAC 4/121B

    Assignments and Grading

    See syllabus above for the tentative timetable for a schedule. There will be six to seven programming assignments distributed roughly every two weeks (counted roughly 30% of your final grade).  Several in-class small quizzes will add up to 10 % of your final grade. There will be three in-class exams (60% of your final grade). Dates of these exams will be determined in due times and announced beforehand.

    Policies:  Students may discuss ideas together. But since each student get credits for his or her submissions, all actual program code and written answers must be done individually by each student, and must not be shared.

    Communications: I would like the course to run smoothly and enjoyably. Feel free to let me know what you find good and interesting about the course. Let me know as soon as possible about the reverse. You may see me in my office during my hours or send me messages by e-mail.

    Computing Facilities

    The language used for this class is ANSI Standard C++ as supported by today's available compilers. Variety of PC based (both Windows and Linux) C++ compilers are available, also publicly accessible at our Student Computer Labs.

    Copyright @ Zhigang Zhu, City College of New York, Fall 2014