Rungta College of Engineering & Technology, Bhilai Rungta College of Engineering & Technology, Bhilai

1st Mid Semester Examination, 2020 1st Mid Semester Examination, 2020
Course: BE Branch: CSE Semester: 4th [A, B] Course: BE Branch: CSE Semester: 4th [A, B]
Sub. Name: Data Structures Sub. Name: Data Structures
Duration: 01:30 hrs Max Marks: 40 Min Passing Marks: 14 Duration: 01:30 hrs Max Marks: 40 Min Passing Marks: 14

Note: Part (a) of each question is compulsory and attempt any two parts Note: Part (a) of each question is compulsory and attempt any two parts
from (b), (c) and (d). from (b), (c) and (d).
Q1. Q1.
a) Define data structure and also classify the data structure. [2] e) Define data structure and also classify the data structure. [2]
b) What is sparse matrix? Write an algorithm to create sparse matrix. f) What is sparse matrix? Write an algorithm to create sparse matrix.
How it is represented in memory? [9] How it is represented in memory? [9]
c) Explain deletion from a linked list with example. [9] g) Explain deletion from a linked list with example. [9]
d) Write an algorithm for insertion and deletion in one dimensional h) Write an algorithm for insertion and deletion in one dimensional
array. [9] array. [9]

Q2. Q2.
a) Define underflow and overflow. [2] e) Define underflow and overflow. [2]
b) Explain priority queue and also explain how it is implemented?[9] f) Explain priority queue and also explain how it is implemented?[9]
c) Explain tower of Hanoi problem. Also write recursive algorithm g) Explain tower of Hanoi problem. Also write recursive algorithm
to solve it for N disks. [9] to solve it for N disks. [9]
d) Convert following infix expression to postfix expression h) Convert following infix expression to postfix expression
A+(B*C-(D/E↑F)*G)*H [9] A+(B*C-(D/E↑F)*G)*H [9]