(A) Linear
(B) Quadratic
(C) Exponential
(D) Logarithmic
Category: Fundamentals of Algorithms Mcqs
Fundamentals of Algorithms Mcqs for Screening tests, Interviews, Viva and Other competitive exams. Algorithms Mcqs section will help users to prepare mcqs of Computer Algorithms for various exams. Aspirants of Lecturer Computer Science, SST Computer Science, Subject Specialist Computer Science, Data Entry operator, Computer Programmer, Computer Operator, System administrator and all other Exams can prepare their Algorithms portion from here.
Need to synchronize data upon updation is called?
(A) Data Limitation
(B) Data Manipulation
(C) Data Coherence
(D) Data Replication
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)