Skip to content
InsemOct 20242019 patternSE Comp

Data Structures (DS) SPPU Insem Question Paper Oct 2024

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

Open the PDF
Subject code
210242
Pattern
2019 pattern
Exam
Insem
Session
Oct 2024
Max. marks
30
Time
1 Hour
Semester
III
Paper code
[6359]-520

Printed for: S.E. (Computer Engineering/ AI & DS /Computer Science )

Instructions to the candidates

  1. Attempt question Q1 or Q2, Q3 or Q4.
  2. Draw neat & labelled diagrams if necessary.
  3. Assume suitable data, if necessary.
  4. Figures to the right side indicates full marks.

Questions

  1. Q1

    1. a)

      Discuss any six classes of time complexity with sample code.

      [6]
    2. b)

      Differentiate between: i) Static and Dynamic Data structures ii) Persistent and Ephemeral Data Structures

      [5]
    3. c)

      Explain step count method with the help of suitable example.

      [4]

  2. Q2

    1. a)

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

      [6]
    2. b)

      How asymptotic notations plays important role in defining complexity class? Explain Big-Oh, Big-theta and Big-Omega notation with graphs denoting growth rate.

      [5]
    3. c)

      What is algorithmic strategy? Explain divide & conquer and greedy strategy with example.

      [4]

  3. Q3

    1. a)

      How can we find transpose of sparse matrix in linear time? Give pseudocode for his method.

      [6]
    2. b)

      Given an array,arr [1.......10] [1......15] with base value 100 and the size of each element is 1 Byte in memory. Find the address of arr[8] [6] with the help of row-major technique and column major technique.

      [5]
    3. c)

      Compare and contrast row major and column major technique with the help of any matrix.

      [4]

  4. Q4

    1. a)

      Write an algorithm to calculate sum of numbers stored in array and illustrate all characteristics of algorithm for the same.

      [6]
    2. b)

      Give a pseudocode for polynomial addition.

      [5]
    3. c)

      What is an ADT? Write ADT operations for array. 

      [4]