GOVERNMENT ENGINEERING COLLEGE DAHOD

Affiliated to GUJARAT TECHNOLOGICAL UNIVERSITY

COMPUTER ENGINEERING DEPARTMENT

CERTIFICATE
This is to certify that Pandey Utkarsh Ashok bearing enrolment number

220183107013 has satisfactorily completed the term work under the program B.E

Computer Engineering of 5th semester course Analysis & Design of Algorithm for the

academic term ODD 2023 - 24 ending in November 2023.

Date of Submission

06/11/2023

Sign of Faculty

-------------------
220183107013 COMP503 Analysis and Design of Algorithms

Index
(Progressive Assessment Sheet)

Sr. Objective(s) of Experiment Date of Assesme Sign. Remarks P

No.
Page perfom nt
No. ance Marks
Implement a function for each of following
problems and count the number of steps
executed/time taken by each function on
various inputs (100 to 500) and write time
complexity of each function. Also draw a
comparative chart of number of input versus 1 01/08/23
steps executed/time taken. In each of the
following function N will be passed by user.
1. 1. To calculate sum of 1 to N numbers using loop.
2. To calculate sum of 1 to N numbers using equation.
3. To calculate sum of 1 to N numbers using recursion.
Write user defined functions for the
following sorting methods and compare
their performance by steps executed/time
taken for execution on various inputs (1000
to 5000) of random nature, ascending order
and descending order sorted data. Also draw
a comparative chart of number of input
6 01/08/23
versus steps executed/time taken for each
cases (random, ascending, and descending).
1. Selection Sort
2. 2. Bubble Sort
3. Insertion Sort
4. Merge Sort
5.Quick Sort
Implement a function of sequential search
and count the steps executed by function on
various inputs (1000 to 5000) for best case,
average case and worst case. Also, write
13 08/08/23
time complexity in each case and draw a
3. comparative chart of number of input
versus steps executed by sequential search
for each case.
Compare the performance of linear search
and binary search for Best case, Average 19 08/08/23
4.
case and Worst case inputs.
220183107013 COMP503 Analysis and Design of Algorithms

Implement functions to print nth Fibonacci

number using iteration and recursive
method. Compare the performance of two
methods by counting number of steps
24 22/08/23
5. executed on various inputs. Also, draw a
comparative chart.(Fibonacci series 1, 1, 2,
3, 5, 8….. Here 8 is the 6th Fibonacci
number).
Implement a program for randomized
version of quick sort and compare its
performance with the normal version of
quick sort using steps count on various
inputs (1000 to 5000) of random nature,
28 22/08/23
6. ascending order and descending order
sorted data. Also, draw a comparative chart
of number of input versus steps
executed/time taken for each cases
(random, ascending, and descending).
Implement program to solve problem of
7. Making a change using dynamic 34 05/09/23
programming.
Implement program of chain matrix
8. 38 12/09/23
multiplication using dynamic programming.
Implement program to solve LCS
9. problem using dynamic programing. 42 12/09/23

Implement program to solve Knapsack

10. 47 26/09/23
problem using dynamic programming.
Implement program for solution of
fractional Knapsack problem using greedy 52 26/09/23
11.
design technique.
Implement program for solution of Making
Change problem using greedy design 56 03/10/23
12.
technique.
Implement program for Kruskal's algorithm
13. to find minimum spanning tree. 60 03/10/23

Implement program for Prim's algorithm

14. to find minimum spanning tree. 64 10/10/23

Implement DFS and BFS graph

15. traversal techniques and write its time 68 10/10/23
complexities.
Implement Rabin-Karp string matching
16. algorithm. 73 17/10/23

Total
 220183107013 COMP503 Analysis and Design of Algorithms

Practical – Course Outcome matrix

Course Outcomes (Cos):

1. 1. Analyze the asymptotic performance of algorithms.

2. 2. Derive and solve recurrences describing the performance of divide-and-conquer algorithms.
3. 3. Find optimal solution by applying various methods.
4. 4. Apply pattern matching algorithms to find particular pattern.
5. 5. Differentiate polynomial and non-polynomial problems.
6. Explain the major graph algorithms and their analyses. Employ graphs to model engineering
problems, when appropriate.
Sr. CO 1 CO 2 CO 3 CO 4 CO 5 CO 6
Objective(s) of Experiment
No.
Implement a function for each of following problems
and count the number of steps executed/time taken by
each function on various inputs (100 to 500) and write
time complexity of each function. Also draw a
comparative chart of number of input versus steps
1. executed/time taken. In each of the following
function N will be passed by user.
1. 1. To calculate sum of 1 to N numbers using loop.
√
2. 2. To calculate sum of 1 to N numbers using equation.
3. To calculate sum of 1 to N numbers using
recursion.
Write user defined functions for the following sorting
methods and compare their performance by steps
executed/time taken for execution on various inputs
(1000 to 5000) of random nature, ascending order and
descending order sorted data. Also draw a
comparative chart of number of input versus steps
executed/time taken for each cases (random,
2. ascending, and descending).
1. 1. Selection Sort
2. 2. Bubble Sort
√ √
3. 3. Insertion Sort
4. 4. Merge Sort
5. Quick Sort
Implement a function of sequential search and count
the steps executed by function on various inputs (1000
to 5000) for best case, average case and worst case.
3. Also, write time complexity in each case and draw a
comparative chart of number of input versus steps √
executed by sequential search for each case.
220183107013 COMP503 Analysis and Design of Algorithms

Compare the performance of linear search and

4. binary search for Best case, Average case and Worst
caseinputs. √ √
Implement functions to print nth Fibonacci number
using iteration and recursive method. Compare the
performance of two methods by counting number of
5. steps executed on various inputs. Also, draw a
comparative chart. (Fibonacci series 1, 1, 2, 3, 5, √ √
8….. Here 8 is the 6th Fibonacci number).
Implement a program for randomized version of quick
sort and compare its performance with the normal
version of quick sort using steps count on various
inputs (1000 to 5000) of random nature, ascending
6. order and descending order sorted data. Also draw a
comparative chart of number of input versus steps
√ √
executed/time taken for each cases (random,
ascending, and descending).
Implement program to solve problem of making
7. a change using dynamic programming. √
Implement program of chain matrix multiplication
8. using dynamic programming. √
Implement program to solve LCS problem using
9. dynamic programing. √
Implement program to solve Knapsack problem
10. using dynamic programming. √
Implement program for solution of fractional
11. Knapsack problem using greedy design technique. √
Implement program for solution of Making
12. Change problem using greedy design technique √
Implement program for Kruskal's algorithm to
13. find minimum spanning tree. √ √
Implement program for Prim's algorithm to
14. find minimum spanning tree. √ √
Implement DFS and BFS graph traversal techniques
15. and write its time complexities. √

16. Implement Rabin-Karp string matching algorithm. √