A
Laboratory File
On
Design an Analysis of Algorithm
Submitted
For
Bachelor of Technology
In
Computer Science & Engineering
At
Greater Noida Institute of Technology, Greater Noida
Guru Gobind Singh Indraprastha University, New Delhi
Submitted To: Submitted By:
Mr. Vaibhav Chauhan Khushi
Asst. Professor CSE-III Year (V SEM)
GNIT, Greater Noida Enroll. No : 03727202723
Experiment No. 1
Student Name: Khushi Enrollment No:03727202723
Branch: CSE Group: 1
Semester: 5th Date of Experiment: 01/08/25
Subject Name: DAA Subject Code: CIC-359
1. Aim:
To implement following algorithm using array as a data structure and analyse
its time complexity. a) Merge sort b) Quick sort c) Bubble sort d) Selection sort
e) Heap sort
2. CODE:
a) Merge Sort
Experiment No. 2
Student Name: Khushi Enrollment No:03727202723
Branch: CSE Group: 1
Semester: 5th Date of Experiment: 06/08/25
Subject Name: DAA Subject Code: CIC-359
Aim:
To implement Linear search and Binary search and analyse its time complexity.
Linear search:
Linear Search is defined as a sequential search algorithm that starts at one end
and goes through each element of a list until the desired element is found,
otherwise the search continues till the end of the data set.
Code:
Output:
Experiment No. 3
Student Name: Khushi Enrollment No:03727202723
Branch: CSE Group: 1
Semester: 5th Date of Experiment: 13/08/25
Subject Name: DAA Subject Code: CIC-359
Aim:
To implement Huffman Coding and analyse its time complexity.
Code:
Experiment No. 4
Student Name: Khushi Enrollment No:03727202723
Branch: CSE Group: 1
Semester: 5th Date of Experiment: 22/08/25
Subject Name: DAA Subject Code: CIC-359
Aim:
To implement Minimum Spanning Tree and analyse its time complexity.
Code:
Using krushkal algo.
Experiment No. 5
Student Name: Khushi Enrollment No:03727202723
Branch: CSE Group: 1
Semester: 5th Date of Experiment: 29/08/25
Subject Name: DAA Subject Code: CIC-359
Aim
To implement Dijkstra‘s algorithm and analyse its time complexity.
Code:
Experiment No. 6
Student Name:Khushi Enrollment No:03727202723
Branch: CSE Group: 1
Semester: 5th Date of Experiment: 01/09/25
Subject Name: DAA Subject Code: CIC-359
Aim:
To implement Bellman Ford algorithm and analyse its time complexity.
Code:
Experiment No. 7
Student Name:Khushi Enrollment No:03727202723
Branch: CSE Group: 1
Semester: 5th Date of Experiment: 12/09/25
Subject Name: DAA Subject Code: CIC-359
Aim:
Implement N Queen's problem using Back Tracking.
Code:
Experiment No. 8
Student Name: Khushi Enrollment No:03727202723
Branch: CSE Group: 1
Semester: 5th Date of Experiment: 19/09/25
Subject Name: DAA Subject Code: CIC-359
Aim:
To implement Matrix Multiplication and analyse its time complexity.
Code:
Experiment No. 9
Student Name: Khushi Enrollment No:03727202723
Branch: CSE Group: 1
Semester: 5th Date of Experiment: 22/09/25
Subject Name: DAA Subject Code: CIC-359
Aim:
To implement Longest Common Subsequence problem and analyse its time
complexity.
Code:
Output:
Experiment No. 10
Student Name: Khushi Enrollment No:03727202723
Branch: CSE Group: 1
Semester: 5th Date of Experiment: 26/09/25
Subject Name: DAA Subject Code: CIC-359
Aim:
To implement naïve String Matching algorithm, Rabin Karp algorithm and Knuth
Morris Pratt algorithm and analyse its time complexity.
Code:
String Matching Algorithm-