UNIVERSITY OF TEXAS AT DALLAS

COURSE SYLLABUS
Fall 2005

INSTRUCTOR: Greg Ozbirn (ozbirn@utdallas.edu)

OFFICE: ES 3.608, phone 972-883-4725, hours see website www.utdallas.edu/~ozbirn.

COURSE NUMBER: CS 5343

COURSE TITLE: Algorithm Analysis & Data Structures

CREDIT HOURS: 3

PREREQUISITE: Prerequisites: CS 5303 (Computer Science I), CS 5333 (Discrete Structures)

CATALOG DESCRIPTION:

Formal specifications and representation of lists, arrays, trees, graphs, multilinked structures, strings and recursive
pattern structures. Analysis of associated algorithms. Sorting and searching, file structures. Relational data
models.

TEXTBOOK:

Data Structures & Algorithm Analysis in C++, Second Edition, by Mark Allen Weiss, ISBN 0-201-36122-1.
Copyright 1999 by Addison Wesley Longman, Inc.

COURSE REQUIREMENTS:

Assignments must be turned in on time. Due dates will have one extra late day for half credit. This includes any
problems encountered uploading to WebCT, so you must upload early and double-check your submission to
avoid a late penalty. Once the late day passes, assignments will be recorded 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.

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 should be expected. At the end of the semester, it is possible that grades may be
curved, but a curve should not be expected.

Quizzes 40%
Final Exam 40%
Assignments 20%

ATTENDANCE POLICY:

Students are expected to attend all class lectures. If absent, the student is still responsible for any material
covered or anything said which the student missed, including changes to assignments or due dates. Missed
exams must be cleared in advance.

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.
 COURSE SCHEDULE (Fall 2005)
CS 5343 Algorithm Analysis & Data Structures / Greg Ozbirn
Monday/Wednesday/Friday
Section 501: 12:00PM-12:50 PM, Room ECSS 2.410

Class Date (42 classes) Material Covered

1 Aug 19 Introduction

2,3,4 Aug 22, 24, 26 Chapter 1

5,6,7 Aug 29, 31, Sep 2 Chapter 2
8, 9 Sep 5*, 7, 9 *Labor day (no class), Quiz 1
10,11,12 Sep 12, 14, 16 Chapter 3
13,14,15 Sep 19, 21, 23 Chapter 4
16,17,18 Sep 26, 28, 30 Quiz 2

19,20,21 Oct 3, 5, 7 Chapter 5

22,23,24 Oct 10, 12, 14 Chapter 6
25,26,27 Oct 17, 19, 21 Quiz 3
28,29,30 Oct 24, 26, 28 Chapter 7

31,32,33 Oct. 31, Nov 2, 4 Chapter 8

34,35,36 Nov 7, 9, 11 Quiz 4
37,38,39 Nov 14, 16, 18 Chapter 9
40,41 Nov 21, 23, *25 Chapter 10, *Holiday
42 Nov 28 Review

11:00am Wednesday, Final Exam (Comprehensive)

November 30
Syllabus Addendum
Each student in this course is expected to exercise independent
scholarly thought, expression and aptitude. This addendum to the
course syllabus is provided to assist you in developing and
maintaining academic integrity while seeking scholastic success.

General Comments:
l All academic exercises ( including assignments, essays, laboratory experiments and
reports, examinations, etc.) require individual, independent work. Any
exception(s) will be clearly identified.
l Be sure your name or identifying number is on your paper.
l Complete and turn in academic exercises on time and in the required format
(hardcopy, electronic, etc.).
l Retain confirmation of document delivery if submitted electronically.
l Retain all research notes and drafts until the project or assignment has
been graded.
l Obtain written authorization from your instructor prior to submitting a
portion of academic work previously submitted for any academic exercise.
(This includes an individual or group project submitted for another course or at another
school.)

Essays and Significant Papers:

Be prepared
• To present periodic drafts of work in process
• To correctly and completely reference all sources of information using the
citation format prescribed
• To turn your completed assignment in timely and in the prescribed manner
(electronic, hardcopy, etc.)

Examinations:
Be prepared
• To leave all personal belonging at the front of the room or other designated
location (this includes cell phones, turned off of course, and beverage
containers)
• To present your UTD Comet Card
• To remove your cap or hat
• To remove the batteries from any electronic device (e.g. calculator)
• To exchange blue books or bring them early as required
• To change seating
• To sign out when exiting the testing room
• To be escorted for lavatory use

All episodes of suspected scholastic dishonesty will be reported

according to University policy. Students who violate University
rules on scholastic dishonesty are subject to disciplinary
penalties, including the possibility of failure in the course and/or
dismissal from the University. Since such dishonesty harms the
individual, all students and the University, policies on scholastic
dishonesty will be strictly enforced. Penalties that may be
assessed for scholastic dishonesty may be reviewed in Subchapter D.
Penalties at http://www.utdallas.edu/student/slife/chapter49.html.