Scribd
Upload
164 views2 pages

DAA-Practical List

This document outlines the course outcomes and experiments for a Design and Analysis of Algorithms course. The 5 course outcomes are to determine the best algorithm, demonstrate various algorithm problem types, compute time and space requirements, analyze performance, and develop algorithms for problems. 10 experiments are described that implement sorting, searching, dynamic programming, and greedy algorithms to analyze time complexity and compare performance. A mapping of the course outcomes to program outcomes is also provided.

Uploaded by

Setu Patel
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
164 views2 pages

DAA-Practical List

This document outlines the course outcomes and experiments for a Design and Analysis of Algorithms course. The 5 course outcomes are to determine the best algorithm, demonstrate various algorithm problem types, compute time and space requirements, analyze performance, and develop algorithms for problems. 10 experiments are described that implement sorting, searching, dynamic programming, and greedy algorithms to analyze time complexity and compare performance. A mapping of the course outcomes to program outcomes is also provided.

Uploaded by

Setu Patel
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
You are on page 1/ 2

Ganpat University - Faculty of Engineering & Technology

Information Technology

2CEIT402: Design & Analysis of Algorithm


Course Outcomes

CO1 determine the best algorithm out of various alternatives.

CO2 demonstrate various problems on divide and conquer, greedy and dynamic programming.

CO3 compute the time and space requirements for various algorithms and represent it using various
mathematical notations and recurrence relations.

CO4 analyse the performance of the algorithms for the best, average and worst case.

CO5 develop various algorithms for the same problem using different classes of problems.

List of Experiments
Sr. No Experiments CO
Mapping

1 Implement a function for each of the following problems and count the number of steps 1,2,3
executed/Time taken by each function on various inputs and write complexity of each function. Also
draw a comparative chart. In each of the following functions N will be passed by user.

1. calculate the sum of squares from 1 to N using a loop.

2. To calculate the sum of squares 1 to N number using the equation.

3. To calculate sum of squares 1 to N numbers using recursion.

2 Implement functions to print nth Fibonacci number using iteration and recursive methods. Compare 1,2
the performance of two methods by counting the number of 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)

3 Write user defined functions for the following sorting methods and compare their performance by 2,3,4
time measurement with random data and Sorted data.
1. Selection Sort

2. Bubble Sort

3. Insertion Sort

4. Merge Sort

5. Quick Sort

6. Randomized Quick Sort


Ganpat University - Faculty of Engineering & Technology
Information Technology

4 Implement a function of Sequential Search & Binary Search and count the steps executed by function 4,5
on various inputs for best case and worst case. Also write complexity in each case and draw a
comparative chart.

5 Implement a program of Counting Sort. 4

6 Implement Program for fractional knapsack using Greedy design technique. 3, 4,5

7 Implement Program for “Making Change” using Greedy design technique. 2,4

8 Implement Program for “Making Change” using Dynamic Programming. 2, 4, 5

9 Implementation of a knapsack problem using dynamic programming. 2,4,5

10 Implement N Queen's problem using Backtracking. 1, 4, 5

Mapping of CO with PO and PSO:

PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12 PSO1 PSO2 PSO3
CO1 3 2 2 2 1 0 1 0 2 0 2 2 2 2 2
CO2 3 3 2 2 3 0 2 0 2 0 2 2 3 2 2
CO3 3 3 3 2 2 0 3 0 3 0 2 2 3 2 2
CO4 3 3 2 2 2 0 2 0 2 0 2 2 2 2 2
CO5 3 3 2 2 2 0 2 0 2 0 2 2 2 2 2

Name and Sign of faculty member

You might also like