Skip to content
InsemSep 20242019 patternBE Comp

Design & Analysis of Algorithms (DAA) SPPU Insem Question Paper Sep 2024

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
Sep 2024
Max. marks
30
Time
1 Hour
Semester
VII
Paper code
[6361]-41

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

Instructions to the candidates

  1. Answer Q.1 or Q.2, Q.3 or Q.4.
  2. Neat diagrams must be drawn wherever necessary.
  3. Figure to right indicate full marks.
  4. Assume suitable data, if necessary.

Questions

  1. Q1

    1. a)

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

      [7]
    2. b)

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

      Also asked:Aug 2025 ·Sep 2023 ·Oct 2022

      [8]

  2. Q2

    1. a)

      Prove the correctness of the following algorithm, which finds the factorial of a given number. int fact (int n) { if (n==0) then return 1; else return (n * fact(n-1)); }

      [7]
    2. b)

      Write a short note on any four problem solving strategies. 2

      Also asked:Aug 2025 ·Oct 2022

      [8]

  3. Q3

    1. a)

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

      [6]
    2. b)

      If an algorithm has a time complexity of both O(f(n)) and  g(n)) for the same function f(n) and g(n), then what does it imply? Explain.

      [3]
    3. c)

      What do  and  notations mean? When do we use O notation?

      [6]

  4. Q4

    1. a)

      What is polynomial time reducibility? What is its importance in computational complexity theory?

      [6]
    2. b)

      What do understand by NP complete and NP hard problems? Give examples.

      [6]
    3. c)

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

      [3]