# Data Structures & Algorithms

## Graph Coloring MCQ [Free PDF] – Objective Question Answer for Graph Coloring Quiz

Graph Coloring MCQ   1. Which of the following is not a type of graph in computer science? a) undirected graph b) bar graph c) directed graph d) weighted graph Answer: b According to graph theory, a graph is a collection of dots and lines. A bar graph is not a type of graph in …

## Shortest Path Algorithms MCQ [Free PDF] – Objective Question Answer for Shortest Path Algorithms Quiz

Shortest Path Algorithms MCQ   1. Dijkstra’s Algorithm is used to solve _________ problems. a) All pair’s shortest path b) Single source shortest path c) Network flow d) Sorting Answer: b Dijkstra’s Algorithm is used for solving single source shortest path problems. In this algorithm, a single node is fixed as a source node and …

## Minimum Spanning Tree MCQ [Free PDF] – Objective Question Answer for Minimum Spanning Tree Quiz

Minimum Spanning Tree MCQ   1. Which of the following is false in the case of a spanning tree of graph G? a) It is a tree that spans G b) It is a subgraph of the G c) It includes every vertex of the G d) It can be either cyclic or acyclic Answer: …

## Graph Data Structure MCQ [Free PDF] – Objective Question Answer for Graph Data Structure Quiz

Graph Data Structure MCQ   1. Depth First Search is equivalent to which of the traversal in the Binary Trees? a) Pre-order Traversal b) Post-order Traversal c) Level-order Traversal d) In-order Traversal Answer: a In-Depth First Search, we explore all the nodes aggressively to one path and then backtrack to the node. Hence, it is …

## Computational Geometry and Data Structure MCQ [Free PDF] – Objective Question Answer for Computational Geometry and Data Structure Quiz

Computational Geometry and Data Structure MCQ   1. The shortest distance between a line and a point is achieved when? a) a line is drawn at 90 degrees to the given line from the given point b) a line is drawn at 180 degrees to the given line from the given point c) a line …

## String Matching Algorithm MCQ [Free PDF] – Objective Question Answer for String Matching Algorithm Quiz

String Matching Algorithm MCQ   1. What is a Rabin and Karp Algorithm? a) String Matching Algorithm b) Shortest Path Algorithm c) Minimum spanning tree Algorithm d) Approximation Algorithm Answer: a The string matching algorithm which was proposed by Rabin and Karp generalizes to other algorithms and for two-dimensional pattern matching problems.   2. What …

## Data Structures Network Flow MCQ [Free PDF] – Objective Question Answer for Data Structures Network Flow Quiz

Data Structures Network Flow MCQ   1. What does the Maximum flow problem involve? a) finding a flow between the source and sink that is maximum b) finding a flow between the source and sink that is minimum c) finding the shortest path between source and sink d) computing a minimum spanning tree Answer: a …

## Data Structures Pattern Matching Algorithms MCQ [Free PDF]

Data Structures Pattern Matching Algorithms MCQ   1. Stable marriage problem is an example of? a) Branch and bound algorithm b) Backtracking algorithm c) Greedy algorithm d) Divide and conquer algorithm Answer: b The stable marriage problem is an example of a recursive algorithm because it recursively uses a backtracking algorithm to find an optimal …

## Minimum Cut MCQ [Free PDF] – Objective Question Answer for Minimum Cut Quiz

Minimum Cut MCQ   1. Which algorithm is used to solve a minimum cut algorithm? a) Gale-Shapley algorithm b) Ford-Fulkerson algorithm c) Stoer-Wagner algorithm d) Prim’s algorithm Answer: c The minimum cut algorithm is solved using the Stoer-Wagner algorithm. The maximum flow problem is solved using the Ford-Fulkerson algorithm. The stable marriage problem is solved …

## Bipartite Graphs MCQ [Free PDF] – Objective Question Answer for Bipartite Graphs Quiz

Bipartite Graphs MCQ   1. The maximum number of edges in a bipartite graph on 14 vertices is ___________ a) 56 b) 14 c) 49 d) 87 Answer: c A maximum number of edges occurs in a complete bipartite graph when every vertex has an edge to every opposite vertex in the graph. A number …

Scroll to Top