This preview shows pages 1–2. Sign up to view the full content.
CS4102, Algorithms
Final
Beginning of Course Memo (Spring 2010)
Class Web site:
http://www.cs.virginia.edu/~horton/cs4102
Instructor:
Prof. Tom Horton
Email:
horton.uva@gmail.com
Office: Olsson 228B.
Phone:
9822217
Office hours:
M Tu Th 11amnoon, and by appointment
Teaching Assistants:
Sonali Parthasarthy. Office hours to be announced on the website.
Class time and location:
TR 9:3010:45 pm, THN E316
Prerequisite:
CS216 / CS2150 with grade of C or higher.
Description from the Undergraduate Record:
Introduces the analysis of algorithms and the effects of
data structures on them. Algorithms selected from areas such as sorting, searching, shortest paths, greedy
algorithms, backtracking, divide andconquer, and dynamic programming.
Data structures include heaps
and search, splay, and spanning trees. Analysis techniques include asymptotic worstcase, expected time,
amortized analysis, and reductions between problems.
Course Objectives:
Upon successful completion of this course, students will:
1. Comprehend
fundamental ideas in algorithm analysis
, including: time and space complexity;
identifying and counting basic operations; order classes and asymptotic growth; lower bounds;
optimal algorithms.
2.
Apply
these fundamental ideas to
analyze and evaluate important problems and algorithms
in
computing, including search, sorting, graph problems, and optimization problems.
3.
Apply appropriate mathematical techniques in evaluation and
analysis, including limits, logarithms,
exponents, summations, recurrence relations, lowerbounds proofs and other proofs.
4.
This preview has intentionally blurred sections. Sign up to view the full version.
View Full Document
This is the end of the preview. Sign up
to
access the rest of the document.
 Spring '10
 HORTON
 Algorithms

Click to edit the document details