next up previous


University of Texas at Arlington
Computer Science Engineering
Spring 1999



CSE 2320 - Algorithms and Data Structures
Section 060/061, 105 Nedderman Hall, TuTh 1:00-2:20pm
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, 330 Nedderman Hall, 272-2596, holder@cse.uta.edu. Office hours: 11a-12p, 5:30-6:30p TuTh

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


next up previous