Beruflich Dokumente
Kultur Dokumente
Part-A
3.what is the tool for analyzing the time efficiency of a non recursive algorithm?
Set up a sum expressing the number of times the algorithm’s basic operation is
executed.
Standard formulas and rules of sum manipulation,finds either closed form
formula for the count or at least its order of growth..
4.What is algorithm animation?
It is dyanamic algorithm visualization.It shows a continous movie like presentation of an
algorithm’s operations.
5.Compare DFS and BFS
6.Find the number of comparisions made by the sequential search in the worst case and best case
Input size-number of elements=n
Basic operation-key comparision A[i]==k
The number of comparision is same for all arrays of size n,represented as:
Sworst(n)=n€ﻂ
7.How efficient is prim’s algorithm?
If prism’s algorithm is implemented using adjacency matrix,list then the time complexity is
O(|V2|),O(E log2 V) where V is the total number of vertices in a graph and E is the total
number of edges.the same can be implemented with queue representation also.
10.what are the additional items required for branch and bound compare backtracking technique?
Backtracking:
(i) Traced using depth first search.
(ii) Decision problems can be solved.
(iii) If dead end is reached during solution then backtracking and try another solution.
(iv) Example:
Knapsack
Sum of subset
2. Order of an algorithm.
Measuring the performance of an algorithm in relation with the input size n is known as order
of growth.
3. Define loop.
In a graph representation edges connecting vertices to themselves is called loop.
NOV/DEC 2007
Part-A
1. Stepwise Refinement
In topdown design methodology the problem is solved in sequence (step by
step) is known as stepwise refinement.
2. Efficiency of an algorithm.
(i)Time efficiency-indicates how fast the algorithm runs.
(ii) Space efficiency-deals with the extra space it requires.
3. Smoothness rule.
Let T(n) be an eventually non decreasing function and f(n) be a smooth
function .If T(n) €Θ(f(n)) for values of n that are powers of b, where b>=2 then T(n)
€Θ(f(n)).
4. Algorithm visualization.
It is the use of images to convey useful information about aig.The variation
are:
(i) Static algorithm visualization.
(ii) Dynamic algorithm visualization.
5. Time complexity of bubble sort algorithm.
C(n)=∑