Scribd
Upload
91 views4 pages

DAA Unit 4 Analysis

The document provides sample questions that could be asked about graphs and algorithms related to graphs, including: - Differences between trees and graphs, depth-first search and breadth-first search - Algorithms for shortest path problems - Dijkstra's algorithm, Floyd-Warshall algorithm, and Warshall's algorithm - Real-world applications of Dijkstra's algorithm - Time complexity and pseudocode for these algorithms - Previous year questions related to all-pairs shortest path, transitive closure, minimum spanning trees, maximum flow, topological sorting, and other graph algorithms.

Uploaded by

kushalmadappa18
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
91 views4 pages

DAA Unit 4 Analysis

The document provides sample questions that could be asked about graphs and algorithms related to graphs, including: - Differences between trees and graphs, depth-first search and breadth-first search - Algorithms for shortest path problems - Dijkstra's algorithm, Floyd-Warshall algorithm, and Warshall's algorithm - Real-world applications of Dijkstra's algorithm - Time complexity and pseudocode for these algorithms - Previous year questions related to all-pairs shortest path, transitive closure, minimum spanning trees, maximum flow, topological sorting, and other graph algorithms.

Uploaded by

kushalmadappa18
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
You are on page 1/ 4

DAA Unit 4 Analysis

(Format similar to Internals 1)

Questions type given by ma’am :


1. Difference between Tree and Graph.
2. Difference between DFS and BFS.
3. Write algorithm and illustrate using an example.
(i) Dijkstra’s Algortithm  Single source shortest path
(ii) Floyd – Warshall Algorithm  All pair shortest path
(iii) Warshall Algorithm  Transitive closure
4. Take real world application and explain Dijkstra’s using an example.

2M questions:
1. State the time complexity.
2. Write Pseudocodes.
3. What is the application of ..?

PYQ:
1. (i) Write the algorithm for solving all pair shortest path (Floyd – Warshall)
(ii) Solve the graph whose weighted matrix is given below

2. (i) Write Warshall's algorithm for finding transitive closure of a directed graph.
(ii) Find the transitive closure for the graph.
- - 3. (i) Define Minimum Spanning Tree.
(ii) List the properties of spanning tree.
(iii) Provide the algorithms for Krushkal's .
(iv) Identify the minimum spanning tree for graph in Figure using Krushkal's

(v) Compute the minimum spanning tree for the given Graph using Prim's and Krushkal’s
algorithm.

4. (i) Write Ford-Fulkerson algorithm for finding max flow in the network.
(ii) What is the Time complexity of Ford-Fulkerson algorithm.
(iii) Find maximum flow for the graph given in the Figure,mention the algorithmic technique used

5. Define topological sorting. Apply DFS for graph to solve topological sorting.
(Graph not found)
6. Design an algorithm for DFS traversal methods.Comment on it’s efficiency.Apply the same for the
given graph.

7. Calculate the shortest distance and shortest path from vertex 5 to vertex 0 using Dijkstra’s
algorithm.

8. Design and describe an algorithm to calculate the maximum flow through a tree,with a specific
root as a source and any one leaves a valid sink.
Solve the problem using the same.

Out of syllabus :

1. Explain the algorithm for finding the shortest paths from the source to all vertices in the given
graph with negative weight edge. Considering 'A' as the source vertex find the distance to all
vertices for graph
2. Develop an algorithm for solving the instance of the sum of subsets problem using dynamic
programming technique. Apply the same for the following S={3,5,6,7} and amount = 15.

3. Hamiltonian circuits.

You might also like