Gate CS-2015-2 Question Paper With Solutions

Q. 40 Suppose you are provided with the following function declaration in the C
programming language

 int partition (int a[], int n);

The function treats the first element of a [ ] as a pivot, and rearranges the array
so that all elements less than or equal to the pivot is in the left part of the array,
and all elements greater than the pivot is in the right part. In addition, it moves
the pivot so that the pivot is the last elements of the left part. The return value
is the number of elements in the left part.
The following partially given function in the C programming language is used to
find the Kth smallest element in an array a [ ] of size n using the partition function
We assume k # n.

int kth_smallest (int a[], int n, int k)  {     int left_end = partition (a, n);     if (left_end+1==k)     {         return a [left_end];     }     if (left_end+1 > k)     {        return kth_smallest (____________________);     }     else    {        return kth_smallest (____________________);      }  } 

The missing argument lists are respectively

Learn More:   Gate CS-2008 Question Paper With Solutions

(A) (a, left_end, k) and (a+left_end+1, n–left_end–1, k–left_end–1)

(B) (a, left_end, k) and (a, n–left_end–1, k–left_end–1)

(C) (a, left_end+1, N–left_end–1, K–left_end–1) and(a, left_end, k)

(D) (a, n–left_end–1, k–left_end–1) and (a, left_end, k))

Answer: (A)

Explanation:

Gate CS-2015-2 Question Paper With Solutions

LEAVE A REPLY

Please enter your comment!
Please enter your name here