Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                

Design and Analysis of Algorithm Lab Record

Download as pdf or txt
Download as pdf or txt
You are on page 1of 5

MADAN MOHAN MALAVIYA UNIVERSITY OF

TECHNOLOGY GORAKHPUR

“Design and Analysis of Algorithm Lab Record”


Subject Code : MCA-303
Master of Computer Application
Session : 2023-24

By Vivek Kumar
CERTIFICATE
This is to certify that this manual is a bonafide record of practical work in the Design Analysis
and Algorithms in Third Semester of II Year MCA programme during the academic year
2023-24. This book is prepared by Prof. Shiva Prakash (Professor and Head) and Mr. Vivek
Kumar (Research Scholar) Department of Information Technology and Computer Application.
PREFACE
This book “Design Analysis and Algorithm” lab manual is intended to teach the design and
analysis of basic data structures and their implementation in an object-oriented language.
Readers of this book need only be familiar with the syntax of C, C++, Python and similar
languages. The Design Analysis and Algorithm Concepts is increasingly becoming the default
choice of the IT industry especially industries involved in software development at system level.
Therefore for proper development of “Object Oriented Programming” skill among the students
this practical manual has been prepared. The manual contains the exercise programs and their
solution for easy & quick understanding of the students. We hope that this practical manual will
be helpful for students of Master of Computer Application for understanding the subject from the
point of view of applied aspects. There is always scope for improvement in the manual. We
would appreciate receiving valuable suggestions from readers and users for future use.

By Vivek Kumar
GENERAL INSTRUCTIONS
1. Students are instructed to come to the Design Analysis and Algorithms laboratory on
time. Late comers are not entertained in the lab.
2. Students should be punctual to the lab. If not, the conducted experiments will not be
repeated.
3. Students are expected to come prepared at home with the experiments which are going to
be performed.
4. Students are instructed to display their identity cards before entering into the lab.
5. Students are instructed not to bring mobile phones to the lab.
6. Any damage/loss of system parts like keyboard, mouse during the lab session, it is the
student's responsibility and penalty or fine will be collected from the student.
7. Students should update the records and lab observation books session wise. Before
leaving the lab the student should get his lab observation book signed by the faculty.
8. Students should submit the lab records by the next lab to the concerned faculty members
in the staffroom for their correction and return.
9. Students should not move around the lab during the lab session.
10. If any emergency arises, the student should take the permission from the faculty member
concerned in written format.
11. The faculty members may suspend any student from the lab session on disciplinary
grounds.
12. Never copy the output from other students. Write down your own outputs.
LIST OF EXPERIMENTS

S. No. Name of the Experiment Date Signature

1. Write a program to implement Insertion sort, Select


sort, Bubble sort and analyse time complexity.

2. Write a program to implement Quick sort, Merge


sort and analyse time complexity.

3. Write a program to implement Heap sort and analyse


time complexity.

4. Write a program to implement Largest Common


Subsequence.

5. Write a program to implement Matrix Chain


Multiplication.

6. Write a program to implement Strassen‟s matrix


multiplication Algorithm, Merge sort and Quick
sort.

7. Write a program to implement Knapsack Problem.

8. Write a program to implement an Activity Selection


Problem.

9. Write a program to implement Dijkstra‟s Algorithm.

10. Write a program to implement Warshall‟s


Algorithm.

11. Write a program to implement Bellman Ford‟s


Algorithm.

12. Write a program to implement Naïve


String-Matching Algorithm.

13. Write a program to implement Rabin Karp String


Matching Algorithm

14. Write a program to implement Prim‟s Algorithm.

15. Write a program to implement Kruskal‟s Algorithm

You might also like