Scribd
Upload
20 views3 pages

Ad3351 Set1

Uploaded by

sathishkumar
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
20 views3 pages

Ad3351 Set1

Uploaded by

sathishkumar
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/ 3

B.E / B.Tech.

PRACTICAL END SEMESTER EXAMINATIONS, NOVEMBER/DECEMBER 2022

Third Semester

AD3351 - DESIGN AND ANALYSIS OF ALGORITHMS

(Regulations 2021)

Time: 3 Hours Answer any one Question Max. Marks 100

Aim/Principle/Apparatus Tabulation/Circuit/ Calculation


Viva-Voce Record Total
required/Procedure Program/Drawing & Results
20 30 30 10 10 100

1. a. Write a program in C to calculate the factorial of a given number using recursion. (50)

b. Write a C code to generate the Fibonacci series using non-recursion algorithms. (50)

2. a. Write a C code to find the factorial of a given number using non-recursion. (50)

b. Write a C code to generate the Fibonacci series using recursion algorithms. (50)

3. Develop a C program to implement the concept of Tower of Hanoi using non-recursive


algorithms.

4. Write a C program to Implement Tower of Hanoi using recursive algorithms.

5. Write a C program to implement Strassen’s Matrix Multiplication using Divide and


Conquer methodology.

6. Write a C program to implement Topological Sorting using Decrease and Conquer design
strategy.

7. Develop a C program to implement Heap Sort using Transform and Conquer technique.

8. Write a C code for Coin change Problem using Dynamic approach.

9. Write a C program to apply Warshall’s and Floyd‘s algorithms for constructing the
shortest path.

Page 1 of 3
10. Develop a program in C to apply Dynamic programming to solve Knapsack Problem.

11. Write a program in C to implement Huffman coding using Greedy Technique.

12. Develop a C program to implement Dijkstra’s algorithm using Greedy Technique.

13. Write a C program to implement an Iterative improvement strategy for Simplex Method.

14. Develop a program in C to solve the N-Queen problem using Backtracking.

15. Write a code in C to solve the Subset Sum Problem using Backtracking.

16. Develop a C program to implement branch and Bound technique to solve Assignment
problem.

17. Write a program in C to implement Branch and Bound technique to solve the Traveling
Salesman Problem.

18. Write a program in C to implement Topological Sorting for the given graph using
Decrease and Conquer design strategy.

19. Develop a C program to implement Heap Sort using Transform and Conquer technique
for the following values 10,3,76,34,23,32.

Page 2 of 3
20. Develop a program in C to implement Dijkstra’s algorithm for the given graph using
Greedy Technique.

Page 3 of 3

You might also like

pFad - Phonifier reborn

Pfad - The Proxy pFad of © 2024 Garber Painting. All rights reserved.

Note: This service is not intended for secure transactions such as banking, social media, email, or purchasing. Use at your own risk. We assume no liability whatsoever for broken pages.


Alternative Proxies:

Alternative Proxy

pFad Proxy

pFad v3 Proxy

pFad v4 Proxy