CSE 5020 Data Structures and Algorithms
CSE 5020 Data Structures and Algorithms
Spring 99
Phil Chan
237 Crawford, 674-7280
pkc@cs.fit.edu
Office Hours: MW 1-2:30pm; T 4-5pm (or by appointment)
Course WWW Page: http://www.cs.fit.edu/~pkc/classes/ds.html
This course introduces data structures and algorithms, which are the
backbones of programs. You can think of programs = data structures +
algorithms. Data structures organize the information in such a way
that algorithms can efficiently manipulate the information. This
course is generally taught independent to any programming language;
C++ is only used to illustrate implementation examples when necessary.
With the instructor's consent, you may use a high-level programming
language of your choice for your programming assignments.
Books
- Headington, M. and Riley, D. (1994).
Data Abstraction and Structures Using C++.
Heath.
- A programming language book as reference.
Topics
- Control Abstraction (Ch1)
- Modules and Information Hiding (Ch2)
- Data Abstraction Through Classes (Ch3)
- Introduction to Data Structures (Ch4)
- Design and Implementation of Abstract Data Types (Ch9)
- Pointers and Dynamic Data (Ch7)
- Linked Lists (Ch8)
- Recursion (Ch6)
- Algorithm Efficiency, Searching, and Sorting (Ch12)
- Trees (Ch13 and supplement)
- Graphs (supplement)
Tentative Schedule
Jan 20 (Wed) |
HW1 due |
Feb 8 (Mon) |
HW2 due |
Feb 24 (Wed) |
Midterm exam |
Mar 1 (Mon) |
HW3 due |
Mar 5 (Fri) |
Last Day to Drop |
Mar 17 (Wed) |
HW4 due |
Apr 5 (Mon) |
HW5 due |
Apr 28 (Wed) |
HW6 due |
May 5 (Wed), 6-8pm |
Final exam |
Evaluation
- Midterm (20%) & Final (30%)
- Homework assignments (50%)
Policies
- Students are encouraged to help each other on assignments,
but plagiarism (copying) is prohibited.
- Late assignments are accepted, but 20% is deducted for each day.
- Documentation constitutes 10% of each programming assignment.
Prerequisites
- CSE 5015: Familiar with a high-level programming language
(such as Ada, C, C++, or Pascal).
- MTH 2051/5001: Discrete Math.