Related Questions

The complexity of Binary search algorithm is ___
A O (n)
B O (log n)
C O (n2)
D O ( n log n )
The time complexity of binary search is :
A constant
B quardratic
C exponential
D logarithmic
Which one of the following is the tightest upper bound that represents the time complexity of inserting an object into a binary search tree of n nodes?
A O(1)
B O(long)
C O(n)
D O(long)
Fill in the blank : I am writing to request that Google----web search censorship based on point of view. An unidentified Google spokesman has indicated that google may alter its search algorithms so as to, in effect, censor the views of the so called climate.
A extant
B repudiate
C foible
D pertain
The complexity of Bubble sort algorithm is
A O(n)
B O (logn)
C O (n2)
D O (n log n)
The complex of Binary search alogrithm is___
A O(n)
B O(log n)
C O(n2)
D O (n log n)
Which of the following is false about a binary search tree?
A The left child is always lesser than its parent
B The right child is always greater than its parent
C The left and right sub-should also be binary search trees
D Either the left of the right sub- tree should be be binary search tree but not both.
A binary adder is a logic circuit that can add _____ binary numbers at a time.
A Hundreds
B Thousands
C One
D Two
E None of the above
Which of the following search algorithm requires less memory?
A Optimal Search
B Breadth -First Search
C Depth - First Search
D Linear Search
These essays are intellectually ........ and represent various levels of complexity.
A revealing
B modern
C superior
D demanding

Next steps