University of Texas

Department of Computer Science

CS3345 Data Structures and Algorithm Analysis

Spring 2005
Time and Location MW4:00 p.m.5:15 p.m. ECSS2.311
Office hours MW 2:30pm – 4:00pm
Professor Dr. Yuke Wang
Office ECSS 3.224
Email: yuke@utdallas.edu
Phone: 972-883-4139
Course website http://www.utdallas.edu/~yuke/cs3345.htm

Textbook Algorithm Design, by Michael T. Goodrich and Roberto Tamassia,

John Wiley and Sons, 2002. ISBN 0-471-38365-1

Course Description - Analysis of algorithms including time complexity and Big-O

notation. Analysis of stacks, queues, and trees, including B-trees. Heaps, hashing, and
advanced sorting techniques. Disjoint sets and graphs. Course emphasizes design and
implementation.
Prerequisites CS 2336 COMPUTER SCIENCE II: JAVA
CS 3305 Discrete Maths for computing II or
SE 2370. Mathematical foundation-software engineering

Grading Policies
Midterm 30%
Assignments 30%
Project 10%
Final exam 30%

Class Policies
• The student is responsible for the math and Java programming knowledge
required in the course.
• No Makeup exam. If you miss midterm exam, your final will be counted as 60%
instead of 30%. If you miss the final exam, you fail the course. Incomplete grades
will not be issued.
• All homework and project report should be submitted online on webct. Late
homework or project reports will not be accepted. Each assignment/project is
counted as 5 marks. If you are late or miss one project/assignment, you miss 5
marks.
• A student must receive at least 5 marks in the programming projects (total 10
marks) to pass the course.
 • Instructor/TA would not tell students how to do the assignment/project questions
before the due date. Instructor/TA would not be able to help students to debug
their program either.
• Regular class attendance and participation are expected. Students are responsible
for lectures and announcements if she/he misses the class.
• Lecture slides will be posted online. However, the slides are not as detailed as the
textbook. The students are expected to read the related materials in the textbook
as well.
• You are expected to do your own assignments and take tests without outside
assistance. All work must be your own. If cheating is detected by the TA or the
instructor, all parties involved will be denied any points, and the work may be
sent to university authorities for review, the student may fail the course as well.

Course Topics Sequence and Events

January 10, 2005 – April 25, 2005

Week Date Topics Text Assignments

book
Week1 1/10, 1/12 Class syllabus, policies, Ch 1 Assignment 1
Introduction
1/17 University closing
Week2-4 1/19, 1/24, 1/26, 1/31 Basic data structures Ch 2 Assignment 2
Project 1
Week4-6 2/2, 2/7, 2/9, 2/14 Search trees and skip lists Ch 3 Assignment 3
Week6-7 2/16, 2/21, 2/23 Sorting, sets and selection Ch 4 Assignment 4
Week8 2/28, 3/2 Review, Midterm Exam 3/2 Project 1 Due
March 7-12 Spring Break
Week9-10 3/14, 3/16, 3/21 Fundamental techniques Ch. 5 Project 2
Week10-11 3/23, 3/28, 3/30 graphs Ch 6
Week12-13 4/4, 4/16 4/11, Weighted graphs Ch. 7 Assignment 5
Week13-14 4/13, 4/18, 4/20 Cryptography Ch. 10
April 25 Final Exam Project 2 Due

Schedule is subject to change and additional material may be added/removed in class as

time permits.