# Computer Science Test MCQs, Data Structures

Last modified on May 26th, 2018 at 1:48 pm

**Computer Science Test MCQs, Data Structures**

**Set 3**

Question:1

The main measure of the efficiency of the algorithm

- Process and memory
**Time and space**- Date and space
- Complexity and capacity

Ans:b

Question:3

Big-oh allows the possibility the growth rates are the

(a)different ** (b)Same** (c)Greater (d)none of these

Ans:b

Question : 5

Whish Symbol tell us logarithms grows very slowly.

**logkN=O(N)**- Log(N)
- Log2(N)
- Nlog(N)

Ans:a

Question : 6

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

- f (N)= o(g(N))
- f ( N)+o(g(N))
**G(N)=o(f))**

Ans: c

Question:9

Gcf()

(a)greater common divisor

**(b)greatest common divisor**

(c)greatest common divior

(d)none of above

Ans:b

Question:10

If MSN tnen M mod

(a)N<M/2

(b)N>=M/2

(c)N<=M/2

(d)N>M/2

Ans:a

[quads id=2]Question:11

An online algorithm that runs in

(a)binary search

(b)fraction time

(c)buble search

(d)linear search

Ans:d

Question:12

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:13

N power 2 symbol is

(a)quadratic

(b)cubic

(c)linear

(d)constant

Ans:a

Question:14

Log2N symbol is

(a)logarithm

(b)long-square

(c)exponent

(d)linear

Ans:a

Question: 16

Euclid algorithm is used for computing the.

- Complexity of bubble sort

(b)Time complexity

(c) common divisor

(d) the complexity of binary search

Ans:c

Question: 17

The complexity of linear search algorithms.

- C(n)

(b)o(logn)

(c)o(n2)

(d)o (nlogn)

Ans:a

Question: 18

The complexity of buble sort algorithm

- O(n)
- Olog(n)
- O(n)
- O(nlogn)

Ans:c

Question: 19

The complexity of merge sort algorithm

- O(n)
- O(log(n)
- O(n2)
- O(n log (n)

Ans:d

Question: 20

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