B.S.W.E. Bachelor of Software Engineering Algorithms & Data Structures

Question 1

What is the time complexity of binary search?

Accepted Answer

O(log n)

Answer

O(n)

Answer

O(n²)

Answer

O(1)

Question 2

What data structure uses LIFO (Last In, First Out) ordering?

Accepted Answer

Stack

Answer

Queue

Answer

Linked List

Answer

Binary Tree

Question 3

What is the time complexity of inserting an element at the beginning of an array?

Accepted Answer

O(n)

Answer

O(1)

Answer

O(log n)

Answer

O(n²)

Question 4

What is a hash table?

Accepted Answer

A data structure using a hash function to map keys to array indices for fast lookup

Answer

A sorted array of key-value pairs

Answer

A binary tree sorted by key values

Answer

A linked list with index-based access

Question 5

What is the fundamental difference between a stack and a queue?

Accepted Answer

Stacks use LIFO ordering; queues use FIFO ordering for element removal

Answer

Stacks have slower performance than queues

Answer

Stacks store numbers; queues store strings

Answer

Stacks are implemented as arrays; queues as linked lists

Question 6

What is the worst-case time complexity of quicksort?

Accepted Answer

O(n²)

Answer

O(n log n)

Answer

O(n)

Answer

O(log n)