TE3346 logo

COMPUTER ALGORITHMS
&
DATA STRUCTURES

SPRING 2003

SYLLABUS


Instructor

Dr. Pervin; e-mail: pervin@utdallas.edu; URL: http://www.utdallas.edu/~pervin

Office Hours: TR 10:45am-11:15am and by appointment; Office: EC 4.626

Catalog Description

Basic data structures such as arrays, stacks, queues, lists, trees. Algorithmic complexity. Sorting and search techniques. Fundamental graph algorithms. Prerequisites CS 2315 and EE 3307 or their equivalents

Text

Mark Allen Weiss, "Data Structures & Algorithm Analysis in C++", 2nd Ed., Addison-Wesley, 1999.
Weiss
It is expected that the text material will be studied outside of class before it is needed to follow the discussion in class. In addition, you will be expected to read, by yourself, some material from the text not covered in class. Examinations are based on material covered or described in class, even if not in the text.

Grading

There will be two examinations (worth 25% each) during the semester and a comprehensive final (worth 40%). Homework will count in the final grade (10%). All tests are graded subjectively, but fairly.

Tentative Schedule

Classes meet from 12:30pm to 1:45pm Tuesdays and Thursdays in EN 2.112