Skip to content
EndsemDec 20252019 patternSE Comp

Data Structures (DS) SPPU Endsem Question Paper Dec 2025

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

Open the PDF
Subject code
210242
Pattern
2019 pattern
Exam
Endsem
Session
Dec 2025
Max. marks
70
Time
2½ Hours
Semester
III
Paper code
[6582]-41

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

Instructions to the candidates

  1. Answer to the questions (Q.No. 1 or Q.No. 2, Q.No. 3 or Q.No. 4, Q.No. 5 or Q.No. 6, Q.No. 7 or Q.No. 8.)
  2. Assume suitable data, if necessary.
  3. Draw neat labelled diagram wherever necessary.
  4. Figures to the right indicate full marks.

Questions

  1. Q1

    1. a)

      Given numbers 49, 47, 37, 29, 26, 10, 65, 78, 21, 49. Sort stepwise using radix sort. When it is appropriate to use radix sort? Write time Complexity.

      [9]
    2. b)

      Write pseudocode/Function for Binary Search algorithm. Explain with suitable example.

      [9]

  2. Q2

    1. a)

      Write short note on i) Binary Search ii) Index sequential search iii) Linear Search

      [9]
    2. b)

      Explain Quick sort technique with suitable solved example. Comment on time complexity.

      [9]

  3. Q3

    1. a)

      Write pseudo code/function using Doubly Linked List of Employees (Emp-number, name and age stored in every node) for: i) Search given Emp_no and update the age ii) Add given Emp_no after specified number in the list

      [9]
    2. b)

      Write and explain use of Generalized linked list for representation of multivariable polynomial with suitable example. Explain node structure.

      [9]

  4. Q4

    1. a)

      How polynomial can be represented using Singly Linked List? Write pseudocode to perform addition of two polynomials using singly linked lists into third list.

      [9]
    2. b)

      Draw and explain structure of Circular Doubly Linked List. What are advantages of Circular Linked List over Singly Linked List? Write pseudocode/function for insertion of a node in Circular doubly linked lists. 2

      [9]

  5. Q5

    1. a)

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

      [8]
    2. b)

      Write short notes on i) Backtracking ii) Tree Recursion iii) Tail recursion.

      [9]

  6. Q6

    1. a)

      What are polish notations? What is the need to convert infix expression into postfix form? Explain postfix evaluation with suitable example.

      [8]
    2. b)

      Write pseudo-C/C++ code to implement stack using Singly linked list with overflow and underflow conditions.

      Also asked:May 2024

      [9]

  7. Q7

    1. a)

      Write short notes on: i) Comparison of Linear queue and Circular queue ii) Priority queue

      [8]
    2. b)

      What is Doubly Ended Queue? Which two data structures are combined in it? Explain input restricted and output restricted queue with operations.

      [9]

  8. Q8

    1. a)

      Write short note on: i) Circular Queue using Singly Linked List ii) Descending priority queue and it’s applications

      [8]
    2. b)

      Draw and explain implementation of Doubly ended Queue using Doubly Linked List. Explain Add, Remove operations. 

      [9]