9/23/2020 CAT-2 MCQ - CSE2003 DSA - G1 slot ( All students) - 20 Marks (page 1 of 2)

Dashboard / My courses / CSE2003_F20 / CAT-2 CSE2003 DSA - G1 slot (All students)

/ CAT-2 MCQ - CSE2003 DSA - G1 slot ( All students) - 20 Marks

Question 1
Not yet answered

Marked out of 1.00

Find the time complexity for the following recurrence relation :

a.

b.

c.

d.

Question 2
Not yet answered

Marked out of 1.00

Master theorem cannot be applied on which of the following recurrence relations

I.   T( n ) = T( n/2 ) + 2^n
II.  T( n ) = T(n/2)+ n(2 – cos n)

III.  T( n ) = 3T(n/3) + sqrt( n)

a. II only

b. I only

c. Both I and II

d. III only

e. Both I and III

115.240.194.24/vitcc/mod/quiz/attempt.php?attempt=75066&cmid=6506 1/4
9/23/2020 CAT-2 MCQ - CSE2003 DSA - G1 slot ( All students) - 20 Marks (page 1 of 2)

Question 3
Not yet answered

Marked out of 1.00

a.

b.

c.

d.

Question 4
Not yet answered

Marked out of 1.00

a.

b.

c.

d.

Question 5
Not yet answered

Marked out of 1.00

The time complexity of sorting the following numbers 89, 74, 63, 62, 34, 12 using quicksort will be of

a. O(n log n)

b. O(n2)

c. None of the above

d. O(log n)

115.240.194.24/vitcc/mod/quiz/attempt.php?attempt=75066&cmid=6506 2/4
9/23/2020 CAT-2 MCQ - CSE2003 DSA - G1 slot ( All students) - 20 Marks (page 1 of 2)

Question 6
Not yet answered

Marked out of 1.00

Select all the answers that are false in the case of quicksort.
i) Pivot element cannot be chosen randomly

ii) Always, the first element of the array (sub-array) must be chosen as the pivot 
iii) Always, the last element of the array (sub-array) must be chosen as the pivot 

iv) None of the above

(i), (ii), (iii) 

(i) only

(i) and (ii) only

(iv) only 

Question 7
Not yet answered

Marked out of 1.00

For deleting a node from Binary Search Tree containing two children can use which of the following node for replacement?

a. Both (Inorder Predecessor & Successor)

b. Anyone (Inorder Predecessor & Successor)

c. Inorder Predecessor

d. Inorder Successor

Question 8
Not yet answered

Marked out of 1.00

Check whether the given binary tree is binary search tree or not .

a. Binary search tree

b. Not a binary search tree

115.240.194.24/vitcc/mod/quiz/attempt.php?attempt=75066&cmid=6506 3/4
9/23/2020 CAT-2 MCQ - CSE2003 DSA - G1 slot ( All students) - 20 Marks (page 1 of 2)

Question 9
Not yet answered

Marked out of 1.00

Consider the binary search tree given below:

After removing node with value 17,  What will be the structure of the binary search tree?

a.

b.

c.

Question 10
Not yet answered

Marked out of 1.00

Suppose inorder and preorder traversal of a binary tree T are as follows.

 In-order :   I4, I5, I2, I8, I1, I6, I3, I7

 Post-order : I5, I4, I8, I2, I6, I7, I3, I1

 Which of the following the statements about the  tree T are true?
 I. I3 is ancestor of I7

II. I7 and I8 are siblings

III. I2 is a common ancestor of I5 and I8

IV.  The tree T is a complete binary tree

a. Both I and III

b. Both III and IV

c. Both II and IV

d. Both I and II

115.240.194.24/vitcc/mod/quiz/attempt.php?attempt=75066&cmid=6506 4/4