Computer Science City College of New York
  CSc21200 Section FG Data Structures, Fall 2010
Instructor: 
Assistant
Class Meets:
Classroom:
Office Hours:
Office:
Email:
 Professor Zhigang  Zhu
Mr. Wai L. Khoo
M,W        04:00-05:40PM
NAC-6/136
M,W        02:00-03:00 PM
NAC 8/210
zhu@cs.ccny.cuny.edu
  

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 , ISBN 0-201-70297-5, Addison Wesley, softcover. Textbook can be found in CCNY bookstore.

    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, QA76.73.C153D45, ISBN 0-13-089571-7. This course involves some of C++ language details that could be found in this book.

    Prerequisites

    CSc102 (Introduction to Computing) 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.

    Schedule

    The following schedule is based on Fall 2010 academic calendar:

    Date Planned Lecture Topics Read/Assign/Exam
    Aug 30 (M)
    Sep 01 (W)    		 Lecture 1. Introduction & Software Development
    Lecture 2. ADT & C++ Classes  (code) 
    		Ch. 1
    Ch 2.1-2.3;  Assignment 1
    Sep 06 (M)
    Sep 08 (W)     		 College is closed - no class!
    No class after 4:00 pm. 

     
    Sep 13 (M )
    Sep 15 (W)     		 Lecture 3. More Classes and Operator Overloading 
    Lecture 4.  Container Classes (slides for Lectures 4&5) 
    		Ch 2.4-2.5
    Ch 3 (code)
    Sep 20 (M)
    Sep 22 (W)     		 Lecture 5. Container Classes (cont.)
    Lecture 6. Pointers and Dynamic Arrays (I)   (slides for Lectures 6 &7)       		Ch 3, Assignment 2
    Ch 4.1 - 4.2
    Sep 27 (M)
    Sep 29 (W)     		 Lecture 7. Pointers and Dynamic Arrays (II) (point code with pointers)
    Lecture 8. Dynamic Classes and the Big Three (code)
    		Ch. 4.2 - 4.5
    Assignment 3
    Oct 04 (M)
    Oct 06 (W)     		 Exam Review 1
    First Exam (Chapters 1-4)


    Oct 11 (M)
    Oct 13 (W)     		 College is closed - no class!
    Lecture 9.  Linked Lists ( code)  & Exam 1 Discussions 

    Ch. 5.1-5.2, Assignment 4
    Oct 18 (M)
    Oct 20 (W)     		 Lecture 10. Building &Using the Linked List Toolkit  (code)
    Lecture 11. Software Development using Templates and Iterators
    		 Ch. 5.3 - 5.5
    Ch. 6,  code (bag4&5, node2)  
    Oct 25 (M)
    Oct 27 (W)     		 Lecture 11a. Software Development using Templates and Iterators (cont.)
    Lecture 12. Stacks (code) and Queues (code)  

    Ch. 7, Ch 8 
    Nov 01 (M)
    Nov 03 (W)     		 Lecture 13. Introduction to Recursion
    No class meet; Please check out Review Slides and prepare for Exam 2
    		 Ch. 9.1 , Assignment 5

    Nov 08 (M)
    Nov 10 (W)     		 Lecture 14. Using and Reasoning about Recursion; Exam Review 2
    Second Exam (Chapters 5-9)
    		 Ch. 9.2 - 9.3
    Nov 15 (M)
    Nov 17 (W)     		 Lecture 15. Trees and Traversals  (code) and Exam 2 Discussions
    Lecture 16. Binary Search Trees and the Bag Class with a BST
    		 Ch. 10.1-10.4
    Ch. 10.5, Assignment 6
    Nov 22 (M)
    Nov 24 (W )     		 Lecture 17. B-Trees and Set Class (code) 
    Lecture 18. Heaps and Priority Queues(slides) ; Time Anaysis of Trees(slides)
    		Ch. 11.2
    Ch. 11.1, 11.3
    Nov 29 (M)
    Dec 01 (W)    		 Lecture 19. Searching  & Lecture 20. Hashing
    Lecture 21. Quadradic Sorting      		Ch. 12.1-12.4
    Ch. 13.1
    Dec 06 (M)
    Dec 08 (W) 
    		 Lecture 22. Recusive Sorting , Heapsort & the STL Quicksort (code)
    Lecture 23. Graphs; Exam 3 Review      		Ch. 13.2-13.4
    Dec 13 (M)
    		 Final Exam (mainly Ch 10-13),  NAC 6136



    		 

    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 separately 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 2010