Design & Analysis of Algorithms Important Questions – DAA Imp Qusts

Spread the love
4.2
(11)

Design & Analysis of Algorithms Important Questions Pdf file – DAA Imp Qusts

Please find the attached pdf file of Design & Analysis of Algorithms Important Questions Bank – DAA Imp Qusts

Link – DWHM Question Bank

UNIT – I

  1. Define the term algorithm and state the criteria the algorithm should satisfy?
  2. Define order of an algorithm and the need to analyze the algorithm?
  3. Define asymptotic notations: big ‘Oh’, omega and theta?

For more questions please download the above Pdf file

UNIT – II
1 Describe union operation on sets?
2 Describe find operation on sets?
3 Definea spanning tree and minimal spanning tree?

For more questions please download the above Pdf file

UNIT – III
1 Define greedy method?
2 Define job sequencing with deadlines problem?
3 Define minimum cost spanning tree?

For more questions please download the above Pdf file

UNIT – IV
1 State the principle of Backtracking?
2 Write control abstraction for backtracking?
3 List the applications of backtracking?

For more questions please download the above Pdf file

UNIT – V

  1. Define class P?
  2. Compare NP-hard and NP-completeness?
  3. Define NP- hard problem

For more questions please download the above Pdf file

How useful was this post?

Click on a star to rate it!

Average rating 4.2 / 5. Vote count: 11

No votes so far! Be the first to rate this post.

Leave a Reply

Your email address will not be published. Required fields are marked *