Professional Documents
Culture Documents
DAA Unit Wise Importtant Questions
DAA Unit Wise Importtant Questions
Unit-I
Unit-II
1) Develop the algorithm for Find using collapsing rule with an example.
2) Develop the algorithm for Union using weighting rule with an example.
3) For the following graph identify the articulation points and draw the bi connected
components.
1
4
1
2 3
8
1 1
6
5 7
1
4) Explain the usefulness of the following fundamental operations on set
i) Find ii) Delete iii) Union iv) Insert
5) Two sets S1 and S2 are given below
a) Draw disjoints sets S1 and S2 using trees.
b) Draw disjoint sets S3 using trees such that S3=s1 U S2
c) Draw disjoint sets S4 using trees such that S4=S2 U S1
d) Give pointer representation of S1, S2 , S3 and S4.
Unit-IV
1) Find the optimal solution to the job sequencing with deadlines for the following
n=5, (P1,P2,P3,P4,P5)=(20,15,10,5,1) (d1,d2,d3,d4,d5)=(2,2,1,3,3).
UNIT-VIII
1) What are differences between NP-Hard and NP-Complete classes? Explain with
examples.
2) Briefly explain the concepts of the NP-Hard and NP-Complete?
3) Explain non deterministic algorithms? Give some examples?
4) Explain the P, NP, NP-Hard and NP- complete classes? Give relationship between them
5) Write short notes on Cook’s theorem.
6) Explain about different types of NP problem.