The complexity of Binary search algorithm is ___

A O (n)
B O (log n)
C O (n2)
D O ( n log n )

Correct Answer: O (log n)

Binary search runs in at worst logarithmic time, making O ( log n) comparison , where n is the number of elements in the array, the O is Big O notation, and log is the logarithm .
Bissoy MCQ
#তথ্য প্রযুক্তি #Combined Bank (সমন্বিত ব্যাংক) #অ্যালগরিদম (Algorithm) #BD Development Bank Ltd - 30.11.2018 #BD Krishi #Janata #Senior Officer (IT) - Sonali

Related Questions

There are blank spaces in the following passage which have been numbered . These numbers are printed below the passage and against each some words are suggested . Find out the word that best fit the blank spaces. Global Strategies to control infective disease have historically included the erection of barriers to international travel and ___ (24) _______. Keeping people with such deadly disease outside national borders has ___ (25) _______ as an important public health policy in the human immunodeficiency virus (HIV) epidemic . Betwwn 29 and 50 countries ___ (26) _____ to have introduced border restrictions on HIV _ positive foreigners ,usually those planning an ___ (27) ___ stay in the country , such as students , workers or seamen.
A migration
B immigrate
C emigration
D immigration
The complexity of Binary search algorithm is ---
A O(n)
B O(log n)
C On(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

Next steps