Design and Analysis of Algorithms (CSE 5311)
Fall 2002
Description: Techniques for analyzing upper bounds for
algorithms and lower bounds for problems. Problem areas include:
sorting, data structures, graphs, dynamic programming, combinatorial
algorithms, organization of numerical computations, introduction to
parallel models.
Prerequisites: Algorithms and Data Structures (CSE 2320) and
Theoretical Concepts in Computer Science and Engineering (CSE 3315).
Textbook: Cormen, Leiserson, Rivest and Stein,
Introduction to Algorithms, Second Edition , MIT Press, 2001.
Grading: 3 Programs (30%), 7 Quizzes (70%).
Instructor:
Larry Holder , 333 Nedderman Hall, 817-272-2596,
holder@cse.uta.edu.
Office hours: 3:30-4:30pm TuTh.
GTA: Srichandan Gudla, 412 Woolf Hall,
srichandangv@yahoo.com.
Office hours: 11am-12pm Mon, 4pm-5pm Wed.
Course Materials
Related links
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
email: holder@cse.uta.edu