Skip to content
InsemAug 20252019 patternBE Comp

Design & Analysis of Algorithms (DAA) SPPU Insem Question Paper Aug 2025

All 4 questions from this SPPU insem paper, as printed. Read them here or open the PDF.

Open the PDFMost repeated DAA questions
Subject code
410241
Pattern
2019 pattern
Exam
Insem
Session
Aug 2025
Max. marks
30
Time
1 Hour
Semester
VII
Paper code
[6580]-545

Printed for: B.E. (Computer Engineering) (Insem.)

Instructions to the candidates

  1. Answer four questions Q1 or Q2, Q3 or Q4.
  2. Neat diagrams must be drawn wherever necessary.
  3. Assume suitable data if necessary.

Questions

  1. Q1

    1. a)

      Why correctness of the algorithm is important? Define loop invariant property and prove the correctness of finding summation of n numbers using loop invariant property.

      Also asked:Oct 2022

      [7]
    2. b)

      Explain in detail any 4 problem solving strategies.

      Also asked:Sep 2024 ·Oct 2022

      [8]

  2. Q2

    1. a)

      What is iterative algorithm? Explain iterative algorithm design issues using examples.

      Also asked:Sep 2024 ·Sep 2023 ·Oct 2022

      [7]
    2. b)

      How to prove that an algorithm is correct? How to prove the correctness of an algorithm using counter example? Give suitable example.

      Also asked:Oct 2022

      [8]

  3. Q3

    1. a)

      Explain P, NP, NP-Hard and NP-Complex problems with example.

      [7]
    2. b)

      This part has equations that don’t show as text. Open the PDF to read it.

      [8]

  4. Q4

    1. a)

      What is NP - complete class problems? How would you prove vertex cover problem is NP - complete problem.

      Also asked:Oct 2022

      [8]
    2. b)

      Explain 3 - SAT problem using an example. 

      [7]