# lecture1 - CS 473: Algorithms Chandra Chekuri...

This preview shows pages 1–10. Sign up to view the full content.

CS 473: Algorithms Chandra Chekuri chekuri@cs.illinois.edu 3228 Siebel Center University of Illinois, Urbana-Champaign Fall 2009 Chekuri CS473ug

This preview has intentionally blurred sections. Sign up to view the full version.

View Full Document
Instructional Staﬀ Instructor: Chandra Chekuri ( chekuri ) Oﬃce Hours: 1-2pm Thursday/Friday, and by appointment. Teaching Assistants: Alina Ene ( ene1 ) Kyle Fox ( kylefox2 ) Dan Schreiber ( dschrei2 ) Oﬃce Hours: See course webpage Chekuri CS473ug

This preview has intentionally blurred sections. Sign up to view the full version.

View Full Document
Electronic Bulletin Boards Webpage: www.cs.illinois.edu/class/fa09/cs473 Newsgroup: class.fa09.cs473 on server news.cs.illinois.edu Chekuri CS473ug
Textbooks Prerequisites: All material in CS 173, CS 225 and CS 373 Text-book: Algorithm Design by Kleinberg and Tardos Lecture Notes: Available on the web-page after every class Additional References Algorithms: Dasgupta, Papadimitriou, and Vazirani. Introduction to Algorithms: Cormen, Leiserson, Rivest, Stein Computers and Intractibility: Garey and Johnson Previous class notes of Jeﬀ Erickson, Sariel Har-Peled, Mahesh Viswanathan and the instructor. Chekuri CS473ug

This preview has intentionally blurred sections. Sign up to view the full version.

View Full Document
Prerequisites Asymptotic notation: O () , Ω() , o () , ω () Discrete Structures : sets, functions, relations, equivalence classes, partial orders, trees, graphs Logic : predicate logic, boolean algebra Proofs : by induction , by contradiction Basic sums and recurrences : sum of a geometric series, unrolling of recurrences, basic calculus Data Structures : arrays, multi-dimensional arrays, linked lists, trees, balanced search trees, heaps Abstract Data Types : lists, stacks, queues, dictionaries, priority queues Algorithms: sorting (merge, quick, insertion), pre/post/in order traversal of trees, depth/breadth ﬁrst search of trees (maybe graphs) Basic analysis of algorithms : loops and nested loops, deriving recurrences from a recursive program Concepts from Theory of Computation : languages, automata, Turing Machine, undecidability, non-determinism Programming : in some general purpose language Elementary Discrete Probability : event, random variable, independence Mathematical maturity Chekuri CS473ug
Grading Policy: Overview Homeworks: 25% Midterms: 40% (2 × 20) Finals: 35% Chekuri CS473ug

This preview has intentionally blurred sections. Sign up to view the full version.

View Full Document
Homeworks One homework every week: Assigned on Monday and due the following Monday by midnight (in practice no later than 7am on Tue morning). Drop oﬀ in Elaine Wilson’s oﬃce (3229 Siebel). Exception: HW 0 is due on Tuesday in class. Homeworks can be worked on in groups of up to 3 and each group submits one written solution (except Homework 0). Groups can be changed a few times only Homeworks will be “turned in” orally every third week; the rest of the times you will turn in a written homework Oral: Explain (verbally) to TA the solution to problems that are asked for. Written: Write solutions to every problem and turn in the written solutions. Chekuri CS473ug
More on Homeworks No extensions or late homeworks accepted.

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.

## This note was uploaded on 01/22/2012 for the course CS 573 taught by Professor Chekuri,c during the Fall '08 term at University of Illinois, Urbana Champaign.

### Page1 / 101

lecture1 - CS 473: Algorithms Chandra Chekuri...

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

View Full Document
Ask a homework question - tutors are online