Computer Science Algorithms & Data Structures

Question 1

What is the time complexity of binary search in a sorted array?

Accepted Answer

O(log n)

Answer

O(n)

Answer

O(n log n)

Answer

O(1)

Question 2

Which data structure is best suited for implementing a LIFO (Last In, First Out) order?

Accepted Answer

Stack

Answer

Queue

Answer

Heap

Answer

Linked List

Question 3

What is the primary advantage of using a hash table?

Accepted Answer

Allows fast data retrieval in O(1) time

Answer

Maintains sorted order of elements

Answer

Uses less memory than other structures

Answer

Best suited for sequential access

Question 4

Which sorting algorithm has the best average-case time complexity?

Accepted Answer

Merge Sort

Answer

Bubble Sort

Answer

Selection Sort

Answer

Insertion Sort

Question 5

What is the main advantage of using a linked list over an array?

Accepted Answer

Efficient insertions and deletions

Answer

Faster random access

Answer

Lower memory usage

Answer

Better sorting performance

Question 6

Which traversal method visits all nodes of a binary tree in ascending order?

Accepted Answer

In-order traversal

Answer

Pre-order traversal

Answer

Post-order traversal

Answer

Level-order traversal