0% found this document useful (0 votes)
57 views

Manav Rachna International Institute of Reasearch & Studies: Faculty of Engineering and Technology

This document is a practical file submitted by Ajay Kumar, a student of Computer Science Engineering at Manav Rachna International Institute of Research and Studies. The practical file contains 12 programs implementing various algorithms like searching, sorting, dynamic programming, and backtracking. For each program, the student has provided the date of completion and signature. The programs cover linear search, binary search, different sorting algorithms, matrix operations, knapsack problem, job sequencing, string matching algorithms and more.

Uploaded by

GamerSPIDEY
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
0% found this document useful (0 votes)
57 views

Manav Rachna International Institute of Reasearch & Studies: Faculty of Engineering and Technology

This document is a practical file submitted by Ajay Kumar, a student of Computer Science Engineering at Manav Rachna International Institute of Research and Studies. The practical file contains 12 programs implementing various algorithms like searching, sorting, dynamic programming, and backtracking. For each program, the student has provided the date of completion and signature. The programs cover linear search, binary search, different sorting algorithms, matrix operations, knapsack problem, job sequencing, string matching algorithms and more.

Uploaded by

GamerSPIDEY
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/ 3

MANAV RACHNA INTERNATIONAL

INSTITUTE OF REASEARCH & STUDIES

FACULTY OF ENGINEERING AND


TECHNOLOGY

PRACTICAL FILE
FOR

__5___ SEMESTER (ACADEMIC YEAR 2020-2021)

SUBJECT NAME: DAA LAB____________


SUBJECT CODE: BCS-DS-551___________

SUBMITTED BY:- SUBMITTED TO:-

STUDENT NAME: Ajay Kumar FACULTY NAME: Dr. Amit


Chugh
ROLL NO.: DESIGNATION:_Assistant
1/18/FET/BCS/182_____ Professor
BRANCH: CSE- DEPARTMENT:_FET__________
CSF______________ ___
SECTION:5CSF________________ ______________________________
__
Index
S.No Name of Program Date Signature
1. WAP for Linear Search & Binary Search. Calculate 02/06/2020
the time complexity by step-count method. Take the
input-set from a table and repeat the operation sev-
eral times 10, 20, 30, 40 times and plot a graph.
2. WAP to sort a set of numbers into ascending/de- 09/06/2020
scending order using different sorting algorithms and
calculate the time complexity by step-count method.
Take the input-set from a table and repeat the opera-
tion several times 10,20,30,40 times and plot a graph.
3. WAP to sort a set of numbers using (i) Merge sort 23/06/2020
and (ii) Quick-sort using divide and conquer method.
4. WAP to find max and min in a Input list (array) 30/06/2020
using (i) Na¨ıve method and (ii) Divide and Conquer
method.
5. WAP to calculate product of 2x2 matrices using (i) 07/07/2020
Na¨ıve method and (ii) Strassen (Divide and Conquer)
method.
6. WAP to implement greedy approach solution for frac- 14/07/2020
tional knapsack problem.
7. WAP to solve Job Sequencing Problem with deadlines 04/08/2020
using Greedy algorithm.
8. WAP for Matrix-Chain Multiplication using Dynamic 25/08/2020
programming.
9. WAP to find the Largest Common Subsequence of 01/09/2020
two sets using Dynamic programming.
10. WAP for solution space for 8 Queen Problem and 08/09/2020
solve the problem using Back-Tracking method.
11. WAP for Sum of subsets problem of a given set using 15/09/2020
back tracking method.
12. WAP for string matching by (i) Naive-string match- 06/10/2020
ing method and (ii) Rabin-Karp algoritm.

You might also like