CSE431_531 Fall 2010 Schedule

CSE431_531 Fall - CSE431/531 Fall 2010 Schedule(tentative http/www.cse.buffalo.edu/faculty/xinhe/cse531/schedule.html CSE 431/531 Fall 2010

Info iconThis preview shows pages 1–2. Sign up to view the full content.

View Full Document Right Arrow Icon
CSE 431/531 Fall 2010 Schedule (tentative) Topics: Asymtopic Notations and Analysis, Solving Recurrences, Master Theorem Reading Assignment: Supplementary Reading: Week 2: Sep. 8, 10 Topics: Asymtopic Notations and Analysis, Solving Recurrences, Master Theorem Reading Assignment: Same as Week 1. Week 3: Sep. 13, 15, 17 Topics: Divide and Conquer, including Selection, Matrix Multiplication, closest pair of points Reading Assignment: CLRS: Chapters 9, Sections 28.1, 4.2, 33.4; Classnote 3 Week 4: Sep. 20, 22, 24 Topics: Dynamic Programming with Knapsack problem, Longest Common Subsequence, Matrix-chain multiplication, Reading Assignment: CLRS: 15; Classnote 4 Topics: Application of dynamic programming in bioinformatics problems. Topics: Greedy Algorithms. Reading Assignment: CLRS: Section 16.1, 16.2; Classnote 5. Week 6: Oct. 4, 6, 8
Background image of page 1

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

View Full DocumentRight Arrow Icon
Image of page 2
This is the end of the preview. Sign up to access the rest of the document.

This document was uploaded on 10/05/2010.

Page1 / 2

CSE431_531 Fall - CSE431/531 Fall 2010 Schedule(tentative http/www.cse.buffalo.edu/faculty/xinhe/cse531/schedule.html CSE 431/531 Fall 2010

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

View Full Document Right Arrow Icon
Ask a homework question - tutors are online