Scribd
Upload
67 views

Daa Lab (BCS-553)

Uploaded by

Vidhi Rawat
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
67 views

Daa Lab (BCS-553)

Uploaded by

Vidhi Rawat
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
You are on page 1/ 1

ABES INSTITUTE OF TECHNOLOGY

Department of Computer Science & Engineering-Artificial Intelligence


Teacher: Ms. Vineeta Subject Name: DAA Lab
Subject Code: BCS553 Course/Branch: B.Tech 3rd year/ CSE-AI
Session: 2024-25 Semester: 5th

A. LIST OF PRACTICALS:
1. Program for Recursive Binary & Linear Search.
2. Program for Heap Sort.
3. Program for Merge Sort.
4. Program for Selection Sort.
5. Program for Insertion Sort.
6. Program for Quick Sort.
7. Knapsack Problem using Greedy Solution
8. Perform Travelling Salesman Problem
9. Find Minimum Spanning Tree using Kruskal’s Algorithm
10. Implement N Queen Problem using Backtracking
11. 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 non graph sheet. The elements can be read from
a file or can be generated using the random number generator. Demonstrate using Java
how the divide and- conquer method works along with its time complexity analysis: worst
case, average case and best case.
12. 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 non graph sheet. The elements can be read from
a file or can be generated using the random number generator. Demonstrate how the
divide and- conquer method works along with its time complexity analysis: worst case,
average case and best case.
13. From a given vertex in a weighted connected graph, find shortest paths to other
vertices using Dijkstra's algorithm.
14. Find Minimum Cost Spanning Tree of a given connected undirected graph using
Kruskal's algorithm. Use Union-Find algorithms in your program.
B. LAB CONDUCTION PLAN:
The same experiment will be run by all groups on the same day. The entire class (both
groups) will be present for the entire two-hour lab period.
C. EVALUATION PROCESS: Only 25 marks

Criteria Weightage (%age)


1. Attendance 40%
2. Lab Record 20%
3. Performance 25%
4. Viva 15

You might also like