CPS 130: Introduction to the Design and Analysis ofAlgorithms
course is an introductory undergraduate course on the design and analysis
of algorithms. The course builds on the study of the analysis and implementation
of data structures and algorithms from CPS100. The goal is to introduce
a number of important algorithm design techniques as well as basic algorithms
that are interesting both from a practical and theoretical point of view.We
will cover basic algorithm design techniques such as divide-and-conquer,
dynamic programming, and greedy techniques for optimization. We will cover
techniques for proof of the correctness of algorithms and also asymptotic
analysis of algorithm time bounds by the solution of recurrence equations.
We will apply these design and analysis techniques to derived algorithms
for a variety of tasks such as sorting, searching, and graph problems.
Some specific algorithm topics include: deterministic and randomized sorting
and searching algorithms, depth and breadth first search graph algorithms
for finding paths and matchings, and algebraic algorithms for fast multiplication
and linear system solving.
CPS 100 or equivalent and four semesters
of college mathematics.
This course requires undergraduate background
in data structures (as covered in CPS100) as well as a certain amount of
mathematical sophistication (e.g., as required to solve recurrence equations).
A quiz on recurrence equations early in the course will provide you with
some feedback on whether your mathematics training will suffice. If you
feel that you may not have sufficient background, please talk with the
instructor John Reif.
D223 LSRC Building
Mondays and Wednesdays (and sometimes Fridays)
2:20-3:35 in LSRC Building B101.
Office: N003 North Building
Phone: (919) 660-4003
Office: N003 North Building
Phone: (919) 660-4003
3:35pm - 4:45pm (John Reif)
appointment (call or email).
1:10pm - 2:00pm (TA)LSRC
course will be based on
Leiserson, Rivest, and Stein.Introduction
to Algorithms, McGraw
Hill, second edition, 2001. Be sure to get the second edition!
lecture notes and research papers (downloads).
Auxiliary Reading: Other good reference books:
Brassard and P. Bratley, Algorithmic - Theory and Practice,
Prentice Hall, 1988.
Kozen, The Design and Analysis of Algorithms,
Springer Verlag, 1991.
Aho, J. Hopcroft, and J. Ullman, Design and Analysis of Algorithms,
Addison Wesley 1974.
Tarjan, Data Structures and Network Algorithms,
SIAM Publications, 1983.
H. Papadimitriou, Computational Complexity,
Addison Wesley, 1994.
Analysis of Algorithms: Growth of functions, summations, recurrences, average-case
and randomized analysis
and selection: Divide-and-conquer
and Randomized Techniques
Trees: Search trees
and Algebraic Algorithms
Summary of Topics Covered and Lecture Notes:
Computer Science Cheat Sheet: pspdf
Ten pages of commonly used formulas and other useful information for computer
scientists. By Professor Steven Seiden of Louisiana State U.
Vernon's Useful Formulas Page ps
to Solve and Write Up Homework Problems: pspdf
Helpful advice from Prof. Alan Sherman of the U. of Maryland, Baltimore
Reading of Papers in Science and Technology: ps
This short brochure from an unknown author is well worth studying.
Online Dictionary of Computing:An
online glossary, with cross-referencing.
of Algorithms, Data Structures, and Problems:Includes
definitions, problem analysis, code samples, and in some cases animations.
are due roughly every week and must be turned in before class on Wednesday
of the week they're due. No credit is given for late solutions. For exceptional
circumstances, see John Reif in advance.
Homework assignments will be archived
in the homework
directory. The postscript version, pdf version, and source LaTeX
code will be available for each homework problem.
Details about proper style for writing
up homework solutions and some guidelines for grading appear in ps
format. More detailed notes on how to write up technical material
in the Computer Science field (much of which is beyond the scope of this
course) are available in gzipped
ps or pdf.
It is recommended but not required
that LaTeX be used for typesetting homework problems. You can make use
of the LaTeX
source file, the LaTeX
macros, a LaTeX
template file, a LaTeX
Honor Code on Homework Problems:
homework problems, discussion among students is permitted, but students
MUST write up solutions independently on their own. No materials
or sources from prior years' classes or from the Internet can be consulted.
the rules can result in expulsion.
Each student is required to make a copy of this page, sign it indicating
that the contents are understood, and turn it in to John Reif.
grades for the class will be based on
assignments (approx. 25%).
Closed-book quizes (second optional, averaged total of 7.5%).
midterm exam 1 (approx. 15%).
midterm exam 2 (approx. 15%).
final exam (approx. 37.5%).
Class Project (only if approved by instructor).
Anonymous Course Feedback:
John Reif / Duke University