CSC326 Syllabus

INFORMATION STRUCTURES

CSC326-Section 6596

Tuesday 9:05-11:00 3N216 Thursday 9:05-11:00 4N212

Tuesday, Thursday 11:15-12:05 1N104

IMPORTANT INFORMATION ABOUT THE FINAL HAS BEEN POSTED. FOLLOW THE LINK ON THE LEFT FOR EXAMS.

Instructor: Dr. Sarah Zelikovitz

Office: 1N 212

Phone: (718)982-2849

Office hours: Tuesday and Thursday 12:15-1:15 and by appointment

Class Handouts

Date	Link
August 31	Syllabus
August 31	Review
August 31	Classes
September 12	ADT
September 12	Exercises 1
September 28	Exercises 2 (sample exam questions) with answers
October 19	Exercises 3
October 28	Exercises 4
October 28	Simulation code
November 2	Exercises 5
November 7	Exercises 6
November 7	Unsorted List Code Sorted List Code

Date Due	Assignment
September 9	Review of structs and arrays
September 14	Example of classes
September 21	Using an ADT
October 12	Unsorted Lists
October 12 (IN CLASS LAB ASSIGNMENT)	Stack Operations
October 28	Stack Application
Nov 2/ Nov 9 (IN CLASS LAB)	Queue practice
Nov 16	Chapter 4: 21 a,c,d,e,f,g,h,i 24 b Chapter 5: 19-24 (each character takes 1 byte) 6 (do not implement; show written code)
Nov 23	First part of recursion assigment
December 9	Second part of recursion assignment Tree header file PLACED UP ON 11/30, with all Queue code put into comments! Using this header file, you can simply declare TreeType objects in your client code. You can use the same code for the assignment below, but you might have to change the define of ItemType.
December 15	Trees/Sorting caution: Start early, do not wait until finishing the recursion assignment above. You can use this file for the data (taken from CSI web site, with quotes removed, etc) and this file for special words.
December 21	Chapter 10: 1,7,8,19, 36

Examinations

Date	Material
September 21	Quiz, through loops (Malik 2-5)
September 28	Quiz, through arrays (Malik -10)
October 5	Exam 1 (Dale Chapters1-3)
November 18	Exam 2 (Dale Chapters 4-5) with answers
December 16	Optional review – sheet with answers (one change made in code of last pgm)
December 21	Final Exam (Dale: 4,5,7,8,10) 9:00 AM 3N216 Here is the approximate point breakdown of the final by chapter, to facilitate your studying: Chapter 4,5 (stacks, queues, lists, covered on exam #2): 22 points Chapter 7 (recursion): 6 points Chapter 8 (binary trees): 37 points Chapters 7-8 (recursion and trees, as in the second part of your recursion programming assignment): 15 points Chapter 10 (including case study of Quicksort from chapter 7, sorting): 20 points