Skip to content

Latest commit

 

History

History
45 lines (39 loc) · 4 KB

README.md

File metadata and controls

45 lines (39 loc) · 4 KB

Design and Analysis of Algorithms[DAA]

Lab Assignment

Here is the solution of almost all the Questions given to us to solve as an assignment in COVID-19 Lockdown Situation.

Table of Cotents[TOC]:

Sl No. Questions
1. Sorting Techniques
1.1 Implement Quick Sort using first/last/any random element as pivot.
1.2 Implement the ascending and desending order using Quick Sort.
1.3 Implement Quick Sort with duplicate numbers in a given array/elements.
1.4 Finding kth minimum and maximum element in Heap.
1.5 Build Min heap, Max heap and sort the given elements.
1.6 Delete kth indexed element in Min heap and Max heap.
2 Greedy Algorithms
2.1. Implement the job sequencing with deadlines problem using the fixed tuple size formution.
2.2. Implement Knapsackroblem.
2.3. Implement the file or code compression using Huffman’s algorithm.
2.4. Implement the minimisation of records movement using Optimal Merge Pattern algorithm.
3. Graph Algorithms
3.1 Find Minimum Cost Spanning Tree of a given undirected graph using Kruskal’s algorithm.
3.2 Find Minimum Cost Spanning Tree of a given undirected graph using Prim’s algorithm.
4. Shortest Path Finding in Graph
4.1 From a given vertex in a weighted connected graph, find shortest paths to other vertices using Dijkstra’s algorithm.
4.2. Draw simple, connected weighted graph with 8 vertices and 16 edges, each with unique edge weight. Identify one vertex as a start vertex and obtain shortest path using Dijkstra’s algorithm.
4.3. Find the kth shortest path between two given nodes of a graph.
5. Dynamic Programming
5.1. Implement the Bottom Up Dynamic Programming Approach for matrix chain multiplication.
5.2 Implement the Top Down Dynamic Programming Memoization Approach for matrix chain multiplication.
5.3 Implement the Bottom Up Dynamic Programming Approach for longest common subsequence .

Want to contribute? Great!

Open your favorite Terminal and run these commands.

Go on:

Then add more files in the list

Todos

  • Write MORE Programs.
  • Increase the list of programs.

Already completed assignments, Hell Yeah!