Scribd
Upload
2 views

Assignment

Assignment pdf

Uploaded by

jayramghoghari
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
2 views

Assignment

Assignment pdf

Uploaded by

jayramghoghari
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 3

SAL Institute of Technology and

Engineering Research
CE, CSE & ICT Department
Analysis and Design of Algorithms (3150703)

Assignment-1
Mapped Course Outcomes: CO1
1) What is an algorithm? Explain various properties of an algorithm. 04
2) Differentiate function and relation with suitable example. 04
3) Explain why analysis of algorithm is important? Explain: Worst Case, Best Case 07
&Average Case Complexity with suitable example.
4) Explain Big Oh (O), Omega (Ω) and Theta (θ) asymptotic notations. 07
5) Explain bubble sort algorithm with suitable example. 07
6) Explain Selection Sort Algorithm and give its best case, worst case and average 07
casecomplexity with suitable example.
7) Sort given array A = {27, 46, 11, 95, 67, 32, 78} using insertion sort algorithm. 07
Also perform best case and worst case analysis of insertion sort algorithm.
8) Give the properties of Heap Tree. Sort the following data using Heap Sort Method: 07
20, 50, 30, 75, 90, 60, 80, 25, 10, 40.
9) Why amortized analysis is required? Explain any two method of amortized analysis 07
with suitable example.

Assignment-2
Mapped Course Outcomes: CO1, CO2
1) What do you mean by recurrence? Explain different methods to solve recurrence in 07
brief.

2) Analyze quick sort algorithm for best case, average case and worst case with 07
example.

3) Sort the following list using Merge Sort Algorithm : 07


<25,15,23,16,5,1,34,11,22,12,23>
4) Explain the use of Divide and Conquer Technique for Binary Search Method. What 07
is the complexity of Binary Search Method?

5) Explain Strasson’s algorithm for matrix multiplication with suitable example. 07


6) Solve Making Change problem using Dynamic Programming. 07
(denominations: d1=1,d2=4,d3=6). Give your answer for making change of Rs. 8.

7) Discuss Assembly Line Scheduling problem using dynamic programming with 07


example.

8) Solve following knapsack problem using dynamic programming algorithm with 07


given capacity W=5, Weight and Value are as follows: (2,12),(1,10),(3,20),(2,15).

9) Generate equation for Matrix chain multiplication using Dynamic programming. 07


Find out minimum number of multiplications required for multiplying: A[1 × 5],
B[5 × 4], C[4 × 3], D[3 × 2], and E[2 × 1]. Also give the optimal parenthesization of
matrices.

10) Find Longest Common Subsequence using Dynamic Programming Technique with 07
illustration X={A,B,C,B,D,A,B} Y={B,D,C,A,B,A}

Assignment-3
Mapped Course Outcomes: CO3, CO6
1) Explain in brief characteristics of greedy algorithms. Compare Greedy Method with 07
Dynamic Programming Method.

2) Define Minimum Spanning Tree(MST). Explain Krushkal’s Algorithm to find MST 07


with example.

3) Explain Prim’s Algorithm to find Minimum Spanning Tree with example. What is its 07
Time Compexity?

4) Design and explain Dijkstra’s shortest path algorithm 07


5) Explain Floyd’s algorithm for finding out shortest path with example. 07
6) Explain how to solve knapsack problem using greedy algorithms 07
7) Explain: Acyclic Directed Graph, Articulation Point, Dense Graph, Breadth First 07
Search Traversal, Depth First Search Traversal

8) Explain Breadth First Traversal Method for Graph with algorithm. 07


9) Explain Depth First Traversal Method for Graph with algorithm. 07
Assignment-4
Mapped Course Outcomes: CO3, CO4, CO5
1. Explain Backtracking Method. What is N-Queens Problem? Give solution of 4- 07
Queens Problem using Backtracking Method.

2. Write Naïve string matching algorithm. Find its time complexity and perform string 07
matching for given pattern P = “ACD” Text T = “CACDACAACDAC”

3. Explain how to solve knapsack problem using backtracking algorithms. 07


4. What is finite automata? Explain with example how finite automaton is used for 07
string matching?

5. Explain Rabin- Carp method for string matching with suitable example. 07
6. Explain Branch and Bound technique with suitable example. 07
7. Explain in Breif: P Problem, NP Problem, NP Hard Problem, NP Complete 04
Problem.

Assistant Professor, CE Dept., Head CE, CSE & ICT Dept.,

SAL Institute of Technology and Engineering SAL Institute of Technology and Engineering

Research Research

You might also like