Outline of CS 3345, Algorithm Analysis & Data Structures
Algorithm Analysis & Data Structures
Fall 1998
Prof. William J. Pervin
TEXT:
Data Structures and Algorithms in Java,
by Goodrich & Tamassia
Wiley, 1998.
Note that
while the text uses Java, it is not a
prerequisite. The instructor will try to
make it possible for students who know
C++ to understand the algorithms and
their analyses.
TARGET AUDIENCES:
- This is a required course for degree-seeking
undergraduate students in Computer Science.
- An understanding of the material in this course
is recommended for all students who intend use computers.
- Others who can benefit from this course include employees
of local high-technology companies who need an introduction
to computer science.
This is, in fact, the first and most basic subject
in Computer Science!
PREREQUISITES:
CS 2315 & CS 3305 (C++)
or the equivalents.
OVERALL GOALS OF CS 3345:
We will try to provide a practical introduction
to data structures and algorithms, from the view
of abstract thinking and problem solving.
Many of the important details of analysis and
implementations will be introduced.
GRADING:
There will be two examinations and
a comprehensive final examination.
Homework will count in the final grade.
HOMEWORK:
The detailed assignments will be given in class;
click here for
general descriptions of the homework.
SYLLABUS:
For a detailed syllabus, click
here
TA:
Luming Huang at luming@utdallas.edu has office hours of MW
7:00-8:30pm in EC 3.526.
Back to Dr. Pervin's Home Page
