(A) O (n log n)
(B) O (n^2)
(C) O (n+k)
(D) O (n^3)
Tag: Fundamentals of Algorithms Mcqs
The appropriate big thita classification of the given function. f(n) = 4n2 + 97n + 1000 is?
(A) ?(n)
(B) O(2^n)
(C) O(n^2)
(D) O(n^2logn)
Let us say we have an algorithm that carries out N^2 operations for an input of size N. Let us say that a computer takes 1 microsecond (1/1000000 second) to carry out one operation. How long does the algorithm run for an input of size 3000?
(A) 90 seconds
(B) 9 seconds
(C) 0.9 seconds
(D) 0.09 seconds
Function is given like 4n^4+ 5n^3+n what is the run time of this?
(A) theata(n^4)
(B) theata(n^3)
(C) theata(4n^4+ 5n^3)
(D) theata(4n^4+ 5n^3)
What will be the total number of max comparisons if we run brute-force maxima algorithm with n elements?
(A) n^2
(B) n^n/2
(C) n
(D) n^8
__ is a graphical representation of an algorithm.
(A) Segma Notation
(B) Thita Notation
(C) Flowchart
(D) Asymptotic notation
It is called Heapify. (In other books it is sometimes called sifting down.)?
(A) True
(B) False
(C) NA
(D) NA
There is one principal operation for maintaining the heap property?
(A) Heapify Procedure
(B) Heapify Program
(C) Heapify Routine
(D) none