Skip to content
InsemSep 20232019 patternBE Comp

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

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 2023
Max. marks
30
Time
1 Hour
Semester
VII
Paper code
[6188]-141

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

Instructions to the candidates

  1. Answer the questions Q.1 or Q.2; Q.3 or Q.4.
  2. Neat diagrams must be drawn wherever necessary.
  3. Figures to the right indictae full marks.
  4. Assume suitable data, if necessary.

Questions

  1. Q1

    1. a)

      Given the fastest computer and hypothetically infinite memory, do we still need to study algorithms? Justify.

      [2]
    2. b)

      How can we related algorithms to technology? Briefly explain.

      [6]
    3. c)

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

      [7]

  2. Q2

    1. a)

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

      Also asked:Aug 2025 ·Sep 2024 ·Oct 2022

      [8]
    2. b)

      Consider the following algorithm to find the square of a number: int sqr(int n) { if (n= = 0) return 0; else return (2n+sqr(n-1)-1) Prove the correctness of this algorithm using principle of mathematical induction or otherwise.

      [7]

  3. Q3

    1. a)

      Briefly explain P and NP problems in the context of complexity theory. Give suitable example.

      [8]
    2. b)

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

      [5]
    3. c)

      Comment on the statement “Best case analysis of algorithm may not give clear idea of performance”

      [2]

  4. Q4

    1. a)

      What is SAT AND 3-SAT problem? Prove that 3-SAT problem is NP complete.

      [8]
    2. b)

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

      [7]