Skip to content
InsemOct 20222019 patternBE Comp

Design & Analysis of Algorithms (DAA) SPPU Insem Question Paper Oct 2022

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
Oct 2022
Max. marks
30
Time
1 Hour
Semester
VII
Paper code
Oct-22/BE/Insem-41

Printed for: B.E. (Computer Engineering)

Instructions to the candidates

  1. Answer the question of Q.1 or Q.2, Q.3 or Q.4.
  2. Neat diagrams must be drawn whenever necessary.
  3. Figures to the right indicate full marks.
  4. 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:Aug 2025

      [8]
    2. b)

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

      Also asked:Aug 2025 ·Sep 2024 ·Sep 2023

      [7]

  2. Q2

    1. a)

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

      Also asked:Aug 2025

      [7]
    2. b)

      Write a short note on any 4 problem solving strategies.

      Also asked:Aug 2025 ·Sep 2024

      [8]

  3. Q3

    1. a)

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

      [8]
    2. b)

      • Explain P, NP, NP-Hard and NP-Complete problems with examples. • Explain 3-SAT problem using an example. Why is SAT so important in theoretical computer science?

      [7]

  4. Q4

    1. a)

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

      Also asked:Aug 2025

      [8]
    2. b)

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

      [7]