Lecture 37 CSE 331 Nov 30, 2011.

Slides:

Advertisements

Similar presentations

Lecture 30 CSE 331 Nov 8, HW 7 due today Place Q1, Q2 and Q3 in separate piles I will not accept HWs after 1:15pm DO NOT FORGET TO WRITE DOWN YOUR.

Advertisements

Lecture 38 CSE 331 Dec 7, The last few days Today: Solutions to HW 9 (end of lecture) Wednesday: Graded HW 9 (?), Sample final, Blog post on the.

Lecture 26 CSE 331 Nov 4, The week of Nov 16 Jeff will be out of town for a conference Recitations and office hour cancelled for that week Two extra.

Lecture 31 CSE 331 Nov 16, Jeff is out of town this week No regular recitation or Jeff’s normal office hours I’ll hold extra Question sessions Mon,

Lecture 16 CSE 331 Oct 9, Announcements Hand in your HW4 Solutions to HW4 next week Remember next week I will not be here so.

Lecture 38 CSE 331 Dec 3, A new grading proposal Towards your final score in the course MAX ( mid-term as 25%+ finals as 40%, finals as 65%) .

Lecture 39 CSE 331 Dec 6, On Friday, Dec 10 hours-a-thon Atri: 2:00-3:30 (Bell 123) Jeff: 4:00-5:00 (Bell 224) Alex: 5:00-6:30 (Bell 242)

Lecture 27 CSE 331 Nov 3, Combining groups Groups can unofficially combine in the lectures.

Lecture 39 CSE 331 Dec 9, Announcements Please fill in the online feedback form Sample final has been posted Graded HW 9 on Friday.

Lecture 25 CSE 331 Nov 2, Adding teeth to group talk Form groups of size at most six (6) Pick a group leader I will ask group leader(s) to come.

Lecture 28 CSE 331 Nov 5, HW 7 due today Q1 in one pile and Q 2+3 in another I will not take any HW after 1:15pm.

Lecture 22 CSE 331 Oct 26, Blog posts Please sign up if you have not If I have a pick a blogger I will only pick ONE/lecture Will lose out on 5%

Lecture 38 CSE 331 Dec 2, Review Sessions etc. Atri: (at least ½ of) class next Friday Jiun-Jie: Extra office hour next Friday Jesse: Review Session.

Lecture 23 CSE 331 Oct 24, Reminder 2 points for Piazza participation 3 points for mini-project.

Lecture 38 CSE 331 Dec 5, OHs today (only online 9:30-11)

Lecture 33 CSE 331 Nov 20, HW 8 due today Place Q1, Q2 and Q3 in separate piles I will not accept HWs after 1:15pm Submit your HWs to the side of.

Lecture 32 CSE 331 Nov 16, 2016.

Lecture 26 CSE 331 Nov 2, 2016.

Lecture 20 CSE 331 Oct 15, 2010.

Lecture 23 CSE 331 Oct 26, 2016.

Lecture 15 CSE 331 Oct 5, 2012.

Lecture 21 CSE 331 Oct 21, 2016.

Lecture 24 CSE 331 Oct 28, 2016.

Lecture 24 CSE 331 Oct 27, 2017.

Lecture 36 CSE 331 Nov 29, 2017.

Lecture 21 CSE 331 Oct 20, 2017.

Lecture 36 CSE 331 Nov 30, 2016.

Lecture 35 CSE 331 Nov 27, 2017.

Lecture 34 CSE 331 Nov 20, 2017.

Lecture 33 CSE 331 Nov 18, 2016.

Lecture 33 CSE 331 Nov 17, 2017.

Lecture 14 CSE 331 Sep 30, 2011.

Lecture 35 CSE 331 Nov 28, 2016.

Lecture 37 CSE 331 Dec 1, 2017.

Lecture 24 CSE 331 Oct 25, 2013.

Lecture 22 CSE 331 Oct 23, 2017.

Lecture 23 CSE 331 Oct 25, 2017.

Lecture 24 CSE 331 Oct 29, 2012.

Lecture 23 CSE 331 Oct 24, 2011.

Lecture 26 CSE 331 Nov 2, 2012.

Lecture 22 CSE 331 Oct 24, 2016.

Lecture 32 CSE 331 Nov 14, 2011.

Lecture 32 CSE 331 Nov 15, 2017.

Lecture 33 CSE 331 Nov 14, 2014.

Lecture 25 CSE 331 Oct 27, 2014.

Lecture 33 CSE 331 Nov 15, 2013.

Lecture 34 CSE 331 Nov 21, 2016.

Lecture 22 CSE 331 Oct 15, 2014.

Lecture 18 CSE 331 Oct 9, 2017.

Lecture 31 CSE 331 Nov 14, 2012.

Richard Anderson Lecture 26 NP-Completeness

Lecture 11 CSE 331 Sep 23, 2011.

Lecture 14 Shortest Path (cont’d) Minimum Spanning Tree

Lecture 39 CSE 331 Dec 5, 2011.

Lecture 24 CSE 331 Oct 24, 2014.

Lecture 36 CSE 331 Nov 28, 2011.

Lecture 36 CSE 331 Nov 30, 2012.

Lecture 37 CSE 331 Dec 2, 2016.

Lecture 8 CSE 331 Sep 15, 2011.

Lecture 40 CSE 331 Dec 7, 2011.

Lecture 23 CSE 331 Oct 24, 2011.

Lecture 26 CSE 331 Nov 1, 2010.

Lecture 31 CSE 331 Nov 11, 2011.

Lecture 25 CSE 331 Oct 28, 2011.

Lecture 30 CSE 331 Nov 9, 2011.

Richard Anderson Lecture 20 Shortest Paths and Network Flow

Lecture 15 CSE 331 Oct 4, 2010.

Lecture 13 Shortest Path (cont’d) Minimum Spanning Tree

Lecture 36 CSE 331 Nov 22, 2013.

Lecture 37 CSE 331 Dec 3, 2018.

Presentation transcript:

Lecture 37 CSE 331 Nov 30, 2011

CSEd Week celebrations http://csedweek.wordpress.com/ Volunteers needed!

Thursday (tomorrow) 6PM Bell 224 CSEd Week (ACM) Thursday (tomorrow) 6PM Bell 224

Backchannel open today

Sample final exam Posted on the blog

Need volunteers for today

Fresh off the interwebs

Reading Assignment Sec 6.1, 6.2 of [KT]

When to use Dynamic Programming There are polynomially many sub-problems Richard Bellman Optimal solution can be computed from solutions to sub-problems There is an ordering among sub-problem that allows for iterative solution

Shortest Path Problem Input: (Directed) Graph G=(V,E) and for every edge e has a cost ce (can be <0) t in V Output: Shortest path from every s to t Assume that G has no negative cycle 1 100 -1000 899 s t Shortest path has cost negative infinity

Today’s agenda Dynamic Program for shortest path

May the Bellman force be with you