CSCI 3104
Algorithms
Spring 1996

Class notes

Page 1

Wednesday, January 17, 1996

What's new?

New room

The course got moved to a bigger room: ECCR 2-26.

Additional recitation

Recitations now are

          R021      63712  0200PM-0250PM T    STAD 140
          R022      63713  0330PM-0420PM T    STAD 140
          R023      63756  1100AM-1150AM T    RAMY N1B31

Next page || Current place in notes

Miscellaneous

Instructors: Andrzej Ehrenfeucht and Karl Winklmann.
Textbook and other references.
There will be two midterms, one final, and several programming assignments. Dates of the exams TBA soon.

Syllabus

There are two goals to this course. The first is to become familiar with a number of specific algorithms that belong to a standard body of knowledge in computer science. The second is to use these specific examples to develop an understanding of general methods of algorithm design.

Specific problems and algorithms

Various graph algorithms (including traversals, minimum spanning trees, shortest paths, optimal matchings)
network flow algorithms,
cryptography,
computational geometry algorithms,
balanced trees (B-trees, binary balanced trees, skiplists),
pattern matching,
heuristics for intractable problems.

General methods of algorithm design

Divide-and-conquer algorithms,
greedy algorithms,
randomized algorithms,
local optimization,
dynamic programming,
branch-and-bound,
simulated annealing and genetic algorithms.

Last edited (or copied to this place) at 11:15 AM, Friday, January 19, 1996.

CSCI 3104 Algorithms Spring 1996