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,

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.

GTA: Kuang-Nan Chang, 310 Woolf Hall, kchang@cse.uta.edu.
Office hours: 2-3pm TuTh.

Lectures Notes

Handouts

• Syllabus
• Homework 1 (html or postscript) (due 9/14). Solution (html or postscript).
• Program 1 (html or postscript) (due 9/21).
• Coding Standards
• Homework 2 (html or postscript) (due 9/28). Solution (html or postscript).
• Program 2 (html or postscript) (due 10/12). Note: writeup changed since 8pm on 9/30/99.
• Exam 1 outline and exam (postscript).
• Homework 3 (html or postscript) (due 10/26). Solution (html or postscript).
• Program 3 (html or postscript) (due 11/2).
• Homework 4 (html or postscript) (due 11/9). Sample dynamic programming and greedy algorithm problem with solution (html or postscript). Solution (html or postscript).
  
• Program 4 (html or postscript) (due 11/23).
• Exam 2 outline and exam (postscript).
• Homework 5 (html or postscript) (due 12/2). Solution (html or postscript).
• Final Exam outline and exam (postscript).

Course Resources

• A good package for previewing and printing PostScript documents is GhostView available for UNIX and Windows platforms.
• UTA Academic Computing Services
• UTA Library