Design and Analysis of Algorithms MCQs with Answers
Practice important Design and Analysis of Algorithms MCQs with answers and explanations.
Multiple Choice Questions
Q221: The solution to the fractional knapsack problem can be visualized as filling a knapsack with which of the following?
- A: Whole items only
- B: Fractions of items only
- C: Whole and fractional items
- D: Neither A nor B
View Answer
C
Q222: What is a graph primarily used to model?
- A: Static data
- B: Linear equations
- C: Connections between objects
- D: Complex algorithms
View Answer
C
Q223: In graph theory, what does a vertex represent?
- A: A connection between objects
- B: A set of edges
- C: A point of intersection
- D: An object in a graph
View Answer
C
Q224: What is the term for a graph without cycles?
- A: Acyclic graph
- B: Cyclic graph
- C: Directed graph
- D: Weighted graph
View Answer
A
Q225: In a directed graph, what is the out-degree of a vertex?
- A: The number of edges coming into the vertex
- B: The number of edges going out of the vertex
- C: The total number of edges
- D: The number of vertices connected to it
View Answer
B
Q226: How is an adjacency matrix defined?
- A: A binary tree structure
- B: A list of vertices
- C: A square matrix representing edges between vertices
- D: A collection of edges
View Answer
C
Q227: What does an adjacency list contain?
- A: A list of all vertices in the graph
- B: An array of edges for each vertex
- C: A matrix of vertex connections
- D: A list of weights for each edge
View Answer
B
Q228: In a connected graph, what can be said about the vertices?
- A: Some vertices cannot be reached from others
- B: All vertices can reach every other vertex
- C: Only one vertex is reachable from any other vertex
- D: All vertices have the same degree
View Answer
B
Q229: Which traversal algorithm uses a queue for implementation?
- A: Depth-first search
- B: Breadth-first search
- C: Graph traversal
- D: Topological sort
View Answer
B
Q230: What is the purpose of the predecessor pointer in shortest path algorithms?
- A: To keep track of the longest path
- B: To store the distance to each vertex
- C: To trace back the shortest path
- D: To store unvisited vertices
View Answer
C