## Company

Loading
• 1.

### The usual θ(n^2) implementation of Insertion Sort to sort an array uses linear search to identify the position where an element is to be inserted into the already sorted part of the array. If, instead, we use binary search to identify the position, the worst case running time will A. remain θ(n^2) B. become θ(n(log n)^2) C. become θ(n log n) D. become θ(n)

asked in CIL 2012 CSE

• 2.

### Suppose the numbers 7, 5, 1, 8, 3, 6, 0, 9, 4, 2 are inserted in that order into an initially empty binary search tree. The binary search tree uses the usual ordering on natural numbers. What is the in-order traversal sequence of the resultant tree? A. 7 5 1 0 3 2 4 6 8 9 B. 0 2 4 3 1 6 5 9 8 7 C. 0 1 2 3 4 5 6 7 8 9 D. 9 8 6 4 2 3 0 1 5 7

asked in CIL 2012 CSE

• 3.

### In a heap with n elements with the smallest element at the root, the 7th smallest element can be found in time A. θ(n log n) B. θ(n) C. θ(log n) D. θ(1)

asked in CIL 2012 CSE

• 4.

### Which of the given options provides the increasing order of asymptotic complexity of functions f1, f2, f3 and f4?f1(n) = 2^n f2(n) = n^(3/2) f3(n) = nLogn f4(n) = n^(Logn) A. f3, f2, f4, f1 B. f3, f2, f1, f4 C. f2, f3, f1, f4 D. f2, f3, f4, f1

asked in CIL 2012 CSE

• 5.

### The recurrence relation capturing the optimal time of the Tower of Hanoi problem with n discs is A. T(n) = 2T(n – 2) + 2 B. T(n) = 2T(n – 1) + n C. T(n) = 2T(n/2) + 1 D. T(n) = 2T(n – 1) + 1

asked in CIL 2012 CSE

• 6.

### Stack is useful for implementing A. Radix Sort B. Breadth First Search C. Recursion D. Depth First Search

last reply by sushma singh  •  7 years ago  •  asked in EIL 2010 CSE