DSA (QUIZ 6) Hashing, Graphs, Advanced Graph Algorithms, and DP

What is the main advantage of using a hash table?

• Data encryption

• Data compression

• Fast access to data

• Sequential search

Which data structure is typically used to implement a hash table?

• Stack

• Array

• Queue

• Linked List

In a graph, what does a 'directed edge' imply?

• Bi-directional connection

• One-way connection

• Weighted path

• No connection

Which graph algorithm is used to find the shortest path from a source to all other vertices in a graph with positive weights?

• Prim's

• Dijkstra's

• Kruskal's

• Topological Sort

Which of the following is a property of dynamic programming?

• Recursion without memory

• Overlapping subproblems

• Random selection

• Loop unrolling

Which of the following is an example of a greedy algorithm?

• Bellman-Ford

• Knapsack (DP)

• Dijkstra's

• Floyd-Warshall

Which graph representation is more space-efficient for sparse graphs?

• Adjacency matrix

• Adjacency list

• Incidence matrix

• Edge list

What does the hash function do?

• Deletes duplicates

• Translates keys into indexes

• Randomly shuffles data

• Encrypts values

Which algorithm is commonly used to schedule tasks with dependencies?

• DFS

• Kruskal's

• Topological Sort

• BFS

Which is not true about Dynamic Programming?

• Solves problems optimally

• Uses memoization

• Only works on graphs

• Avoids recomputation