Computer Science Test MCQs, Data Structures
The main measure of the efficiency of the algorithm
- Process and memory
- Time and space
- Date and space
- Complexity and capacity
Big-oh allows the possibility the growth rates are the
(a)different (b)Same (c)Greater (d)none of these
- T(N) is lower band on f(N)
(b) T(N) is upper bound on f(N)
(c) T(N) is Big-oh f(N)
(d) All of above.
Question : 5
Whish Symbol tell us logarithms grows very slowly.
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))
(a)greater common divisor
(b)greatest common divisor
(c)greatest common divior
(d)none of above
If MSN tnen M mod
An online algorithm that runs in
In maximum subsequence, the input size is N=100,000 then O(N3)
N power 2 symbol is
Log2N symbol is
Euclid algorithm is used for computing the.
- Complexity of bubble sort
(c) common divisor
(d) the complexity of binary search
The complexity of linear search algorithms.
The complexity of buble sort algorithm
The complexity of merge sort algorithm
- O(n log (n)
Which of the following case does not exist in complexity theory?