Skip to content
- What do you mean by Graph Theory? Explain.
- Write a note on Graph and Digraph.
- Explain various data structure for Graphs.
- Write a note on Breadth First Search(BFS).What type of problem i can solve using BFS.
- Write a note on Depth First Search(DFS).What type of problem i can solve using DFS.
- Write a note on Bipartite Graph.
- Explain Topological Sort.
- Discuss Strongly Connected Components with its algorithm.
- What do you mean by Minimum Spanning Tree? Explain.
- Discuss Kruskal’s Algorithm to find MST with example and also find its analysis.
- Discuss Prim’s Algorithm to find MST with example and also find its analysis.
- Explain Bellman-Ford Algorithm and give its analysis.
- Suppose that undirected graph G=(V,E) has non-negative edge weights and these are raised by 1. Can the minimum spanning tree changes? Can shortest paths changes? Justify with proper example.
- Explain the greedy approach of algorithm.
- Write the characteristics and structure of Greedy Algorithm.
- Explain the Activity Selection Problem and give its solution by using Greedy approach with its analysis and correctness.
- What do you mean by “Greedy Algorithm”? Write its pseudo code and prove that the fractional knapsack problem has a greedy-choice property.
- What is 0/1 knapsack problem? Does greedy method effective to solve the 0/1 knapsack problem?
- Explain the Huffman Codes with examples.
- Explain the travelling salesman problem.
- What do you mean by Flow? Write Ford Fulkerson algorithm to find maximum flow in a network.
- Write an algorithm to find the minimum and maximum elements simultaneously from a given list of elements. you are also required to discuss its running time.