Topic : Graph & Graph Traversal (Key Note and Questions)
Key Note:
- A Graph is a non-linear data structure that consist nodes and edges.
- Two nodes are connected with the help of single edge.
- Graph data structure can be represented using Adjacency Matrix and Adjacency List.
- BFS stands for Breadth First Search is a Graph traversal Algorithm.
- DFS stands for Depth First Search is also a Graph traversal algorithm.
Questions
- What is a graph? Describe various types of graph. Briefly explain few applications of graph.
- Discuss the various types of representation of graph.
- Write a note on graph traversal.
- Explain BFS graph traversal with example.
- Explain DFS graph traversal with example.
- Write the difference between BFS and DFS graph traversal.
Topic : Spanning Tree (Key Note and Questions)
Key Note:
- A spanning tree is a subset of any Graph G that contains all vertices minimum possible number of edges.
- Spanning tree does not have any cycle as well as it is not disconnected.
- Minimum spanning tree is a subset of graph that contains all vertices and the sum of edge weight that are connecting to vertices is minimum.
- Prim’s and Kruskal Algorithm is used to find minimum spanning tree.
Questions
- Write a note on spanning tree and minimum spanning tree.
- Write the Prim’s algorithm to find the minimal spanning tree.
- Write the Kruskal’s algorithm to find minimum spanning tree.
- Write and explain Dijkstra’s algorithm for finding shortest path.
- Write down Floyd Warshall’s algorithm for finding shortest path . Give example.
What did you think?
Similar Reads
-
Multiplications of Two variable polynomial
Polynomial multiplication is a common operation in algebra, used in areas such as scientific computing, engineering simulations, and symbolic algebra… -
Subtraction of Two-Variable Polynomial in C
Polynomials with two variables are common in engineering, graphics, and scientific computation. While addition is frequently discussed, subtraction is equally… -
Explain the Addition of Two variable polynomial
Polynomials are fundamental in mathematics, and their use extends into computer science, engineering, physics, and more. While single-variable polynomials are… -
Reverses the Doubly Circular Linked List
Algorithm to Reverse a Doubly Circular Linked List Check if the List is Empty or Has Only One Node: If… -
Algorithm and Program in C to traverse Doubly Circular Linked List
A doubly circular linked list is a special type of linked list in which every node is connected to both… -
Polynomial representation Using Array
Polynomials are fundamental mathematical expressions used extensively in various fields. Representing them efficiently in programming is crucial for calculations and… -
Multiplication of Single Variable Polynomial : Algorithm and Program
Multiplication of single-variable polynomials is a fundamental operation in polynomial algebra. The process involves multiplying each term of one polynomial… -
Subtraction of Single variable Polynomial : Algorithm and Program
Subtracting single-variable polynomials involves reducing each corresponding term of the polynomials from each other. This process is similar to addition,… -
Addition of Single variable Polynomial : Program and Algorithm
The addition of single-variable polynomials is a fundamental concept in algebra, often encountered in mathematics and computer science. Let's break… -
Polynomial Representation Using Linked List
Polynomial representation using linked lists is a critical concept in computer science and mathematics. In this guide, we explore how…