cs4102-bocm-s2010

# cs4102-bocm-s2010 - CS4102 Algorithms Final Beginning of...

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: Office: Olsson 228B. Phone: 982-2217 Office hours: M Tu Th 11am-noon, and by appointment Teaching Assistants: Sonali Parthasarthy. Office hours to be announced on the website. Class time and location: TR 9:30-10: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- and-conquer, and dynamic programming. Data structures include heaps and search, splay, and spanning trees. Analysis techniques include asymptotic worst-case, 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, lower-bounds 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.

{[ snackBarMessage ]}

### Page1 / 2

cs4102-bocm-s2010 - CS4102 Algorithms Final Beginning of...

This preview shows document pages 1 - 2. Sign up to view the full document.

View Full Document
Ask a homework question - tutors are online