University of Texas at Arlington
Computer Science Engineering
Fall 1999



CSE 2320 - Algorithms and Data Structures
Section 501/571, 105 Nedderman Hall, TuTh 5:30-6:50pm
URL: http://www-cse.uta.edu/$^\sim$holder/courses/cse2320.html

Description:	Design and analysis of algorithms with an emphasis on data structures. Approaches to analyzing lower bounds on problems and upper bounds on algorithms. Classical algorithm design techniques including algorithms for sorting, searching, and other operations on data structures such as hash tables, trees, graphs, strings, and advanced data structures, dynamic programming and greedy approaches.
Prerequisites:	C/C++ Programming (CSE 1325) and Discrete Structures (CSE 2315).
Textbook:	Cormen, Leiserson and Rivest, Introduction to Algorithms, MIT Press, 1990.
Grading:	5 Homeworks (15%), 4 Programs (35%), 2 Exams (30%), 1 Final (20%).
Instructor:	Larry Holder, 344 Nedderman Hall, 272-2596, holder@cse.uta.edu. Office hours: 4-5pm MW.

Course Details

1.

Assigned readings are from the above textbook. You should read the introductory material at the beginning of each chapter whose sections are referred to in the assigned readings.

2.

Homeworks must be submitted to the instructor in class on the due date. Late homeworks submitted to the instructor by 5:00pm on the day after the due date will be accepted with a 10% penalty. No other late homeworks will be accepted.

3.

Programs will be submitted electronically. Information on electronic submissions will be distributed in class. Late programs submitted by 5:00pm on the day after the due date will be accepted with a 10% penalty. No other late programs will be accepted.

4.

Programs may be written in C or C++. The final program must compile and run correctly on the ACS machine omega. Each student will receive an account on this machine.

5.

All exams and final are closed-book, closed-notes cumulative exams and cover the material up to and including the point indicated on the course schedule.

6.

All work in this class must be done individually. Anyone cheating on work assigned in this class will receive a zero for that assignment and will be subject to the university's academic dishonesty policy. Cheating involves giving assistance to or receiving assistance from another individual on work assigned in this class. If you have any questions regarding an assignment, see the instructor or teaching assistant.

7.

If you require an accommodation based on disability, I would like to meet with you the first week of the semester to be sure you are appropriately accommodated.

Course Schedule

Class	Date	Topic	Readings	Assignments Due
1	8/24	Introduction
2	8/26	Design and Analysis	1
3	8/31	Asymptotics	2
4	9/2	Summations	3
5	9/7	Recurrences	4.1, 4.2
6	9/9	Recurrences
7	9/14	Heapsort	7	HW1 Due
8	9/16	Quicksort	8.1, 8.2
9	9/21	Linear Sorting	9.1, 9.2	PGM1 Due
10	9/23	Data Structures	11	End material for Exam 1
11	9/28	Hash Tables	12.1-12.3	HW2 Due
12	9/30	Hash Tables	12.4
13	10/5	EXAM 1
14	10/7	Binary Search Trees	13.1-13.3
15	10/12	Red-Black Trees	14.1-14.3	PGM2 Due
16	10/14	Red-Black Trees	14.4
17	10/19	B-Trees	19.1, 19.2
18	10/21	B-Trees	19.3
19	10/26	Dynamic Programming	16.1, 16.2	HW3 Due
20	10/28	Dynamic Programming	16.3
21	11/2	Greedy Algorithms	17.1, 17.2	PGM3 Due
22	11/4	Greedy Algorithms	17.3	End material for Exam 2
23	11/9	Graph Algorithms	23	HW4 Due
24	11/11	Minimum Spanning Trees	24
25	11/16	EXAM 2
26	11/18	Maximum Flow	27.1, 27.2
27	11/23	Maximum Flow		PGM4 Due
28	11/30	String Matching	34.1, 34.4	End material for Final
29	12/2	Conclusions and Review		HW5 Due
	12/7	FINAL EXAM 5:30-8pm