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

Question 1

What is Dijkstra's algorithm used for?

Accepted Answer

Finding the shortest path from a source to all nodes in a weighted graph

Answer

Sorting arrays in ascending order

Answer

Searching for values in binary trees

Answer

Lossless data compression

Question 2

What is a heap data structure?

Accepted Answer

A complete binary tree satisfying the heap property where each parent is greater or smaller than its children

Answer

Unstructured dynamic memory

Answer

A sorted doubly linked list

Answer

A hash table with priority-based ordering

Question 3

What is the space complexity of recursive DFS on a graph with n nodes?

Accepted Answer

O(n)

Answer

O(1)

Answer

O(log n)

Answer

O(n²)

Question 4

How does random access time differ between an array and a linked list?

Accepted Answer

Array supports O(1) random access; linked list requires O(n) traversal

Answer

Both support O(1) random access by index

Answer

Array requires O(n) traversal; linked list supports O(1) access

Answer

Both require O(log n) for random access

Question 5

What is memoization in algorithm design?

Accepted Answer

Caching the results of function calls to avoid redundant computation on repeated inputs

Answer

Writing inline code documentation and comments

Answer

A specific memory allocation strategy for performance

Answer

A debugging technique for tracing variable values

Question 6

What is the average-case time complexity of hash table insertion with a good hash function?

Accepted Answer

O(1)

Answer

O(n²)

Answer

O(n log n)

Answer

O(n)