**Computer Science Test MCQs, Data Structures**

**Set 3**

**Question:1**

The main measure of the efficiency of the algorithm

A. Process and memory

B. Time and space

C. Date and space

D. Complexity and capacity

Ans:b

**Question:2**

Big-oh allows the possibility the growth rates are the

A. different

B. Same

C. Greater

D. None of these

Ans:b

**Question : 3**

Whish Symbol tell us logarithms grows very slowly.

A. logkN=O(N)

B. Log(N)

C. Log2(N)

D. Nlog(N)

Ans:a

**Question: 4**

The Relative growth rates of two functions f(N) and g(N) by Limn->0f(N)/g(N) then

A. f (N)= o(g(N))

B. f ( N)+o(g(N))

C. G(N)=o(f))

Ans: c

**Question: 5**

Gcf()

A. greater common divisor

B. greatest common divisor

C. greatest common divior

D. none of above

Ans:b

**Question: 6**

If MSN then M mod

A. N<M/2

B. N>=M/2

C. N<=M/2

D. N>M/2

Ans:a

**Question: 7**

An online algorithm that runs in

A. binary search

B. fraction time

C. Buble search

D. linear search

Ans:d

**Question: 8**

In maximum subsequence, the input size is N=100,000 then O(N3)

A. 3.33

B. 86.67

C. NA

D. 0.03332

Ans:c

**Question: 9**

N power 2 symbol is

A. quadratic

B. cubic

C. linear

D. constant

Ans:a

**Question:10**

Log2N symbol is

A. logarithm

B. long-square

C. exponent

D. linear

Ans:a

**Question: 11**

Euclid algorithm is used for computing the.

A. The complexity of bubble sort

B. Time complexity

C. common divisor

D. the complexity of the binary search

Ans:c

**Question: 12**

The complexity of linear search algorithms.

A. C(n)

B. o(logn)

C. o(n2)

D. o (nlogn)

Ans:a

**Question: 13**

The complexity of the buble sort algorithm

A. O(n)

B. Olog(n)

C. O(n)

D. O(nlogn)

Ans:c

**Question: 14**

The complexity of merge sort algorithm

A. O(n)

B. O(log(n)

C. O(n2)

D. O(n log (n)

Ans:d

**Question: 15**

Which of the following case does not exist in complexity theory?

A. best case

B. worst case

C. average case

D. null case

Ans:d