info - CS 0250B Design and Analysis of Algorithms January...

Info iconThis preview shows page 1. Sign up to view the full content.

View Full Document Right Arrow Icon
CS 0250B Design and Analysis of Algorithms January 14, 2009 Lecturer: Professor Tak-Wah Lam (CYC 409, ) Tutor: Edward Wu ( ) Homepage: Lecture: Wed 10:40 am - 12:35 am and Fri 10:40 am - 11:35 am What to learn: basic algorithm design techniques analytical skills: complexity and correctness problem solving skills Prerequisite: Discrete Mathematics and Data Structures basic data structures: arrays, lists, queues, stacks, and trees programming: recursion discrete math: big Oh notation; mathemat- ical induction; recurrence relation; permuta- tion and combination. discrete probability Teaching plan: Divide and Conquer Graph algorithms Greedy algorithms Dynamic programming Network ±ow Linear programming and reduction Algorithms with numbers NP-completeness Reference books: Algorithms, Dasgupta, Papadimitriou, and Vazirani, 2008, McGraw Hill. Introduction to Algorithms, Cormen, Leiser-
Background image of page 1
This is the end of the preview. Sign up to access the rest of the document.

This note was uploaded on 03/01/2010 for the course CS 1234 taught by Professor Chan during the Spring '10 term at University of the Bío-Bío.

Ask a homework question - tutors are online