📊 Data Structure (DS)
Q. The complexity of linear search algorithm is____________.
  • (A) O(log n).
  • (B) O(n).
  • (C) O(n2).
  • (D) O(n log n).
💬 Discuss
✅ Correct Answer: (B) O(n).

You must be Logged in to update hint/solution

💬 Discussion

Related MCQs

Q. A chronological record of relevant details about the execution of tests is called as, a _______

Q. The main advantage of the object-relational data model arises from the concept of “_____________.”

Q. Relationships could be of the following type:

Q. A machine learning problem involves four attributes plus a class. The attributes have 3, 2, 2, and 2 possible values each. The class has 3 possible va

Q. Which of the following has each related entity set has its own schema and there is an additional schema for the relationship set.

Q. The explanatory parts of the UML model are known as ________

Q. RTP can use

Q. What are the worst case and average case complexities of a binary search tree?

Q. The method of connecting a driving device to a loading device is known as

Q. If a process is executing in its critical section, then no other processes can be executing in their critical section. This condition is called ______

📊 Question Analytics

👁️
980
Total Visits
📽️
3 y ago
Published
🎖️
Mr. Dubey
Publisher
📈
92%
Success Rate