|
Syllabus
|
Click here for the course syllabus
|
|
Office Hours:
Professor
After class
TA
Wed 12-1:30pm
at 404 Wolf Hall
(by appointment)
|
TextBook
|
Click
here
to check out the textbook at
|
|
About the Professor
|
|
Announcements
|
| |
Important Note: Some content of this site is incomplete since I had to drop teaching this course after the 7th lecture on Feb. 27th, 2001 due to immigrational reasons based on the limited work authorization provided with my current visa. This site's content is maintained up-to-date until Feb 27th, 2001 and left alone as it was thereafter. The course is taken over by Vess Bakalov. Please contact him for issues regarding the course.- Gokhan Boybek - 03/01/01
|
| |
| see all announcements |
|
|
CISC 220 : Data Structures
Catalog Description:
Review of data type abstraction, recursion, arrays, stacks, queues, multiple stacks, and linked lists. Emphasis on trees, graphs, tables, sorting and searching.
Goals:
Thorough understanding of the basic data representation techniques and standard algorithms for manipulating those representations. Understanding of the functionality and efficiency considerations that dictate the selection of representation in a specific application. Proficiency in writing C++ programs which implement and use stacks, queues, lists, hash tables, trees, and graphs (using both static and dynamic storage allocation). Familiarity with a variety of searching and sorting techniques.
|
|
|
Content:
Using problem sets and individual programming assignments in C++, covers the following key topics:
asymptotic analysis (average, worst case)
storage management-- free lists
binary trees-- contiguous, linked, child-sibling
binary search trees, tree traversal, AVL trees
depth and breadth first search
chained, perfect hashing
priority queues-- heapsort
sorting -- insertion, quicksort, merge, radix, shellsort
graph representation, elementary graph
Helpful Background:
Prerequisites: CISC 181 (Intro. to Computer Science) or CISC 120 (Object Oriented Prog. in C++)
Corequisites: MATH 210 (Discrete Math.) or MATH 242 (Analytic Geometry and Calculus B)
|
|
|
|
Course Outline
|
Click here for the course outline
|
|
e-mail class
! Must read about Class Mailing Lists.
|
Evaluation
|
Please take your time to
evaluate
the professor and the course.
It's anonymous !
|
|
Class:
TR 7:00pm-8:15pm
at SMI 209
|
Comics
|
|
Lectures would be boring without some fun 
Comics will be made available after they are handed out in class.
|
|
|