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

Question 1

What property defines a binary search tree (BST)?

Accepted Answer

Left subtree values are smaller and right subtree values are larger than each node

Answer

Every node must have exactly two children

Answer

A sorted array is stored as a tree structure

Answer

Only leaf nodes contain data values

Question 2

What is dynamic programming?

Accepted Answer

An optimization technique solving problems by breaking them into overlapping subproblems and caching results

Answer

Programming that modifies itself at runtime

Answer

A programming paradigm like object-oriented design

Answer

Real-time data stream processing

Question 3

What is the time complexity of merge sort in all cases?

Accepted Answer

O(n log n)

Answer

O(n²)

Answer

O(log n)

Answer

O(n)

Question 4

What distinguishes breadth-first search (BFS) from depth-first search (DFS)?

Accepted Answer

BFS visits all neighbors at the current level before going deeper; DFS goes as deep as possible first

Answer

BFS visits nodes randomly; DFS visits them sorted

Answer

BFS only works on trees; DFS only works on graphs

Answer

BFS uses a stack; DFS uses a queue

Question 5

What is a linked list?

Accepted Answer

A linear data structure where each node contains data and a pointer to the next node

Answer

A dynamically resizing array

Answer

A hash table with sorted integer keys

Answer

A tree with exactly one root and one level

Question 6

What does Big O notation describe in algorithm analysis?

Accepted Answer

The upper bound of an algorithm's time or space complexity as input size grows

Answer

The quality score of production code

Answer

The number of known bugs in a codebase

Answer

The required network bandwidth for an application