[go: up one dir, main page]
Scribd
Upload
26 views1 page

ADA Prog List

The document outlines a series of programming tasks related to the design and analysis of algorithms, divided into two parts. Part A includes implementations of search algorithms, the tower of Hanoi problem, and various methods for calculating coefficients and evaluating polynomials. Part B focuses on string matching algorithms, graph traversal, topological ordering, transitive closure, and sorting algorithms.

Uploaded by

tiwawo8782
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
26 views1 page

ADA Prog List

The document outlines a series of programming tasks related to the design and analysis of algorithms, divided into two parts. Part A includes implementations of search algorithms, the tower of Hanoi problem, and various methods for calculating coefficients and evaluating polynomials. Part B focuses on string matching algorithms, graph traversal, topological ordering, transitive closure, and sorting algorithms.

Uploaded by

tiwawo8782
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
You are on page 1/ 1

Design and Analysis of Algorithm

PART – A

1. Program to implement linear search algorithm. Repeat the experiment for different values of N , the
no of element in the list to be searched and plot a graph of time taken versus N
2. Program to implement binary search algorithm. Repeat the experiment for different values of N ,
the no of element in the list to be searched and plot a graph of time taken versus N .
3. Program to solve tower of Hanoi problem and execute it for different number of disks.
4. Program to find a n using (a)brute force based algorithm
(b)divide and conquer based algorithm
5. program to find binomial coefficient using brute force algorithm and also dynamic programming
based algorithm
6. program to evaluate polynomial using brute force algorithm and using Horner’s rule.

PART – B

7. program to solve the string matching problem using Boyer Moore approach.
8. program to solve the string matching problem using KMP algorithm.
9. Program to implement BFS traversal algorithm.
10. Program to obtain the topological ordering of vertices
11. Program to compute transitive closure of given directed graph using Warshall’s algorithm
12. Program to sort a given set of numbers using quick sort algorithm.

You might also like