CISC 3130 - Data Structures
Spring 2011
Syllabus
General class policies
- A set of homework exercises will be assigned roughly every two weeks (so
there will be around 7 sets of homeworks in total). These will include both
programming problems and theoretical exercises. You must hand in
all homeworks on time, that is, before the beginning of class on the due
date. This is because the solutions will generally be posted at that time on
the web page, so it makes no sense for me to accept late homeworks. Exceptions
may be made under special circumstances (if you have any kind of problem with
making the deadline, talk to me).
- The two midterm exams will be non-cumulative, while the final will be
cumulative. The best way to prepare for all the exams is to work hard on the
homework questions and then also study the solutions which will be posted on
this web page.
- Students are expected to be aware of and adhere to college-wide policies
regarding cheating, plagiarism and academic integrity in general, as laid out
here. In
particular, cheating will not be tolerated in exams. Also, even though
discussing homework problems with your classmates is allowed (and in fact
encouraged) each student is responsible for his/her own solution.
List of topics to be covered:
- C++ review: pointers, dynamic memory allocation, classes, templates
- Basic data structures and their implementation
- Stacks
- Queues
- Dynamic arrays/vectors
- Linked Lists and variations
- Trees
- Graphs
- Basic sorting algorithms and their analysis
- Bubblesort
- Insertion sort
- Selection sort
- Mergesort
- Quicksort
- The C++ STL and how it implements the data structures are discussed in this class.