Scribd
Upload
6 views17 pages

Ada Lab File

The document is a lab file for the Analysis and Design of Algorithms course at Manav Rachna University. It outlines various lab exercises focused on implementing searching and sorting algorithms, as well as data structures like linked lists and knapsack problems. Each lab includes specific programming tasks and objectives aimed at enhancing students' understanding of algorithm efficiency and implementation.

Uploaded by

Tanmay Sharma
Copyright
© All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
6 views17 pages

Ada Lab File

The document is a lab file for the Analysis and Design of Algorithms course at Manav Rachna University. It outlines various lab exercises focused on implementing searching and sorting algorithms, as well as data structures like linked lists and knapsack problems. Each lab includes specific programming tasks and objectives aimed at enhancing students' understanding of algorithm efficiency and implementation.

Uploaded by

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

MANAV RACHNA UNIVERSITY

SCHOOL OF ENGINEERING
DEPARTMENT OF COMPUTER SCIENCE & TECHNOLOGY

LAB FILE

ANALYSIS AND DESIGN OF ALGORITHMS

Submitted to: Submitted by:


Dr. GUNJAN [Link]
Professor 2K24CSUN01109
DoCST, MRU [Link]. CSE3B
INDEX
HACKER RANK :
SCORE:
LAB-01
Learning Objective: Students would be Able to
implement searching algorithms

Learning Outcome: To implement the search


algorithms and calculate time complexity

1. Implement linear search and determine the time


required to search an element.
[Link] binary search and determine the time required to search an
element
LAB-02
Learning Objective: Students would be Able to
implement sorting algorithms.

1. Write a Program to sort a given set of elements using bubble


sort method and determine the time required to sort the
elements.

2. Write a Program to Sort a given set of elements using


selection sort method and determine the time required to
sort the elements

● Best case: O(n^2)


● Average/Worst case: O(n^2)
[Link] a Program to Sort a given set of elements using insertion sort method
and determine the time required to sort the elements
LAB-03
Learning Objective: Students would be Able to
implement sorting algorithms.
[Link] a Program to Sort a given set of elements using merge
sort method and determine the time required to sort the elements

[Link] a Program to Sort a given set of elements using quick sort method and
determine the time required to sort the elements.
LAB 04

[Link] a Program to implement 0/1 knapsack.

[Link] a Program to implement fractional knapsack.


LAB 05

[Link] to merge two sorted lists.

[Link] to create a linked list and print Linked List in forward and
reverse direction.
[Link] to Insert a Node at the beginning and end of the linked list.

[Link] to find nth node from the end in a linked list.


LAB 06
[Link] a program to find the largest and smallest elements in an array.

[Link] the frequency of each element in an array.


LAB 07
[Link] an array find the pair of elements whose sum is equal to a given
number.

[Link] and display a singly linked list.


[Link] a node at beginning, middle, and end

[Link] a node from beginning, middle, and end.


[Link] a linked list.

[Link] an element in a linked list.


LAB 08
[Link] a program to implement job sequencing with deadline.
LAB 09
[Link] the algorithm using Dynamic Approach to solve travelling
salesman problem and print the optimal solution.

You might also like