M

Mr. Dubey • 100.69K Points
Coach

Q. The complexity of linear search algorithm is____________.

  • (A) O(log n).
  • (B) O(n).
  • (C) O(n2).
  • (D) O(n log n).
Share

No solution found for this question.
Add Solution and get +2 points.

You must be Logged in to update hint/solution

Discusssion

Login to discuss.

Related MCQs

Q. Fedrick Winslow Taylor’s Mechanism of Scientific Management includes

Q. Given an array arr = {5,6,77,88,99} and key = 88; How many iterations are done until the element is found?

Q. To set page title dynamically in ASP.NET which of the following is used?

Q. Which one is functional component ?

Q. It shows the objects and object classes in a system and the relationship between these entities.

Q. Which of the following can be addressed by enforcing a referential integrity constraint?

Q. Which one is true for unconditional disk formatting?

Q. Consider the following two statements: P: Every regular grammar is LL(1) Q: Every regular set has a LR(1) grammar Which of the following is TRUE?

Q. TTL circuits with “totem-pole” output stage minimize

Q. Decision Nodes are represented by

Question analytics