UNIVERSITY OF TEXAS AT DALLAS

COURSE SYLLABUS
Spring 2005
(many thanks to Mr. Ozbirn who provided this material for adaptation).

INSTRUCTOR: Mr. Russo (David.Russo@utdallas.edu)

Better: dtrusso@airmail.net

OFFICE: ES 3.604, phone 972-883-2296, hours see website

www.utdallas.edu/~dtr021000.

COURSE NUMBER: CS 3345 (Same as SE 3345)

COURSE TITLE: Data Structures

CREDIT HOURS: 3

PREREQUISITE: Prerequisites: CS 2315 (Computer Science II) and one of CS

3305 (Discrete Mathematics for Computing II) or SE 2370
(Mathematical Foundations of Software Engineering).

CATALOG DESCRIPTION:

Metrics for performance evaluation of algorithms. Formal treatment of basic data

structures such as arrays, stacks, queues, lists, trees. Various sorting and searching
techniques. Fundamental graph algorithms.

TEXTBOOK:

Data Structures & Algorithm Analysis in Java, by Mark Allen Weiss, ISBN 0-201-
35754-2. Copyright 1999 by Addison Wesley Longman, Inc.

COURSE REQUIREMENTS:

Assignments must be turned in on time. Late homework is only accepted upon

death in family (certificate required), serious illness (physician note required).
Homework is deemed late if not available in the correct submission format at the
time of collection by the instructor. Late homework is graded as a zero.

Exams must be taken on time. Exceptions require advance approval by the

instructor. It is up to the instructor to determine whether an exception will be
made, and will depend largely on proof of extraordinary circumstances. Otherwise,
missed exams will be recorded as a zero.
METHOD OF PRESENTATION:

Class lectures will cover the material for each week as listed in the schedule.
PowerPoint slides will be used in the lecture and will be available on the
instructor’s website for download and printing if desired. Selected sample
programs and assignments may also be discussed in class.

The instructor will be gladly spend time with students assisting in debugging
problems. It is recommended that the student arrange an appropriate time (usually
requires a minimum of 15 minutes) and bring the source to the meeting.

METHOD OF EVALUATION:

The grade will be determined as described below. No bonus work, make-up work,
dropped scores, or other means of raising your grade will be provided. This class
does not use a ‘curve’ or other statistical smoothing techniques.

Four exams (one at or near the end of each month of the semester)
60% of grade.
Homework (14 programming assignments) 25% of grade
Class attendance and participation 15% of grade.

ATTENDANCE POLICY:

Students are expected to attend all class lectures. If absent the student should
inform the instructor beforehand. Absences do not remove the responsibility of
the student to accomplish all work assigned during the absence.

Students are strongly encouraged to participate in classroom discussions. We do

learn from each other. Your insights, comments and observations are valuable.
Please share them.

ACADEMIC ETHICS:

You are expected to do your own assignments and take tests without outside
assistance. All work must be your own. If help is required, it should be obtained
from the instructor or teaching assistant. Programs will be checked with software
to detect copied work. If cheating is detected, all parties involved may be denied
points for that project or exam, which may result in a zero being assigned to all
parties. The work will be sent to the Dean of Students and the Head of the
Department may also be informed.
ABET Learning Objectives

Ability to use asymptotic notations

Ability to perform simple algorithm analysis
A knowledge of basic proof techniques
Understand and use the following data structures:
link lists
stacks
queues
trees
hash tables
priority queues (binary heaps)
disjoint sets
Understand and use the following algorithms:
basic sorting algorithms
basic graph algorithms