DAA-QUESTION BANK

DESIGN AND ANALYSIS OF ALGORITHMS

“QUESTION BANK”

2-Marks

Unit- I

1. Define Algorithm

An algorithm is an sequence of unambiguous instructions for solving a problem for obtaining required output for any legitimate input in a finite amount of time.

2.What are all the Algorithm Characteristics

(i) The nonambiguity requirement for each step of an algorithm.

(ii) The range of input should specified clearly.

(iii) Same algorithm can be represented in different ways.

(iv) Several algorithm for solving the same problem may exist.

3. What are the algorithm used to calculate GCD

(i) Euclid’s algorithm

(ii) Consecutive integer checking algorithm

(iii) Middle school procedure algorithm

4. What is Algorithm Design technique

Algorithm design technique is a general approach to solving problems algorithmically,that is applicable to a variety of problems from different areas of computing.

5. What is Parallel Algorithm

Algorithm that execute the instructions concurrently is called parallel

algorithm.

6. What is sequential algorithm

Instructions are executed one by one is called sequential algorithm.

7. What is pseudocode

A Pseudo code is a mixure of a natural language and programming language like constructs.

8. What is flowchart

Flowchart is a method of expressing an algorithm by a collection of connected geometric shapes containing descriptions of the algorithms steps.

9. What is string

A string is a sequence of characters from an alphabet.

10. What is graph

Graph is collection of vertices and edges.

11. What is Geometric problem

(i) Closest pair problem

(ii) Convex hull problem

12. Give example for combinatorial problem

(i) Travelling salesman problem

(ii) Graph coloring problem

13. What is Basic Operation

Most important operation of the algorithm is called basic operation.

14. Write the formula for calculating running time of an algorithm

T(n)=cop*c(n)

15. Explain worst case, best case , Average case efficiencies

Worst case Efficiency

Worst case efficiency of an algorithm is its efficiency for the worst case input of size n which is an input of size n for which the algorithm runs the longest among all the inputs of that size.

Best Case Efficiency

An algorithm which is an input of size n for which the algorithm runs the fastest among all possible input of that size.

Average case efficiency

It is neither the worst case nor the average case algorithm behavior on a typical or random input.

16. What are all the steps followed in analysis of recursive algorithm

(i) Decide on a parameter indicating an input size.

(ii) Identify the Basic operation

(iii) Check number of times basic operation executed.

(iv) Set up a recurrence relation

(v) Solve the recurrence relation.

17. What are all the steps followed in analysis of non-recursive algorithm

(i) Decide on a parameter indicating an input’s size

(ii) Identify the algorithm’s basic operation

(iii) Check whether the number of times the basic operation is

executed.

(iv) Set up the sum expressing the number of times the algorithm’s

basic operation is executed.

(v) Using the standard formulas and the sum manipulation.

18. What is performance measurement?

Performance measurement is concerned with obtaining the space and the time

requirements of a particular algorithm.

19. What is an algorithm?

An algorithm is a finite set of instructions that, if followed, accomplishes a

particular task. In addition, all algorithms must satisfy the following criteria:

1) input

2) Output

3) Definiteness

4) Finiteness

5) Effectiveness.

20. Define Program.

A program is the expression of an algorithm in a programming language.

Sometimes works such as procedure, function and subroutine are used synonymously program.

21. Write the For LOOP general format.

The general form of a for Loop is

For variable : = value 1 to value 2 step

Step do

{

statement 1

statement n

}

22. What is recursive algorithm?

An algorithm is said to be recursive if the same algorithm is invoked in the body. An algorithm that calls itself is Direct recursive. Algorithm A is said to be indeed recursive if it calls another algorithm, which in turn calls A.

23. What is space complexity?

The space complexity of an algorithm is the amount of memory it needs to run to completion.

24. What is time complexity?

The time complexity of an algorithm is the amount of computer time it needs to

run to completion.

25. Give the two major phases of performance evaluation

Performance evaluation can be loosely divided into two major phases:

(i) a prior estimates (performance analysis)

(ii) a Posterior testing(performance measurement)

26. Define input size.

The input size of any instance of a problem is defined to be the number of

words(or the number of elements) needed to describe that instance.

27. Define best-case step count.

The best-case step count is the minimum number of steps that can be executed for the given parameters.

28. Define worst-case step count.

The worst-case step count is the maximum number of steps that can be executed

for the given parameters.

29. Define average step count.

The average step count is the average number of steps executed an instances with the given parameters.

30. Define the asymptotic notation “Big on” (0)

The function f(n) = O(g(n)) iff there exist positive constants C and no such that

C * g(n) for all n, nf(n) n0.

31. Define the asymptotic notation “Omega” ( ).

(g(n)) iff thereThe function f(n) = exist positive constant C and no such that

f(n) C * g(n) for all n, n n0.

32. Define the asymptotic t\notation “theta” ()

(g(n)) iff thereThe function f(n) = C2 g(n) for allf(n) exist positive constant C1, C2, and no such that C1 g(n) n0.n, n

33. Define Little “oh”.

The function f(n) = 0(g(n))

iff

Lim f(n) = 0

g(n)n -

34. Define Little Omega.

(g(n))The function f(n) =

iff

Lim f(n) = 0

g(n)n -

35. Write algorithm using iterative function to fine sum of n numbers.

Algorithm sum(a,n)

{ S : = 0.0

For i=1 to n do

S : - S + a[i];

Return S;

}

36. Write an algorithm using Recursive function to fine sum of n numbers,

Algorithm Rsum (a,n)

{

If(n_ 0) then

Return 0.0;

Else Return Rsum(a, n- 1) + a(n);

Unit –II

2-Marks

1. What is divide and conquer method

It is general algorithm design technique

(i) A Problem’s instance is divided into several smaller instances.

(ii) The smaller instances are solved

(iii) Smaller instances are combined to get a solution to the original problem.

2. What is the worst case, Best case and average case efficiency of Merge sort

Cworst(n)=nlogn2-n+1

3. What is pivot element

We select an element with respect to whose value we are going to divide the sub array ,we call this element as pivot.

4. Write the efficiencies of Quick sort

C(best(n)=nlogn2

Cworst(n)=O(n2 )

5. Write the efficiencies of binary search

Cw(n)=Logn2+1

6. What is Minheap

Minheap is a complete binary tree in which every element is less than or equal to its children.

7. Define Union by size and union by rank

Size of the tree can be measured by the number of nodes is called union by size.

Size of the tree can be measured by the height of the tree is called union by rank.

8. Quick find & quick union

Optimizes the time efficiency of the find operation is quick find operation.

Optimizes the union operation is called Quick union operation.

9. Define Binary tree

A Binary tree is defined as a finite set of nodes that is either empty or consists of a root and two disjoint binary trees left and right subtrees.

10. What are the traversal methods used in Binary tree

(i) Inorder

(ii) Preorder

(iii) Post order

11. Write the formulas for strassen’s matrix multiplication

m1=(a[0][0]+a[1][1]*b[0][0]+b[1][1])

m2=(a[1][0]+a[1][1])*b[0][0]

m3=a[0][0]*(b[0][1]-b[1][1])

m4=a[1][1]*(b[1][0]-b[0][0])

m5=(a[0][0]+a[0][1])*b[1][1]

m6=(a[1][0]-a[0][0])*(b[0][0]+b[0][1])

m7=(a[0][1]-a[1][1])*(b[1][0]+b[1][1])

c[0][0]=m1+m4-m5+m7

c[0][1]=m3+m5

c[1][0]=m2+m4

c[1][1]=m1+m3-m2+m6

12. What is the advantage of strassen’s Matrix multiplication

It use only seven multiplications and 18 additions.

13. What is greedy technique

Greedy technique is the constructing a solution through a sequence of steps,each expanding a partially constructed solution.

14. What is minimum spanning tree

A minimum spanning tree of a weighted graph is it spanning tree of the smallest weight.

15. What is the weight of graph

Weight of the graph is the sum of the weights of allmits edges.

16. What is shortest path problem

In weighted connected graph , find the shortest path to all its other vertices.

17. Write the efficiency of prim’s algorithm

O(E|log(v)|)

18. Write the efficiency of Kruskal’s algorithm

O(E|log|E|)

19. Write the efficiency of Dijikstra’s algorithm

|V|2

20. What is the Height of the binary tree

Height of the tree is define as the length of the longest path from the root to leaf.

21. Define the divide an conquer method.

Given a function to compute on ‘n’ inputs the divide-and-comquer strategy

suggests n, yielding ‘k’k splitting the inputs in to’k’ distinct susbsets, 1 subproblems.

The subproblems must be solved, and then a method must be found to combine

subsolutions into a solution of the whole. If the subproblems are still relatively large, then the divide-and conquer strategy can possibly be reapplied.

22. Define control abstraction.

A control abstraction we mean a procedure whose flow of control is clear but

whose primary operations are by other procedures whose precise meanings are left undefined.

23. Write the Control abstraction for Divide-and conquer.

)Algorithm DAnd(

{

);if small(p) then return S(

else

{

divide P into smaller instance _ 1, _ 2, _ 1;k, k

Apply D and C to each of these subproblems

Return combine (DAnd C(_1) DAnd C(_2),----, DAnd ((_k));

}

}

24. What is the substitution method?

One of the methods for solving any such recurrence relation is called the

substitution method.

25. What is the binary search?

If ‘q’ is always chosen such that ‘aq’ is the middle element(that is, q=[(n+1)/2),

then the resulting search algorithm is known as binary search.

26. Give computing time for Bianry search?

In conclusion we are now able completely describe the computing time of binary search by giving formulas that describe the best, average and worst cases. Successful searches

(Logn)(logn) (1)

best average worst

unsuccessful searches

(logn)

best, average, worst

27. Define external path length?

The external path length E, is defines analogously as sum of the distance of all

external nodes from the root.

28. Define internal path length.

The internal path length ‘I’ is the sum of the distances of all internal nodes from

the root.

29. What is the maximum and minimum problem?

The problem is to find the maximum and minimum items in a set of ‘n’ elements. Though this problem may look so simple as to be contrived, it allows us to demonstrate divideand- comquer in simple setting.

30. What is the Quick sort?

n quicksort, the division into subarrays is made so that the sorted subarrays do not need to be merged later.

31. Write the Anlysis for the Quick sot.

In analyzing QUICKSORT, we can only make the number of element

comparisions c(n). It is easy to see that the frequency count of other operations is of the same order as C(n).

32. Is insertion sort better than the merge sort?

Insertion sort works exceedingly fast on arrays of less then 16 elements, though for large ‘n’ its computing time is O(n2).

33. Write a algorithm for straightforward maximum and minimum>

algorithm straight MaxMin(a,n,max,min)

//set max to the maximum and min to the minimum of a[1:n]

{

max := min: = a[i];

for i = 2 to n do

{

if(a[i] >max) then max: = a[i];

if(a[i] >min) then min: = a[i];

}

}

34. Give the recurrence relation of divide-and-conquer?

The recurrence relation is

T(n) = g(n)

T(n1) + T(n2) + ----+ T(nk) + f(n)

35. Write the algorithm for Iterative binary search?

Algorithm BinSearch(a,n,x)

//Given an array a[1:n] of elements in nondecreasing

// order, n>0, determine whether x is present

{

low : = 1;

high : = n;

while (low < high) do

{

mid : = [(low+high)/2];

a[mid]) then high:=if(x mid-1;

a[mid]) then low:=mid +else if (x 1;

else return mid;

}

return 0;

}

36. What are internal nodes?

The circular node is called the internal nodes.

37. Describe the recurrence relation ofr merge sort?

If the time for the merging operation is proportional to n, then the computing time of merge sort is described by the recurrence relation

n = 1, a a constant

T(n) = a

2T (n/2) + n n 1, c a constant

38.What is meant by feasible solution?

Given n inputs and we are required to form a subset such that it satisfies some given constraints then such a subset is called feasible solution.

39. Write any two characteristics of Greedy Algorithm?

* To solve a problem in an optimal way construct the solution from given set of

candidates.

* As the algorithm proceeds, two other sets get accumulated among this one set contains

the candidates that have been already considered and chosen while the other set contains the candidates that have been considered but rejected.

40. Define optimal solution?

A feasible solution either maximizes or minimizes the given objective function is called as optimal solution

41. What is Knapsack problem?

A bag or sack is given capacity n and n objects are given. Each object has weight wi and profit pi .Fraction of object is considered as xi (i.e) 0<=xi<=1 .If fraction is 1 then entire object is put into sack. When we place this fraction into the sack we get wixi and pixi.

42. Define weighted tree.

A directed binary tree for which each edge is labeled with a real number (weight) is called as weighted tree.

43. What is the use of TVSP?

In places where the loss exceeds the tolerance level boosters have to the placed. Given a network and loss tolerance level the tree vertex splitting problems is to determine an optimal placement of boosters.

44. What is the Greedy choice property?

* The first component is greedy choice property (i.e.) a globally optimal solution can

arrive at by making a locally optimal choice.

* The choice made by greedy algorithm depends on choices made so far but it cannot depend on any future choices or on solution to the sub problem.

* It progresses in top down fashion.

45. What is greedy method?

Greedy method is the most important design technique, which makes a choice that looks best at that moment. A given ‘n’ inputs are required us to obtain a subset that satisfies some constraints that is the feasible solution. A greedy method suggests that one can device an algorithm that works in stages considering one input at a time.

46. What are the steps required to develop a greedy algorithm?

* Determine the optimal substructure of the problem.

* Develop a recursive solution.

* Prove that at any stage of recursion one of the optimal choices is greedy choice.

Thus it is always safe to make greedy choice.

* Show that all but one of the sub problems induced by having made the greedy

choice are empty.

* Develop a recursive algorithm and convert into iterative algorithm.

47. What is activity selection problem?

The ‘n’ task will be given with starting time si and finishing time fi. Feasible Solution is that the task should not overlap and optimal solution is that the task should be completed in minimum number of machine set.

48. Write the specification of TVSP

Let T= (V, E, W) be a weighted directed binary tree where

V_ vertex set

E_ edge set

W_ weight function for the edge.

W is more commonly denoted as w (i,j) which is the weight of the edge _ E.

49. Define forest.

Collection of sub trees that are obtained when root node is eliminated is known as forest

50 .What does Job sequencing with deadlines mean?

* Given a set of ‘n’ jobs each job ‘i’ has a deadline di such that di>=0 and a

profit pi such that pi>=0.

* For job ‘i’ profit pi is earned iff it is completed within deadline.

* Processing the job on the machine is for 1unit of time. Only one machine is

available.

51. Define post order traversal.

The order in which the TVSP visits the nodes of the tree is called the post order traversal.

52. Write the formula to calculate delay and also write the condition in which the

node gets splitted?

To calculate delay

d(u)=max{d(v)+w(u, v)}

v _ c(u)

The condition in which the node gets splitted are:

d(u)+w(u ,v)>_ and also d(u) is set to zero.

53. What is meant by tolerance level?

The network can tolerate the losses only up to a certain limit tolerance limit.

54. When is a task said to be late in a schedule?

A task is said to be late in any schedule if it finishes after its deadline else a task is early in a schedule.

55. Define feasible solution for TVSP.

Given a weighted tree T(V,E,W) and a tolerance limit _ any subset X of V is a

feasible solution if d(T/X)<= _.

56. Define optimal solution for TVSP.

An optimal solution is one in which the number of nodes in X is minimized.

57. Write the general algorithm for Greedy method control abstraction.

Algorithm Greedy (a, n)

{

solution=0;

for i=1 to n do

{

x= select(a);

if feasible(solution ,x) then

solution=Union(solution ,x);

}

return solution;

}

58 . Define optimal solution for Job sequencing with deadlines.

Feasible solution with maximum profit is optimal solution for Job sequencing with deadlines.

Unit-III

1. What is Dynamic programming

Dynamic programming is a technique used for solving problems with overlapping sub problems.

2. What is adjacency matrix

Adjacency matrix A={aij} of a directed graph is the Boolean matrix that has 1 in its ith row and jth column if and only if there is a direct edge from ith vertex to jth vertex.

3. What is transitive closure

It is n by n Boolean matrix in which the element in ith row and jth column is 1 if there exists a nontrivial directed path otherwise 0.

4. What is the formula used to calculate the transitive closure in warshall’s algorithm

Rk (i,j)=R(k-1) (i,j) or R(k-1) (i,k) and R(k-1) (k,j)

5. What is distance matrix

Length of the shortest path from ith vertex to all other vertices.

6. What is the formula used to calculate floyd’s algorithm

D[i,j]=Min{D(k-1)[I,j],D(k-1)[I,k]+D(k-1)[k,j]}

7. What is principle of optimality

Dynamic programming algorithms for optimization problem is called Principle of optimality.

8. What is the formula used to calculate optimal binary search tree

j

C[i,j]=min{c[I,k-1]+c[k+1,j]}+∑ps

I<=k<=j s=i

9. What id the formula used to calculate knapsack problem

V[i,j]=max{v[i-1,j],vi+v[i-1,j-wi]}

If j-wi>=0

V[i-1,j] if j-wi<0

10. What is memory function

Memory function is solve overlapping sub problem with top dpwn approach for finding a solution.

11. What is the formula used to calculate binomial coefficient

C[n,k]=C[n-1,k-1]+C[n-1,k]

For n>k>0

12. What is the time efficiency of calculating binomial coefficient

O(nk)

13. What is the time efficiency of calculating Flodys and warshall’s algorithm

O(n3)

14. What is the time efficiency of calculating Optimal binary search tree

O(n2)

15. What is the time efficiency of calculating Knapsack problem

O(nW)

16.Write the difference between the Greedy method and Dynamic programming.

Greedy method Dynamic programming

1.Only one sequence of decision is

generated.

1.Many number of decisions are

generated.

2.It does not guarantee to give an

optimal solution always.

2.It definitely gives an optimal

solution always.

59.Define dynamic programming.

Dynamic programming is an algorithm design method that can be used when a

solution to the problem is viewed as the result of sequence of decisions.

60.What are the features of dynamic programming?

_ Optimal solutions to sub problems are retained so as to avoid recomputing their values.

_ Decision sequences containing subsequences that are sub optimal are not considered.

_ It definitely gives the optimal solution always.

61.What are the drawbacks of dynamic programming?

_ Time and space requirements are high, since storage is needed for all level.

_ Optimality should be checked at all levels.

62.Write the general procedure of dynamic programming.

The development of dynamic programming algorithm can be broken into a

sequence of 4 steps.

1. Characterize the structure of an optimal solution.

2. Recursively define the value of the optimal solution.

3. Compute the value of an optimal solution in the bottom-up fashion.

4. Construct an optimal solution from the computed information.

63.Define principle of optimality.

It states that an optimal sequence of decisions has the property that whenever the initial

stage or decisions must constitute an optimal sequence with regard to stage resulting from the first

decision.

64.Give an example of dynamic programming and explain.

An example of dynamic programming is knapsack problem. The solution to the knapsack

problem can be viewed as a result of sequence of decisions. We have to decide the value of xi for

1

pimaximizes the object function xi.

65.Write about optimal merge pattern problem.

Two files x1 and x2 containing m & n records could be merged together to obtain one

merged file. When more than 2 files are to be merged together. The merge can be accomplished

by repeatedly merging the files in pairs. An optimal merge pattern tells which pair of files should

be merged at each step. An optimal sequence is a least cost sequence.

66.Explain any one method of finding the shortest path.

One way of finding a shortest path from vertex i to j in a directed graph G is to decide

which vertex should be the second, which is the third, which is the fourth, and so on, until vertex j

is reached. An optimal sequence of decisions is one that results in a path of least length.

67.Define 0/1 knapsack problem.

The solution to the knapsack problem can be viewed as a result of sequence of decisions.

We have to decide the value of xi. xi is restricted to have the value 0 or 1 and by using the function

knap(l, j, y) we can represent the wi xipi xi subject to problem as maximum < y where l -

iteration, j - number of objects, y – capacity.

68.What is the formula to calculate optimal solution in 0/1 knapsack problem?

The formula to calculate optimal solution is

g0(m)=max{g1, g1(m-w1)+p1}.

69.Write about traveling salesperson problem.

Let g = (V, E) be a directed. The tour of G is a directed simple cycle that includes every

vertex in V. The cost of a tour is the sum of the cost of the edges on the tour. The traveling

salesperson problem to find a tour of minimum cost.

70.Write some applications of traveling salesperson problem.

_ Routing a postal van to pick up mail from boxes located at n different sites.

_ Using a robot arm to tighten the nuts on some piece of machinery on an assembly line.

_ Production environment in which several commodities are manufactured on the same

set of machines.

71.Give the time complexity and space complexity of traveling salesperson problem.

_ Time complexity is O (n2 2n).

_ Space complexity is O (n 2n).

72.Define flow shop scheduling.

The processing of jobs requires the performance of several distinct job. In flow shop we

have n jobs each requiring n tasks i.e. T1i, T2i,…...Tmi, 1

73.What are the conditions of flow shop scheduling?

_ Let Tji denote jth task of the ith job. Task Tij is to be performed on Pj number of

processors where 1

_ Any task Tji must be assigned to the processor Pj.

_ No processor can have more than one task assigned to it at any time. For any job I

processing the task for j>1 cannot be started until T(j-i),i has been completed.

74.Define nonpreemptive schedule.

A nonpreemptive schedule is a schedule in which the processing of a task on any

processor is not terminated until the task is complete.

75. Define preemptive schedule.

A preemptive schedule is a schedule in which the processing of a task on any processor

can be terminated before the task is completed.

Unit-IV

1. What is Backtracking

Backtracking is the construct solutions one component at a time and evaluate such partially constructed candidates.

2. What is state space tree

In state space tree nodes of the first level represent choices for first level and second level represents choices for second level and so on.

3. What is promising and non-promising

In State space tree partially constructed solution that may still lead to complete solution is called promising otherwise non-promising.

4. What is N-queen problem

n-queens problem is to place n-queens on n by n chess board so that no two queens attack each other in same row or same column or same diagonal.

5. What is Hamiltonian circuit problem

Start with one vertex and visit all the other vertex only one time and return back to the starting vertex.

6. What is subset sum problem

Subset sum problem is the find the subset of a given set S={s1,s2,…Sn} of n positive integers whose sum is equal to a positive integer d.

7. What is traveling salesman problem

Travelling salesman problem is starting with one vertex and visit all other vertex and return back to the starting vertex with minimum cost.

8. What is knapsack problem

N items and their weights w1..wn and values v1..vn and Knapsack capacity W are given find most valuable subset that fit into the knapsack.

9. What is assignment problem

Assignment problem is the assigning n people to n jobs that the total cost of the assignment is as small as possible.

76.Define finish time

The finish time fi (S) of job i is the time at which all tasks of job i have been completed in

schedule S.The finish time F(S) of schedule S is given by

F(S)=max{ fi (S)} 1

77.Define mean flow time

The mean flow time MFT (S) is defined to be]

MFT (S) = 1 fi(S)

n 1

78.Define optimal finish time.

Optimal finish time scheduling for a given set of tasks is a nonpreemptive schedule S for

which F (S) is minimum over all nonpreemptive schedules S.

79.Define preemptive optimal finish time.

Preemptive optimal finish time scheduling for a given set of tasks is a preemptive schedule

S for which F (S) is minimum over all preemptive schedules S.

80. What are the requirements that are needed for performing Backtracking?

To solve any problem using backtracking, it requires that all the solutions satisfy a

complex set of constraints. They are:

i. Explicit constraints.

ii. Implicit constraints.

81.Define explicit constraint.

They are rules that restrict each xi to take on values only from a give set. They

depend on the particular instance I of the problem being solved. All tuples that satisfy the

explicit constraints define a possible solution space.

82. Define implicit constraint.

They are rules that determine which of the tuples in the solution space of I satisfy the

criteria function. It describes the way in which the xi must relate to each other.

83.Define state space tree.

The tree organization of the solution space is referred to as state space tree.

84.Define state space of the problem.

All the paths from the root of the organization tree to all the nodes is called as state

space of the problem

85.Define answer states.

Answer states are those solution states s for which the path from the root to s

defines a tuple that is a member of the set of solutions of the problem.

86.What are static trees?

The tree organizations that are independent of the problem instance being solved

are called as static tree.

87.What are dynamic trees?

The tree organizations those are independent of the problem instance being solved

are called as static tree.

88.Define a live node.

A node which has been generated and all of whose children have not yet been

generated is called as a live node.

89. Define a E – node.

E – node (or) node being expanded. Any live node whose children are currently

being generated is called as a E – node.

90.Define a dead node.

Dead node is defined as a generated node, which is to be expanded further all of

whose children have been generated.

91.,What are the factors that influence the efficiency of the backtracking algorithm?

The efficiency of the backtracking algorithm depends on the following four

factors. They are:

i. The time needed to generate the next xk

ii. The number of xk satisfying the explicit constraints.

iii. The time for the bounding functions Bk

iv. The number of xk satisfying the Bk.

Unit V

1. What is decision problem

Decision problems are problems with yes/no answers.

2. What is P problem

Class of decision problem that can be solved in polynomial time is called P Problem.

3. What is Non deterministic algorithm

A Non-deterministic algorithm has two stage of procedure

(i) Deterministic stage

(ii) Non-deterministic stage

4. What is tractable and intractable

Problems that can be solved in polynomial time is called tractable otherwise intractable.

5. What is NP Problem

Class Np is the class of decision problems that can be solved by non-deterministic polynomial algorithms.

6. What is NP complete problem

A decision problem is said to be Np-Complete if

(i) It belongs to class NP

(ii) Every problem in Np is polynomially reducible to D

7. What is performance ratio

It indicate the quality of the program.

8. What is Heuristic

A heuristic is a common sense rule drawn from experience rather than from mathematically proved assertion.

9. What is accuracy ratio

R(sa)=f(sa)/f(s*)

10. What is C-approximation algorithm

If performance ratio is atmost C then the algorithm is said to be C-approximation algorithm.

92.Define Branch-and-Bound method.

The term Branch-and-Bound refers to all the state space methods in which all

children of the E-node are generated before any other live node can become the E- node.

93.What are the searching techniques that are commonly used in Branch-and-Bound

method.

The searching techniques that are commonly used in Branch-and-Bound method

are:

i. FIFO

ii. LIFO

iii. LC

iv. Heuristic search

94.State 8 – Queens problem.

The problem is to place eight queens on a 8 x 8 chessboard so that no two queen

“attack” that is, so that no two of them are on the same row, column or on the diagonal.

95.State Sum of Subsets problem.

Given n distinct positive numbers usually called as weights , the problem calls for finding

all the combinations of these numbers whose sums are m.

96. State m – colorability decision problem.

Let G be a graph and m be a given positive integer. We want to discover whether the

nodes of G can be colored in such a way that no two adjacent nodes have the same color yet only

m colors are used.

97.Define chromatic number of the graph.

The m – colorability optimization problem asks for the smallest integer m for which the

graph G can be colored. This integer is referred to as the chromatic number of the graph.

98. Define a planar graph.

A graph is said to be planar iff it can be drawn in such a way that no two edges cross each

other.

99. What are NP- hard and Np-complete problems?

The problems whose solutions have computing times are bounded by polynomials of

small degree.

100. What is a decision problem?

Any problem for which the answer is either zero or one is called decision problem.

101. What is maxclique problem?

A maxclique problem is the optimization problrm that has to determine the size of a

largest clique in Grapg G where clique is the maximal subgraph of a graph.

102. what is approximate solution?

A feasible solution with value close to the value of an optimal solution is called

approximate solution.

12-Marks

Unit-I

1. Explain about fundamentals of algorithm problem solving

2. What are all the important problem types

3. Explain about Asymptotic notations

4. How do you analyze the recursive algorithm

5. How do you analyze the non-recursive algorithm.

Unit-II

1. Explain about quick sort

2. Explain about binary search

3. Explain about binary tree traversal

4. Explain about analysis of prim’s algorithm

5. Explain about analysis of Kruskal’s algorithm

6. Explain about analysis of Dijikstra’s algorithm

Unit-III

1. Explain in detail about Warshall ‘s algorithm

2. Explain in detail about Floyd’s algorithm

3. Explain in detail about Optimal binary search tree

4. Explain in detail about Knapsack problem using dynamic programming

5. Explain in detail about Calculating binomial coefficient using dynamic programming

Unit-IV

1. Explain about n-Queens problem

2. Explain the following terms

(i) Hamiltonian circuit

(ii) Subset sum problem

3 .Explain about Assignment problem with example

4. Explain about knapsack problem

5. Explain about traveling salesman problem

Unit V

1. Explain in detail about P.Np,Np complete problems

2. Explain about approximation algorithm for knapsack problem

3. Explain about approximation algorithm for TSP.

Recent Posts

DAA-QUESTION BANK

பயனுள்ள தளங்கள்

TANCET 2012 Exam Date

New Search Engine

ANNA UNIVERSITY SECOND SEMESTER JUNE/JULY 2012 THEORY AND PRACTICAL EXAMINATION COMMENCEMENT DATE FOR FIRST YEAR SECOND SEMESTER STUDENTS

Posted by welcome at 10:10 AM 0 comments

Email ThisBlogThis!Share to TwitterShare to Facebook

Older Posts Home

Subscribe to: Posts (Atom)

?

+

X

Recommended for you

Loading..

Popular Posts

DAA PREVIOUS YEAR QUESTION PAPER

MCA DEGREE EXAMINATION, May \ June 2009 Second Semester MC1653 – DESIGN AND ANALYSIS OF ALGORITHMS (Regulation 2005) Time : 3 hours Maxim...

MCA SECOND SEM SYALLABUS

MC9221-Mathematical Foundations of Computer Science UNIT I MATRIX ALGEBRA 12 Matrices, Rank of Matrix, Solving System of Equations-Eigen...

OS PREVIOUS YEAR QUESTION PAPER

MCA DEGREE EXAMINATION, May \ June 2008 Second Semester ...

ALGORITHMS LAB

" C Program To Implement Quick Sort" #include"stdio.h" #include"conio.h" int i,j,n,pivot,a[20]; void quick(int a[],int left,int right)...

Blog Archive

▼ 2012 (30)

► February (14)

MCA SECOND SEM SYALLABUS

MCA SECOND SEM LAB SYALLABUS

ALGORITHMS LAB

DAA PREVIOUS YEAR QUESTION PAPER

OOP'S PREVIOUS YEAR QUESTION PAPER

OS PREVIOUS YEAR QUESTION PAPER

SS LAB PROGRAMS

OOP'S VIVA QUESTIONS

புகைகப்பட அட்டக�சம்..

தமி�ழ் செசய்த�த�ள்கள்

TECHNICAL QUESTIONS

ANNA UNIVERSITY CHENNAI RESULTS-2012 (New*)

HOW TO CALCULATE CGPA FOR ANNA UNIVERSITY JANUARY ...

REVALUATION PROCEDURE FOR FIRST SEMESTER JANUARY 2...

▼ March (16)

ACCOUNTS QUESTION PAPER'S

CO-QB

DS-QB

DATA STRUCTURE QUESTION PAPER

DATABASE MANAGEMENT SYSTEMS-QB

PROBLEM SOLVING AND PROGRAMMING

FIRST SEM MATIRIALS DOWNLOAD

BSNL நி�றுவனத்த�ன் குகை�ந்த வ!கை" Tablet

Engineering Students Fail in Maths,Computing

ANNA UNIVERSITY APRIL/MAY 2012 THEORY AND PRACTICA...

ANNA UNIVERSITY FIRST SEMESTER REVALUATION RESULTS...

ANNA UNIVERSITY SECOND SEMESTER JUNE/JULY 2012 THE...

New Search Engine

TANCET 2012 Exam Date

பயனுள்ள தளங்கள்

DAA-QUESTION BANK

Followers

Search

Loading...

E-Mail Subscribe

Top of Form

Bottom of Form

Total Pageviews

957

Submit

Tvinodhmca en_US

Powered by Blogger.