Skip to content
InsemMar 20262019 patternSE E&TC

Data Structures & Algorithms (DSA) SPPU Insem Question Paper Mar 2026

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

Open the PDF
Subject code
210252
Pattern
2019 pattern
Exam
Insem
Session
Mar 2026
Max. marks
30
Time
1 Hour
Semester
IV
Paper code
APR-26/SE/Insem-261

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

Instructions to the candidates

  1. Solve Q.1 or Q.2 and Q.3 or Q.4.
  2. Neat diagrams must be drawn wherever necessary.
  3. Figures to the right indicate full marks.
  4. Assume Suitable data if necessary.
  5. Use of non-programmable calculator is allowed.

Questions

  1. Q1

    1. a)

      For the given set of values. 11, 33, 20, 88, 79, 98, 44, 68, 66, 22 Create a hash table with size 10 and resolve collision using chaining with replacement. Use the modulus Hash function. (key % size.)

      [6]
    2. b)

      Insert the keys 9, 19, 29, 39, 49, 59, 71 into the Hash Table of size 10. Resolve all collisions using Quadratic probing where hash-function is h (k). h(k) = k mod 10

      [5]
    3. c)

      Write difference between separate chaining and open addressing.

      [4]

  2. Q2

    1. a)

      Solve the following example using extendible hashing. Elements: 28,4,19,1,22,16,12,0,5,7 & Bucket Size: 3

      [6]
    2. b)

      Construct hash table of size 10 using linear probing without replacement strategy for collision resolution. The hash function is h(x)=x%10. Consider slot per bucket is 1. 31, 3, 4, 21, 61, 6, 71, 8, 9, 25.

      [5]
    3. c)

      What is Skip List? What are advantages and disadvantages of skiplist? 2 APR-26/SE/Insem-261

      [4]

  3. Q3

    1. a)

      Write an algorithm for recursive and non-recursive postorder traversal of binary tree and give suitable example.

      [6]
    2. b)

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

      [5]
    3. c)

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

      [4]

  4. Q4

    1. a)

      Write an algorithm to delete node from BST with example.

      [6]
    2. b)

      Explain the storage representation of a binary tree with the following example.

      [5]
    3. c)

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

      [4]