info@avatto.com
+91-9920808017
0. 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 denotes the length of the longest monotonically increasing sequence starting at index i in the array Initialize Ln – 1 = 1 For all i such that 0 ≥ i ≥ n – 2 Finally the length of the longest monotonically increasing sequence is Max(L0, L1, ......, Ln+1). Which of the following statements is TRUE?
The algorithm uses dynamic programming paradigm
The algorithm has a linear complexity and uses branch and bound paradigm
The algorithm has a non-linear polynomial complexity and uses branch and bound paradigm
The algorithm uses divide and conquer paradigm
You must be logged in to post a comment.
Login with Facebook
Login with Google
Forgot your password?
Lost your password? Please enter your email address. You will receive mail with link to set new password.
Back to login
You must be logged in to post a comment.