Table of Contents
- 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.
What did you think?
Similar Reads
-
Randomized Version of Quick Sort Explanations
The Randomized Version of the QuickSort algorithm is a variation of the normal QuickSort algorithm. In Randomized QuickSort, the pivot… -
Pseudocode of QuickSort with Its analysis
QuickSort algorithm uses the divide and conquers method to sort an Array. It contains a function that is used to… -
Pseudocode of Insertion sort with Time Complexity Analysis
Insertion Sort is a simple sorting algorithm that picks an element from the unsorted position and inserts it into its… -
Explain Recursion Tree in Algorithm with Example
A recursion tree visually represents the recursive calls made in a recursive algorithm. It helps to illustrate how the recursive… -
Divide and Conquer Recurrences with Examples
Divide and Conquer recurrences are mathematical equations. It describes the time complexity of divide-and-conquer algorithms. Divide and conquer is a… -
Optimality and Reduction Of Algorithm with Examples
Optimality and reduction are essential concepts in the design and analysis of an algorithm. They both play a crucial role… -
Complexity of an Algorithm: Time and Space Complexity
As we know that a by Designing an Algorithm, a problem can be solved. To perform some tasks based on… -
What is an algorithm? Explaination with an example
Algorithms can be defined as the set of instructions structured to solve a problem. It is a step-by-step procedure to… -
Characteristics of an algorithm with explanations
As we know that, algorithms provide us the procedure to solve any problem. Below are some characteristics that define a… -
What do you mean by an algorithm? Explain it with an example.
Algorithms can be defined as the set of instructions structuredto solve a problem. It is a step-by-step procedure to solve…