Computer Science > QUESTIONS & ANSWERS > Arizona State UniversityCSE 551CSE551_Week5_Solutionsheet (All)
Arizona State UniversityCSE 551CSE551_Week5_Solutionsheet
Document Content and Description Below
CSE 551: Quiz 5 Solutions ASU, Summer 2019 June 30, 2019 1 Problem 1 Which of the following is not an example of a famous dynamic programming algorithms? • Dijkstras algorithm using Fibonacci ... Heaps • Cocke-Kasami-Younger for parsing context-free grammars • Viterbi for hidden Markov Models • Unix diff for comparing two files 1.1 Rationale Dijkstra’s algorithm uses greedy as its paradigm. The other three algorithms are all classic examples of dynamic programming. 12 Problem 2 Consider the following example for Weighted Interval Scheduling. Identify p(4)? • 1 • 2 • 3 • 8 2.1 Rationale Job 1 ends just before job 4 begins, and thus fits the definition of p(4) since it is the latest finishing job that does not overlap with job 4. 3 Problem 3 Which of the following is the sub-problem for Weighted Interval Schedulings dynamic programming algorithm? • The maximum of vj + OPT(p(j)) and OPT(j-1). • The minimum of vj + OPT(p(j)) and OPT(j-1) [Show More]
Last updated: 3 years ago
Preview 1 out of 7 pages
Buy this document to get the full access instantly
Instant Download Access after purchase
Buy NowInstant download
We Accept:
Reviews( 0 )
$12.00
Can't find what you want? Try our AI powered Search
Document information
Connected school, study & course
About the document
Uploaded On
Aug 28, 2021
Number of pages
7
Written in
All
Additional information
This document has been written for:
Uploaded
Aug 28, 2021
Downloads
0
Views
85
.png)
.png)
.png)
.png)
.png)
