https://github.com/starmanfrommars/analysis-design-of-algorithms-lab

All ADA lab programs.
https://github.com/starmanfrommars/analysis-design-of-algorithms-lab

Last synced: about 1 month ago
JSON representation

All ADA lab programs.

• Host: GitHub
• URL: https://github.com/starmanfrommars/analysis-design-of-algorithms-lab
• Owner: starmanfrommars
• Created: 2024-07-03T02:04:01.000Z (7 months ago)
• Default Branch: main
• Last Pushed: 2024-08-10T17:16:41.000Z (5 months ago)
• Last Synced: 2024-08-10T18:31:58.456Z (5 months ago)
• Language: C
• Size: 9.77 KB
• Stars: 1
• Watchers: 1
• Forks: 1
• Open Issues: 0
• Metadata Files:
  • Readme: README.md

Awesome Lists containing this project

README

        
# ANALYSIS & DESIGN OF ALGORITHMS LAB 

- Course Code : BCSL404

- Credits : 1

## Course objectives:

* To design and implement various algorithms in C/C++ programming using suitable development tools to address different computational challenges.

* To apply diverse design strategies for effective problem-solving.

* To Measure and compare the performance of different algorithms to determine their efficiency and suitability

for specific tasks.

## Lab Experiments

1. Design and implement C/C++ Program to find Minimum Cost Spanning Tree of a given connected

undirected graph using Kruskal's algorithm.

2. Design and implement C/C++ Program to find Minimum Cost Spanning Tree of a given connected

undirected graph using Prim's algorithm.

3. a. Design and implement C/C++ Program to solve All-Pairs Shortest Paths problem using Floyd's

algorithm.

b. Design and implement C/C++ Program to find the transitive closure using Warshal's

algorithm.

4. Design and implement C/C++ Program to find shortest paths from a given vertex in a weighted

connected graph to other vertices using Dijkstra's algorithm.

5. Design and implement C/C++ Program to obtain the Topological ordering of vertices in a given

digraph.

6. Design and implement C/C++ Program to solve 0/1 Knapsack problem using Dynamic

Programming method.

7. Design and implement C/C++ Program to solve discrete Knapsack and continuous Knapsack

problems using greedy approximation method.

8. Design and implement C/C++ Program to find a subset of a given set S = {sl , s2,.....,sn} of n

positive integers whose sum is equal to a given positive integer d.

9. Design and implement C/C++ Program to sort a given set of n integer elements using Selection

Sort method and compute its time complexity. Run the program for varied values of n> 5000 and

record the time taken to sort. Plot a graph of the time taken versus n. The elements can be read

from a file or can be generated using the random number generator.

10. Design and implement C/C++ Program to sort a given set of n integer elements using Quick Sort

method and compute its time complexity. Run the program for varied values of n> 5000 and

record the time taken to sort. Plot a graph of the time taken versus n. The elements can be read

from a file or can be generated using the random number generator.

11. Design and implement C/C++ Program to sort a given set of n integer elements using Merge Sort

method and compute its time complexity. Run the program for varied values of n> 5000, and

record the time taken to sort. Plot a graph of the time taken versus n. The elements can be read

from a file or can be generated using the random number generator.

12. Design and implement C/C++ Program for N Queen's problem using Backtracking.