CS 218: Design and Analysis of Algorithms
Winter Quarter, 2006
Mar 16: "problems" slides posted.
Mar 15: Homework 5 solution posted.
Mar 10: Sample final (and solution) posted.
Mar 2: Homework 4 solution posted.
Mar 2: Homework 5 posted.
Feb 28: "Network flow" slides posted.
Feb 28: "Pattern matching" slides posted.
Feb 22: Homework 3 solution posted.
Feb 21: Homework 4 posted.
Feb 21: "Dynamic programming" slides updated.
Feb 17: Midterm and solution posted.
Feb 10: "Dynamic programming" slides posted.
Feb 8: Sample midterm (and solution) posted.
Feb 7: Homework 3 posted.
Feb 7: Homework 2 solution posted.
Feb 2: Homework 2 revised.
Feb 2: "Greedy" slides updated.
Jan 31: "Divide and conquer" slides posted.
Jan 27: "Greedy" slides updated.
Jan 26: due date of Hw2 postponed.
Jan 24: Homework 2 posted.
Jan 24: Homework 1 solution posted.
Jan 17: "Greedy algorithms" slides posted.
Jan 12: Homework 1 posted.
Jan 11: office hours today are cancelled.
Jan 9: "Algorithm analysis" slides posted.
Lecture Schedule Email list Resources Tutorials Animations
Catalog description: CS 218. Design and
Analysis of Algorithms (4) Lecture, 3 hours; outside research, 3
hours. Prerequisite(s): CS 141. Study of efficient data structures and
algorithms for solving problems from a variety of areas such as
sorting, searching, selection, linear algebra, graph theory, and
computational geometry. Worstcase and averagecase analysis using
recurrence relations, generating functions, upper and lower bounds,
and other methods. UCR course schedule,
UCR course
catalog.
Instructor:
Stefano Lonardi (stelo AT cs.ucr.edu)
Office hours: Wednesday 45:30pm. Office: Engineering 2, 317.
Teaching Assistant:
Kan Liu (kanliu AT cs.ucr.edu)
Office hours: Monday 1011am (EBU II 110).
Lectures:
TR, 2:10pm3:30pm Engineering 2, 139
Text Book:
Introduction to Algorithms (2nd Edition) by Thomas H. Cormen, Charles E. Leiserson, Ronald L. Rivest, and Cliff Stein, MIT Press.
Prerequisites:
Graduate standing, undergraduate courses in algorithms
and data structures.
Prerequisites by topic:
Discrete Math: asymptotic notation, basic summation formulas,
sets (operations on sets, relations, functions),
counting (permutations, sets, combinations, binomial coefficients),
probability (independence, random variable, expected value)
Basic Data Structures: array, list, queue, stack, binary search
trees, balanced binary search trees, heap
Sorting and Searching: quicksort, mergesort, heapsort, radixsort,
binary search
Graph algorithms: DFS, BFS, connected components, biconnected components,
transitive closure
Digraph algorithms: DFS, BFS, strongly connected components, topological sorting
Tentative list of topics
Intro to Analysis: recurrence relations, master theorem, amortized analysis
Pattern matching: brute force, KMP, tries and suffix trees
Greedy: task scheduling, factional knapsack, Huffman codes, Dijkstra, Prim, Kruskal
UnionFind: list and tree implementation, union by rank and path compression, analysis
Divide and conquer: lineattime selection, Strassen, FFT, Integer multiplication
Dynamic programming: Subset sum, LCS, matrix chain multiplication, FloydWarshall
Graph algorithms: Flow and matching
Numerical algorithms: primality testing, RSA
Data structures: binomial heaps and Fibonacci heaps, splay trees
Actual list of topics
Jan 10: Course overview, Analysis of Algorithms (slides 121)
Jan 12: Analysis of Algorithms (slides 2245) [HW1 posted]
Jan 17: Analysis of Algorithms (slides 4661)
Jan 19: Analysis of Algorithms (slides 62end), Greedy+UnionFind (slides 130)
Jan 24: Greedy+UnionFind (slides 3154) [HW1 due, HW2 posted]
Jan 26: Greedy+UnionFind (slides 5582)
Jan 31: Greedy+UnionFind (slides 83124)
Feb 2: Greedy+UnionFind (slides 125end), DivideEtImpera (slide 18)
Feb 7: DivideEtImpera (slide 949) [HW2 due, HW3 posted]
Feb 9: DivideEtImpera (slide 50end)
Feb 14: Midterm review
Feb 16: [Midterm (80mins, in class, closed book, closed notes)]
Feb 21: Dynamic Programming (slides 123)[HW3 due, HW4 posted]
Feb 23: Dynamic Programming (slides 2440)
Feb 28: Dynamic Programming (slides 4163)
Mar 2: Dynamic Programming (slides 64end), Pattern Matching (slides 125)[HW4 due, HW5 posted]
Mar 7: Pattern Matching (26end), Flow (113)
Mar 9: Flow (1451, skipped 4549)
Mar 14: Flow (51end)[HW5 due]
Mar 16: Review
Mar 20: 11:302:30pm [Final (in class, closed book, closed notes)]
Slides
Intro [PDF 2pages/slide]
Algorithm Analysis [PDF 2pages/slide]
Greedy algorithms [PDF 2pages/slide, updated Feb 2]
Divide and Conquer algorithms [PDF 2pages/slide]
Dynamic Programming algorithms [PDF 2pages/slide]
Pattern Matching algorithms [PDF 2pages/slide]
Network flow algorithms [PDF 2pages/slide]
Problems [PDF 2pages/slide]

Academic dishonesty: Cheating
will be strongly punished (typically
with an F in the course). You can
report cheating anonymously at:
https://www.cs.ucr.edu/cheating/. Assignment
submissions must represent your
original work. Copying from any
sources (web, other books, past or
current students, etc.) is strictly
prohibited. While discussing
assignments together is
encouraged, pooling common answers
is not allowed. Be aware that a
subset of exams may be photocopied,
for comparison with exams submitted
for regrades. Also, be aware that
lying to an instructor in order to be
able to makeup a missed exam or in
other ways to obtain a better grade
can be treated as academic dishonesty.

Regrade policy: Regrade
requests must be submitted in
writing and within two weeks of
the distribution of the graded
material. The entire
homework/test/assignment may be
regraded, not just the problem in
question, so the grade may go up or
down. Thus, think your regrade
requests through carefully. Recording errors should also be pointed out to
the instructor before the last class.

Final grades: Per university
policy, changes to your final grade
will be made only in the event
of a clerical error. Asking your
instructor how far you were from a
cutoff and what extra work you can do
to improve the grade is not
appropriate.

Communicating with the instructors
: When sending electronic
mail to the instructors or
graders, please include your full
name, student ID
number, and UCR email
address, so that we may properly
identify you (remember, many students
have similar names). Also, please try
to be polite and use reasonable
grammar and formatting.

Cell phones: During lectures
please turn off your
cell phone. During exams, cell phones
must not be visible (e.g., store them
inside a backpack).

Written Assignments: All
assignments and solutions will be
posted on the class homepage. Write
your full name with uppercase LAST
name, assignment number, student ID,
login. Write legibly: what cannot be
read will not be graded. Consider
typing the assignment if you
handwriting is hard to read. Written
assignments have to be submitted
before the beginning of the
class on the due date on the
instructor's desk. No
late assignment will be accepted. Any
problem with grading of a written
assignment should be addressed at the
latest two weeks after the
assignment is returned to you.
Course mailing list
(send mail now or
access the archive): Be sure to sign up to receive important
announcements, which will be made only through the course email list. You
must use your CS or EE account, or else some other UCR account, so be sure to
learn how to read those accounts or at least automatically forward messages to
your personal email address (just create in your home directory a file named
".forward" containing your personal email address).