Computer Science and Application MP Set Exam 2022 Q-111 to 120

 111. What is the worst case time complexity • of a quicksort algorithm ?

(A) O (N)

(B) O (N log N)

(C) O (N²)

(D) O(logN)

Answer :  (C)

112. What is an AVL tree ?

(A)- A tree which is balanced and is a height balanced tree

(B) A tree which is unbalanced and is a height balanced tree .

(C) A tree with three children

(D) A tree with at most three childrens

Answer :  (A)

113. Which ofthe following design techniques is used in Quick Sort algorithm ?

(A) Greedy algorithm

(B) Divide and conquer algorithm

(C) Hash table

(D) Parsing

Answer :  (B)

114. In the input restricted deque :

(A) insertion at only one end, rear end

(B) deletion at only one end, front end

(C) insertion at both ends, rear and front end

(D) All of the above

Answer :  (A)

115. What is the number .of edges present in a complete graph having 'n' vertices ?

(A) (n*(n+1))/2

(B) {n*{n-1))/2

(C) n

(D) Information given is insufficient

Answer :  (B)

116. Which of the following sorting algorithms has the lowest worst case complexity ?

(A) Merge sort

(B) Bubble sort

(C) Quick sort

(D) Selection sort

Answer :  (A)

117. Suppose a circular queue of capacity (n- 1) elements is implemented with an array of n elements. Assume that the insertion and deletion operation are carried out using REAR and FRONT as array index variables, respectively. Initially REAR = FRONT = 0. The conditions to detect queue full and queue empty are :

(A) Full : (REAR +1) mod n = = FRONT

Empty : REAR ==FRONT == NULL

(B) Full : (REAR + 1) mod « = = FRONT

Empty : (FRONT + 1) mod n = = REAR

(C) Full : REAR = = FRONT

Empty : (REAR + 1) mod n = = FRONT

(D) Full ; (FRONT + 1) mod « = = REAR

Empty : REAR = FRONT

Answer :  (A)

118. The best data structure to check whether an arithmetic expression has balanced parentheses is a : (A) Queue

(B) Stack

(C) Tree

(D) Graph

Answer :  (B)

119. Which of the following is an application of stack ? –

(A) Finding factorial

(B) Tower of Hanoi

(C) Infix to post-fix

(D) All of the above

Answer :  (D)

120. The pre-fix notation is also called as :

(A) Polish notation

(B) Infix notation

(C) Post-fix notation

(D) None of the above

Answer :  (A)