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

View solution

Q. You want to check whether a given set of items is sorted. Which of the following sorting methods will be most efficient if it is already in sorted order?

View solution

Q. The average number of comparisons performed by the merge sort algorithm, in merging two sorted liss of length 2 is

View solution

Q. Which of the following sorting methods will be the best if number of swappings done, is the only measure of efficienty?

View solution

Q. You are asked to sort 15 randomly generated numbers. You should prefer

View solution

Q. As part of the maintenance work, you are entrusted with the work of rearranging the library books in a shelf in proper order, at the end of each day. The ideal choice will be

View solution

Q. The maximum number of comparisons needed to sort 7 items using radix sort is (assume each item is 4 digit decimal number)

View solution

Q. Where is linear searching used?

View solution

Q. What is the best case for linear search?

View solution

Q. What is the worst case for linear search?

View solution

Q. What is the best case and worst case complexity of ordered linear search?

View solution

Q. Which of the following is a disadvantage of linear search?

View solution

Q. What is the advantage of recursive approach than an iterative approach?

View solution

Q. Given an input arr = {2,5,7,99,899}; key = 899; What is the level of recursion?

View solution

Q. Given an array arr = {45,77,89,90,94,99,100} and key = 99; what are the mid values(corresponding array elements) in the first and second levels of recursion?

View solution

Q. What is the worst case complexity of binary search using recursion?

View solution

Q. What is the average case time complexity of binary search using recursion?

View solution

Q. What are the applications of binary search?

View solution

Q. Binary Search can be categorized into which of the following?

View solution

Q. Given an array arr = {5,6,77,88,99} and key = 88; How many iterations are done until the element is found?

View solution