• #### 1.  What will be the complexity of Quick sort while data is already sorted in increasing order?

• O(1)O\left(1\right)O(1)
• O(n)O\left(n\right)O(n)
• O(nlog⁡2n)O\left(n\log_2n\right)O(nlog2​n)
• O(n2)O\left(n^2\right)O(n2)
• #### 2.  A binomial tree of order k can be constructed by uniting

• first binomial tree of order k and second of order k-1
• two binomial trees of order k-1
• two binomial trees of order k
• first binomial tree of order k-1 and second of order k
• #### 3.  What is the space complexity of Bubble sort?

• O(n)O\left(n\right)O(n)
• O(nlog⁡2n)O\left(n\log_2n\right)O(nlog2​n)
• O(1)O\left(1\right)O(1)
• O(n2)O\left(n^2\right)O(n2)
• #### 4.  A binomial tree of order 4 will have its children

• B3 , B2 , B1 , B0B_{3\ },\ B_2\ ,\ B_1\ ,\ B_0B3 ​, B2​ , B1​ , B0​
• B0 , B1 , B2 , B3B_{0\ },\ B_1\ ,\ B_2\ ,\ B_3B0 ​, B1​ , B2​ , B3​
• B3 , B2 B_{3\ },\ B_2\ B3 ​, B2​
• B3 , B3B_{3\ },\ B_3B3 ​, B3​
• #### 5.  What is the space complexity of counting sort?

• O(1)O\left(1\right)O(1)
• O(n)O\left(n\right)O(n)
• O(k)O\left(k\right)O(k)
• O(n+k)O\left(n+k\right)O(n+k)
• #### 6.  Which one of the following sorting algorithm uses divide and conquer approach?

• Selection Sort
• Insertion Sort
• Merge Sort
• Bubble Sort
• #### 7.  Which of the following methods can be used to solve n-queen’s problem?

• a) greedy algorithm
• b) divide and conquer
• c) iterative improvement
• d) backtracking

• 255
• 188
• 65
• 127
• #### 9.  Which one of the following statement is correct about b-tree?

• B tree is designed to work well on disk or secondary storage
• B-tree is used to minimize disk i/o operations
• B-tree is used in database for indexing
• All of these
• #### 10.  Which one of the following sorting algorithm cannot sort negative numbers?

• Merge sort
• Quick sort
• Counting sort
• Selection
• #### 11.  What is space complexity of Merge Sort?

• O(1)O\left(1\right)O(1)
• O(n)O\left(n\right)O(n)
• O(n2)O\left(n^2\right)O(n2)
• O(nlog⁡2n)O\left(n\log_2n\right)O(nlog2​n)

• t-1
• 2*t-1
• 1
• All of these
• #### 13.  Which one of the following is linear sorting algorithm?

• Selection sort
• Merge sort
• Counting sort
• Bubble sort
• #### 14.  What will be the worst case complexity of Merge Sort while data is already sorted in increasing order?

• O(1)O\left(1\right)O(1)
• O(n)O\left(n\right)O(n)
• O(nlog⁡2n)O\left(n\log_2n\right)O(nlog2​n)
• O(n2)O\left(n^2\right)O(n2)
• #### 15.  Which one of the following uses divide, conquer and combine approach?

• Quick Sort
• Merge Sort
• Selection
• Counting Sort
• #### 16.  Which one of the sorting algorithm picks the smallest element of the array and place it in beginning positions in every iteration?

• Quick sort
• Insertion sort
• Selection sort
• Bubble sort
• #### 17.  Which one of the following sorting algorithm always divides its data into almost two equal half ?

• Selection Sort
• Quick Sort
• Merge Sort
• Bubble Sort
• #### 18.  What is the worst case complexity of Merge Sort?

• O(n2)O\left(n^2\right)O(n2)
• O(nlog⁡2n)O\left(n\log_2n\right)O(nlog2​n)
• O(n)O\left(n\right)O(n)
• O(1)O\left(1\right)O(1)
• #### 19.  Which one of the following is not stable sort?

• Counting sort