CS 4349: Advanced Data Structures and Algorithms

Fall 2005
Section 001

TR 12:30 - 1:45 pm
Room: ECSS 2.201

Instructor: Ovidiu Daescu TA:

Email:daescu@utdallas.edu Email:
Office: ECSS 4.224 Office:
Phone: (972) 883 4196 Phone:
Office Hours: MW 7:00-8:00 pm Office Hours:

Important Announcements

l Catalog Statement:

Height balanced trees, B-trees, and other techniques for efficient storage and retrieval of
information. Algorithm design techniques such as greedy method, dynamic programming,
and divide-and-conquer. Issues from computational complexity.

l Prerequisites

CS/SE 3345.

l Textbook

Introduction to Algorithms by Thomas H. Cormen, Charles E. Leiserson, Ronald L. Rivest

and Clifford Stein (CLRS). McGraw Hill, second edition. First edition is also sufficient.

l ABET info

l Grading Policy

Grades A-, A, A+ 80 - 100%

Homeworks 20% Grades B-, B, B+ 60 - 80%
Midterm 40% Grades C-, C, C+ 40 - 60%
Final 40% Grades D-, D, D+ 20 - 40%
Grade F 0 - 20%
l Important Dates

¡ Midterm Examination:
¡ Final Examination:

l Lecture Notes

¡ Math review
¡ Algorithm Analysis

Homeworks:

l Syllabus

¡ Asymptotic Notation: Big-Oh, Omega and Theta notations (Second Edition:

Chapter 3; First Edition: Chapter 2)
¡ Recurrences (Second and First Editions: Chapter 4)
¡ Divide-and-conquer Strategy (Second Edition: Chapters 7, 9, 33; First Edition:
Chapters 8, 10, 35)
¡ Dynamic Programming (Second Edition: Chapter 15; First Edition: Chapter 16)
¡ Greedy Algorithms (Second Edition: Chapter 16; First Edition: Chapter 17)
¡ Graph Algorithms (Second Edition: Chapters 22-25; First Edition: Chapters 23-
26)
¡ Advanced Topics (algorithms or data structures) selected from CLRS

Class Learning Objectives

¡ Understand and use general asymptotic notations

¡ Solve recurrences
¡ General analysis and proof of correctness of algorithms
¡ Design, analyze and where applicable prove correctness or optimality of algorithms
using
n Divide-and-Conquer techniques

n Greedy techniques

n Dynamic Programming techniques

¡ Analysis and proof of correctness of graph algorithms

Course Policies

¡ Class Attendance and Missed Lectures

Generally, students with active attendance, score higher than their classmates with
irregular attendance.

The student is responsible for any lectures and/or announcements that (s)he
 missed.

¡ Homeworks

The purpose of homeworks is to help you learn the material.

Homeworks count towards 20% of your grade. There will be no programming

homeworks. Not turning in a reasonable number of homeworks will likely
result in a lower grade irrespective of your overall standing. All homeworks
are due before the start of the class on the day it is due. Late homeworks will be
penalized by 10% of the total credit for that homework for each day that it is late. A
homework that is turned in later during the class or later on the day it is due will
incur a 10% penalty. Late homeworks will not be accepted after graded
homeworks have been returned or the homework solution has been
provided, whichever is earlier.

¡ Exams

The purpose of exams is to test your understanding.

There will be a total of 2 exams. All exams are closed book. No handouts, lecture
notes, homework/exam solutions are allowed in exams. Additionally, no post-it
notes, loose scraps of paper or any similar material are allowed. Please bring a valid
UTD photo ID to all exams.

¡ Clarity of Solutions

In addition to the correctness of your homework and exam solutions,

understandablity of solutions, methods of approach and logical reasoning will be
given due consideration. Points will be deducted for incomprehensible but
correct solutions, irrespective of their merit.

¡ Collaboration and Policy on Scholastic Dishonesty,

You are encouraged to collaborate in study groups on your homework solutions.

However, you must write your own solutions. You must also acknowledge in each
solution your collaborators or any other source of help (classmates, friends, peers,
parents, library books or any other person/material). It will not be considered a
collaborative effort if person A acknowledges person B's help, but person B does not
acknowledge person A's help.

You are also encouraged to study for your exams in study groups. However, no
collaboration on exams is permitted.

Copying during exams and on homeworks will not be tolerated. Students who violate
university rules on scholastic dishonesty will be 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 integrity of the
university, policies on scholastic dishonesty will be strictly enforced. The instructor
reserves the right to ask students to explain how they reached their solution. If the
student is unable to provide a satisfactory explanation, (s)he may lose points even if
 the answer is correct.

¡ Makeup Exams

Makeup exams will be given only in case of valid reasons (medical or family
emergencies). In such cases, the instructor should be notified well in advance
(where applicable). The instructor's decision is final with regard to the validity of the
reason. Forgetfulness or being stuck in routine traffic are not valid reasons.

Last modified:
CS 4349
O. Daescu
daescu@utdallas.edu