Algorithms - Sorting and Searching

Avatto > > GATE COMPUTER SCIENCE > > Practice Questions > > Computer Science And Information Technology > > Algorithms > > Sorting and Searching

31. L:et m, n be positive integers. Define Q (m, n) as Q (m, n) = 0, if m>n Then Q (m, 3) is (a div b, gives the quotient when a is divided by b)

Answer
Comment
Array

Option : C
Explanation : Let m>n. Let m/n yield a quotient x and remainder y. So, m= n*x+y and y<m div 3 is the quotient when m is divided by 3. So, that many times p is added, before we terminate recursion by satisfying the end condition Q (m,n) = 0 if m<n. Hence the result.

You must be logged in to post a comment.

You must be logged in to post a comment.

32. Sorting is useful for

Answer
Comment
Array

Option : D
Explanation :

You must be logged in to post a comment.

You must be logged in to post a comment.

33. Choose the correct statements

Answer
Comment
Array

Option : D
Explanation :

You must be logged in to post a comment.

You must be logged in to post a comment.

34. A sorting technique that guarantees that records with the same primary key occurs in the same order in the sorted list as in the original unsorted list is said to be

Answer
Comment
Array

Option : A
Explanation :

You must be logged in to post a comment.

You must be logged in to post a comment.

35. The way a card game player arranges his cards as he picks them up one by one, is an example of

Answer
Comment
Array

Option : C
Explanation :

You must be logged in to post a comment.

You must be logged in to post a comment.

Related Quiz.
Sorting and Searching

Forgot your password?

I agree with the Terms.