(A) Data Limitation
(B) Data Manipulation
(C) Data Coherence
(D) Data Replication
Tag: Fundamentals of Computer Algorithms
The growth of master files and magnetic tapes exploded around the mid?
(A) 1960
(B) 1970
(C) 1980
(D) 1990
Node of a B- Tree is stored in memory block and Traversing a B-tree involves __ page faults.
(A) O (n^2)
(B) O (n)
(C) O (n log n)
(D) O (log n)
Continuation sort is suitable to sort the elements in range 1 to k?
(A) K is Large
(B) K is not known
(C) K may be small or large
(D) K is small
Quick sort is?
(A) Stable and In place
(B) Not stable but in place
(C) Stable and not in place
(D) Some time in place and snd some time stable
Which may be stable sort?
(A) Bubble sort
(B) Insertion sort
(C) Both of above
(D) None of these
Counting sort has time complexity?
(A) O(n)
(B) O(n+k)
(C) O(k)
(D) O(nlogn)
Which sorting algorithn is faster?
(A) O(n^2)
(B) O(nlogn)
(C) O(n+k)
(D) O(n^3)