Download PDF
Free download pdf of Data Structures and Algorithms Multiple Choice Questions and Answers for papers of graduate and post-graduate examinations in Computer Science & Engineering Branch.
(21)
The complexity of linear search algorithm is
[A]
O(n)
[B]
O(log n)
[C]
O(n2)
[D]
O(n log n)
Comment
(22)
The complexity of Binary search algorithm is
[A]
O(n)
[B]
O(log n)
[C]
O(n2)
[D]
O(n log n)
Comment
(23)
The complexity of Bubble sort algorithm is
[A]
O(n)
[B]
O(log n)
[C]
O(n2)
[D]
O(n log n)
Comment
(24)
The complexity of merge sort algorithm is
[A]
O(n)
[B]
O(log n)
[C]
O(n2)
[D]
O(n log n)
Comment
(25)
The space factor when determining the efficiency of algorithm is measured by
[A]
Counting the maximum memory needed by the algorithm
[B]
Counting the minimum memory needed by the algorithm
[C]
Counting the average memory needed by the algorithm
[D]
Counting the maximum disk space needed by the algorithm
Comment
(26)
The operation of processing each element in the list is known as
[A]
Traversal
[B]
Inserting
[C]
Merging
[D]
Sorting
Comment
(27)
Binary trees with threads are called as.......
[A]
Special trees
[B]
Pointer trees
[C]
Threaded trees
[D]
None of the above
Comment
(28)
In Binary trees nodes with no successor are called......
[A]
End nodes
[B]
Final nodes
[C]
Last nodes
[D]
Terminal nodes
Comment
(29)
The depth of a complete binary tree is given by
[A]
Dn = n log2n
[B]
Dn = n log2n+1
[C]
Dn = log2n
[D]
Dn = log2n+1
Comment
(30)
Every node N in a binary tree T except the root has a unique parent called the ......... of N.
[A]
Predecessor
[B]
Antecedents
[C]
Precursor
[D]
None of the above
Comment
Please share this page