DSA (QUIZ 6) Hashing, Graphs, Advanced Graph Algorithms, and DP
Authored by Ma Gonzales
Information Technology (IT)
University
Used 3+ times
AI Actions
Add similar questions
Adjust reading levels
Convert to real-world scenario
Translate activity
More...
Content View
Student View
20 questions
Show all answers
1.
MULTIPLE CHOICE QUESTION
30 sec • 1 pt
What is the main advantage of using a hash table?
Data encryption
Data compression
Fast access to data
Sequential search
2.
MULTIPLE CHOICE QUESTION
30 sec • 1 pt
Which data structure is typically used to implement a hash table?
Stack
Array
Queue
Linked List
3.
MULTIPLE CHOICE QUESTION
30 sec • 1 pt
In a graph, what does a 'directed edge' imply?
Bi-directional connection
One-way connection
Weighted path
No connection
4.
MULTIPLE CHOICE QUESTION
30 sec • 1 pt
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
5.
MULTIPLE CHOICE QUESTION
30 sec • 1 pt
Which of the following is a property of dynamic programming?
Recursion without memory
Overlapping subproblems
Random selection
Loop unrolling
6.
MULTIPLE CHOICE QUESTION
30 sec • 1 pt
Which of the following is an example of a greedy algorithm?
Bellman-Ford
Knapsack (DP)
Dijkstra's
Floyd-Warshall
7.
MULTIPLE CHOICE QUESTION
30 sec • 1 pt
Which graph representation is more space-efficient for sparse graphs?
Adjacency matrix
Adjacency list
Incidence matrix
Edge list
Access all questions and much more by creating a free account
Create resources
Host any resource
Get auto-graded reports
Continue with Google
Continue with Email
Continue with Microsoft
or continue with
%20(1).png)
Apple
Others
Already have an account?
