Algorithms and Data Structures (CSE 2320)
Fall 1999

CSE 2320 Section 501/571 105 Nedderman Hall, TuTh 5:30-6:50pm
University of Texas at Arlington
Department of Computer Science and Engineering

Past semesters: Fall 98, Spring 99

Other course materials: Dr. Holder's CSE 5311 Materials Dr. Cook's CSE 5311 Materials,

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,
Office hours: 4-5pm MW.

GTA: Kuang-Nan Chang, 310 Woolf Hall,
Office hours: 2-3pm TuTh.

Lectures Notes


Course Resources

StudyWeb Award
Lawrence B. Holder
Department of Computer Science and Engineering
University of Texas at Arlington
Box 19015, Arlington, TX 76019-0015
phone: (817) 272-2596, fax: (817) 272-3784