Scribd
Upload
23 views8 pages

A

Uploaded by

22520691
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF or read online on Scribd
23 views8 pages

A

Uploaded by

22520691
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF or read online on Scribd
You are on page 1/ 8
‘212823, 4:34 PM quiz quizz Points: 5/8 Y Correct 0.5/0.5 Points 1 Which of the following is/are property/properties of a dynamic programming problem? (3 Optimal substructure Overlapping subproblems Greedy approach Both optimal substructure and overlapping subproblems Y Correct 0.5/0.5 Points 2 An algorithm to find the length of the longest monotonically increasing sequence of numbers in an array A[0 :n-1] is given below. Let Li denote the length of the longest monotonically increasing sequence starting at index i in the array. ntps:forms.offce.compagesitesponsepage.aspx?id-rAn_TrgkGZUytUjg0L OebRYq2vB6ZHKIXZEE q76'SUOIRZREXUMTAXTONTNEBSSUsWWSHO.... 18 Initialize Lp. =1 For alli such that O

You might also like