What is the time complexity of binary search in a sorted array?
Answer: Option B
Binary search cuts the array in half at each step, giving O(log n) complexity.
1
Which data structure uses LIFO (Last In First Out) principle?
2
Which data structure is used for implementing recursion?
3
Which sorting algorithm has the best average-case time complexity?
4
In which traversal is a binary tree processed in left-root-right order?
| Data Structures & Algorithms MCQs | Computers and IT |
| Computer Fundamentals MCQ | Operating System MCQs |
| MS Word MCQs | MS Excel MCQs |
| C Programming MCQs | Database MCQs |
| Computer Networking MCQs |