Miscellaneous On Data Structures - Study Mode

Show All Answers

[#576] What is the time complexity of the above recursive implementation of binary search?

(A) O(n)

(B) O(2 n )

(C) O(logn)

(D) O(n!)

Correct Answer

(C) O(logn)

[#577] How many 2*2 matrices are used in this problem?

(A) 1

(B) 2

(C) 3

(D) 4

Correct Answer

(B) 2

[#578] The sum and composition of two polynomials are always polynomials.

(A) true

(B) false

Correct Answer

(A) true

[#579] Consider the following number of activities with their start and finish time given below. In which sequence will the activity be selected in order to maximize the number of activities, without any conflicts? Activity Starting time Finish time A1 1 2 A2 2 5 A3 1 5 A4 3 6 A5 6 8 A6 4 9

(A) A1, A2, A5

(B) A1, A2, A3, A4

(C) A1, A3, A5

(D) A1, A2, A5, A6

Correct Answer

(A) A1, A2, A5

[#580] Cross product of two vectors can be used to find?

(A) area of rectangle

(B) area of square

(C) area of parallelogram

(D) perimeter of rectangle

Correct Answer

(C) area of parallelogram