# Quiz Part III: Advanced Algorithmic Techniques and Network Structures

## Questions of Quiz Part III: Advanced Algorithmic Techniques and Network Structures

**1. What is a key characteristic of a problem that makes it suitable for a Greedy algorithm?**

- a) Overlapping subproblems
- b) Optimal substructure
- c) Non-overlapping subproblems
- d) Local optima leading to a global optimum

**2. In Dynamic Programming, what is the difference between the 'top-down' and 'bottom-up' approaches?**

- a) Top-down uses iteration, while bottom-up uses recursion.
- b) Top-down starts with subproblems, while bottom-up starts with the main problem.
- c) Top-down uses memoization, while bottom-up uses tabulation.
- d) There is no significant difference.

**3. What is the primary use of Dijkstra's algorithm?**

- a) To find the shortest path in a graph with negative edge weights.
- b) To find the minimum spanning tree in a graph.
- c) To find the shortest path from a single source to all other nodes in a weighted graph.
- d) To detect cycles in a graph.

**4. Which algorithm is commonly used for detecting strongly connected components in a directed graph?**

- a) Kruskal’s Algorithm
- b) Floyd-Warshall Algorithm
- c) Tarjan’s Algorithm
- d) Prim’s Algorithm

**5. In graph theory, what is a 'bridge'?**

- a) A path that connects two nodes.
- b) An edge whose removal increases the number of connected components.
- c) The shortest path between two nodes.
- d) An edge with the maximum weight.

**6. What does the Ford-Fulkerson algorithm calculate?**

- a) The shortest path in a graph.
- b) The maximum flow in a flow network.
- c) The minimum spanning tree.
- d) The number of connected components.

**7. What is 'backtracking' in the context of algorithm design?**

- a) A technique for finding the least-cost path in a graph.
- b) A strategy for exploring all possibilities systematically and abandoning a path if it leads to a dead end.
- c) Reducing the problem size by dividing it into smaller subproblems.
- d) Revisiting previous steps to find alternative solutions.

**8. Which statement is true about Floyd-Warshall algorithm?**

- a) It finds the shortest path between all pairs of nodes in a weighted graph.
- b) It is used for sorting nodes in a graph.
- c) It can only be used in unweighted graphs.
- d) It is a greedy algorithm for finding shortest paths.

## Questions of Quiz Part III: Advanced Algorithmic Techniques and Network Structures

**1. What is a key characteristic of a problem that makes it suitable for a Greedy algorithm?**

- a) Overlapping subproblems
- b) Optimal substructure
- c) Non-overlapping subproblems
- d) Local optima leading to a global optimum

**2. In Dynamic Programming, what is the difference between the 'top-down' and 'bottom-up' approaches?**

- a) Top-down uses iteration, while bottom-up uses recursion.
- b) Top-down starts with subproblems, while bottom-up starts with the main problem.
- c) Top-down uses memoization, while bottom-up uses tabulation.
- d) There is no significant difference.

**3. What is the primary use of Dijkstra's algorithm?**

- a) To find the shortest path in a graph with negative edge weights.
- b) To find the minimum spanning tree in a graph.
- c) To find the shortest path from a single source to all other nodes in a weighted graph.
- d) To detect cycles in a graph.

**4. Which algorithm is commonly used for detecting strongly connected components in a directed graph?**

- a) Kruskal’s Algorithm
- b) Floyd-Warshall Algorithm
- c) Tarjan’s Algorithm
- d) Prim’s Algorithm

**5. In graph theory, what is a 'bridge'?**

- a) A path that connects two nodes.
- b) An edge whose removal increases the number of connected components.
- c) The shortest path between two nodes.
- d) An edge with the maximum weight.

**6. What does the Ford-Fulkerson algorithm calculate?**

- a) The shortest path in a graph.
- b) The maximum flow in a flow network.
- c) The minimum spanning tree.
- d) The number of connected components.

**7. What is 'backtracking' in the context of algorithm design?**

- a) A technique for finding the least-cost path in a graph.
- b) A strategy for exploring all possibilities systematically and abandoning a path if it leads to a dead end.
- c) Reducing the problem size by dividing it into smaller subproblems.
- d) Revisiting previous steps to find alternative solutions.

**8. Which statement is true about Floyd-Warshall algorithm?**

- a) It finds the shortest path between all pairs of nodes in a weighted graph.
- b) It is used for sorting nodes in a graph.
- c) It can only be used in unweighted graphs.
- d) It is a greedy algorithm for finding shortest paths.

## Questions of Quiz Part III: Advanced Algorithmic Techniques and Network Structures

**1. What is a key characteristic of a problem that makes it suitable for a Greedy algorithm?**

- a) Overlapping subproblems
- b) Optimal substructure
- c) Non-overlapping subproblems
- d) Local optima leading to a global optimum

**2. In Dynamic Programming, what is the difference between the 'top-down' and 'bottom-up' approaches?**

- a) Top-down uses iteration, while bottom-up uses recursion.
- b) Top-down starts with subproblems, while bottom-up starts with the main problem.
- c) Top-down uses memoization, while bottom-up uses tabulation.
- d) There is no significant difference.

**3. What is the primary use of Dijkstra's algorithm?**

- a) To find the shortest path in a graph with negative edge weights.
- b) To find the minimum spanning tree in a graph.
- c) To find the shortest path from a single source to all other nodes in a weighted graph.
- d) To detect cycles in a graph.

**4. Which algorithm is commonly used for detecting strongly connected components in a directed graph?**

- a) Kruskal’s Algorithm
- b) Floyd-Warshall Algorithm
- c) Tarjan’s Algorithm
- d) Prim’s Algorithm

**5. In graph theory, what is a 'bridge'?**

- a) A path that connects two nodes.
- b) An edge whose removal increases the number of connected components.
- c) The shortest path between two nodes.
- d) An edge with the maximum weight.

**6. What does the Ford-Fulkerson algorithm calculate?**

- a) The shortest path in a graph.
- b) The maximum flow in a flow network.
- c) The minimum spanning tree.
- d) The number of connected components.

**7. What is 'backtracking' in the context of algorithm design?**

- a) A technique for finding the least-cost path in a graph.
- b) A strategy for exploring all possibilities systematically and abandoning a path if it leads to a dead end.
- c) Reducing the problem size by dividing it into smaller subproblems.
- d) Revisiting previous steps to find alternative solutions.

**8. Which statement is true about Floyd-Warshall algorithm?**

- a) It finds the shortest path between all pairs of nodes in a weighted graph.
- b) It is used for sorting nodes in a graph.
- c) It can only be used in unweighted graphs.
- d) It is a greedy algorithm for finding shortest paths.

## Questions of Quiz Part III: Advanced Algorithmic Techniques and Network Structures

**1. What is a key characteristic of a problem that makes it suitable for a Greedy algorithm?**

- a) Overlapping subproblems
- b) Optimal substructure
- c) Non-overlapping subproblems
- d) Local optima leading to a global optimum

**2. In Dynamic Programming, what is the difference between the 'top-down' and 'bottom-up' approaches?**

- a) Top-down uses iteration, while bottom-up uses recursion.
- b) Top-down starts with subproblems, while bottom-up starts with the main problem.
- c) Top-down uses memoization, while bottom-up uses tabulation.
- d) There is no significant difference.

**3. What is the primary use of Dijkstra's algorithm?**

- a) To find the shortest path in a graph with negative edge weights.
- b) To find the minimum spanning tree in a graph.
- c) To find the shortest path from a single source to all other nodes in a weighted graph.
- d) To detect cycles in a graph.

**4. Which algorithm is commonly used for detecting strongly connected components in a directed graph?**

- a) Kruskal’s Algorithm
- b) Floyd-Warshall Algorithm
- c) Tarjan’s Algorithm
- d) Prim’s Algorithm

**5. In graph theory, what is a 'bridge'?**

- a) A path that connects two nodes.
- b) An edge whose removal increases the number of connected components.
- c) The shortest path between two nodes.
- d) An edge with the maximum weight.

**6. What does the Ford-Fulkerson algorithm calculate?**

- a) The shortest path in a graph.
- b) The maximum flow in a flow network.
- c) The minimum spanning tree.
- d) The number of connected components.

**7. What is 'backtracking' in the context of algorithm design?**

- a) A technique for finding the least-cost path in a graph.
- c) Reducing the problem size by dividing it into smaller subproblems.
- d) Revisiting previous steps to find alternative solutions.

**8. Which statement is true about Floyd-Warshall algorithm?**

- a) It finds the shortest path between all pairs of nodes in a weighted graph.
- b) It is used for sorting nodes in a graph.
- c) It can only be used in unweighted graphs.
- d) It is a greedy algorithm for finding shortest paths.