Skip to content
EndsemMay 20242019 patternSE AI&DS

Data Structures (DS) SPPU Endsem Question Paper May 2024

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
May 2024
Max. marks
70
Time
2½ Hours
Semester
III
Paper code
[6261]-41

Printed for: S.E. (Computer Engineering) (Artificial Intelligence & Data Science)

Instructions to the candidates

  1. Attempt question Q1 or Q2, Q3 or Q4, Q5 or Q6, Q7 or Q8.
  2. Figures to the right indicate full marks.
  3. Assume suitable data if necessary.
  4. Neat diagrams must be drawn wherever necessary.

Questions

  1. Q1

    1. a)

      Sort given array by using bubble sort method: 64, 34, 25, 12, 22, 11, 90. Show step by step execution for all the passes highlighting “swap” and “No Swap” situations. How many passes are required to sort an array of N elements using bubble sort?

      [9]
    2. b)

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

      [9]

  2. Q2

    1. a)

      Enlist different searching methods. Write short note on i) Fibonacci Search ii) Index Sequential Search

      [9]
    2. b)

      Sort given array by using selection sort method 50, 23, 03, 18, 9, 01, 70, 21, 20, 6, 40, 04. Show step by step execution of all passes. What is the best and worst case time complexity of selection sort?

      [9]

  3. Q3

    1. a)

      Write pseudo code for following function using Doubly Linked List of integer numbers i) Insert given value as last value in the list. Draw diagram of operation. ii) Delete first node from the list. Draw diagram of operation. iii) Delete last node from the list. Draw diagram of operation.

      [9]
    2. b)

      Write and explain node structure of i) Generalized linked list. ii) Circularly Singly Linked List. Draw and explain insertion of value in Circularly Singly Linked List with example. 2

      [9]

  4. Q4

    1. a)

      Write pseudocode to perform merging of two sorted singly linked lists of integers into third list. Write complexity of it.

      [9]
    2. b)

      Write and explain node structure of Generalized linked list for representing multiple variable polynomial. Represent given polynomial graphically using Generalized Linked List: 5x 7 + 7xy 6 + 11xz.

      [9]

  5. Q5

    1. a)

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

      [8]
    2. b)

      Explain with example three different types of recursion.

      [9]

  6. Q6

    1. a)

      What is infix, prefix and postfix expression? Give example of each. Explain evaluation of postfix expression with suitable example expression and assume values for variables used to solve it.

      [8]
    2. b)

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

      Also asked:Dec 2025

      [9]

  7. Q7

    1. a)

      What are advantages of Circular Queue over Linear Queue using static memory allocation? Write pseudocode to add and remove element from Circular Queue along with Queue Full and Empty condition.

      [8]
    2. b)

      Draw and explain implementation of Linear Queue using Singly Linked List. Explain Add, Remove, Queue Full and Queue Empty operations.

      [9]

  8. Q8

    1. a)

      What is Doubly Ended Queue? Draw Diagram with labelling four basic operations at appropriate places. Which two data structures are combined in it and how?

      [6]
    2. b)

      Draw and explain Priority Queue? State any real life application.

      [6]
    3. c)

      Write pseudocode for Linear Queue Implementation using array.  eeee

      [5]