MCQ1 mark
Consider the following recurrence relations:
For all ,
Assume that for all , and .
Which one of the following options is correct?
Single correct
GATE CSE previous year questions · Algorithms
Single correct
Single correct
One or more correct
Numerical answer
Single correct
Single correct
fun(int A[0,…,n-1]){
for i=0 to n-2
for j=0 to n-i-2
if (A[j]>A[j+1])
then swap A[j] and A[j+1]
}
Let be an array storing 30 distinct integers in descending order. The number of swap operations that will be performed, if the function fun() is called with as argument, is __________. (Answer in integer)Numerical answer
Single correct
One or more correct
Single correct
Single correct
Numerical answer
One or more correct
Answer key coming soon
Single correct
Answer key coming soon
Single correct
Answer key coming soon
Single correct
Answer key coming soon
Single correct
Answer key coming soon

Numerical answer
Answer key coming soon
Single correct
Answer key coming soon
Single correct
Answer key coming soon