Analysis and Design of Algorithm - 1BM22CS135

LABORATORY PROGRAM-1 (Leetcode Problems)

A. Min Stack.

Design a stack that supports push, pop, top, and retrieving the minimum element in constant time.

B. Design Circular Deque

Design your implementation of the circular double-ended queue (deque).

LABORATORY PROGRAM-4

Write program to obtain the Topological ordering of vertices in a given digraph.

LABORATORY PROGRAM-5

Implement Johnson Trotter algorithm to generate permutations.

LABORATORY PROGRAM-6

Sort a given set of N integer elements using Merge Sort technique and compute its time taken. Run the program for different values of N and record the time taken to sort.

LABORATORY PROGRAM-7

Sort a given set of N integer elements using Quick Sort technique and compute its time taken.

LABORATORY PROGRAM-8

Sort a given set of N integer elements using Heap Sort technique and compute its time taken.

LABORATORY PROGRAM-9

Implement 0/1 Knapsack problem using dynamic programming.

LABORATORY PROGRAM-10(A)

Implement All Pair Shortest paths problem using Floyd’s algorithm.

LABORATORY PROGRAM-10(B)

Implement Warshall’s algorithm.

LABORATORY PROGRAM-11(A)

Find Minimum Cost Spanning Tree of a given undirected graph using Prim’s algorithm.

LABORATORY PROGRAM-11(B)

Find Minimum Cost Spanning Tree of a given undirected graph using Kruskal’s algorithm.

LABORATORY PROGRAM-12

Implement fractional Knapsack problem using Greedy technique.

LABORATORY PROGRAM-13

From a given vertex in a weighted connected graph, find shortest paths to other vertices using Dijkstra’s algorithm.