CS19341 - Design and Analysis of Algorithms Lab-MCQ-viva

While using the step count method to find the time complexity of an algorithm, how many time the counter variable gets incremented when the for loop condition is false?

• 2
• 0
• 1
• 3

Order the below-stated efficiency classes in a descending manner, n,nlogn,n^2logn,n!

• n,nlogn,n^2logn,n!
• n^2logn,n!,n,nlogn
• n!,n^2logn,nlogn,n
• n!,n^2logn,n,nlogn

Identify the characteristics of an algorithm

• Well defined Inputs
• Finiteness
• Correctness
• Ambiguous
• Space Complexity

Say true or false for the given assertions

• false,true,false
• false,true,true
• false,false,true
• true,true,true

Consider an array A = [20, 31, 45, 56, 67, 78, 89, 91]. If key = 91, what will be the value of mid at the third recursion?

• 89
• 78
• 67
• 91

Consider two subarrays A1 = [1,2,10] and A2 = [7,8,9,12]. During the process of merging in Merge Sort how many comparisons are required to get a Sorted Array?

• 4
• 5
• 6
• 7

Consider an array [5,6,1,2,9,8]. Apply quicksort. After bringing the 1st pivot element to its correct position in the sorted List, how many elements will be present in the left subarray (Assume first element as Pivot)

• 1
• 2
• 3
• 4

Solving Finding Minimum Maximum element in an array using Divide and Conquer algorithm saves ______ comparisons compared to solving the same using Brute force

• 15%
• 25%
• 50%
• 70%

Consider the cost of insert as 1, delete as 2 and change as 1 to transform the string “FATHER” to “MOTHER”. What will be the minimum cost sequence of edit operations?

• 1
• 2
• 3
• 4

The choices made in Greedy approach are

• revocable
• irrevocable
• Feasible and revocable
• Not feasible and irrevocable