Scribd
Upload
34 views9 pages

Data Structure - PYQ - 2023 DEC - 2017 MAY Comps Sem III - Aeraxia - in

This document is an examination paper for a Data Structure course for Computer Science & Engineering students, dated November 25, 2022. It contains a total of six questions, including compulsory and optional sections, covering topics such as data structure comparisons, AVL trees, circular linked lists, Huffman trees, hashing, and B trees. Each question requires students to perform specific programming tasks or theoretical explanations related to data structures.

Uploaded by

arpitakadam59
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
34 views9 pages

Data Structure - PYQ - 2023 DEC - 2017 MAY Comps Sem III - Aeraxia - in

This document is an examination paper for a Data Structure course for Computer Science & Engineering students, dated November 25, 2022. It contains a total of six questions, including compulsory and optional sections, covering topics such as data structure comparisons, AVL trees, circular linked lists, Huffman trees, hashing, and B trees. Each question requires students to perform specific programming tasks or theoretical explanations related to data structures.

Uploaded by

arpitakadam59
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 9

Paper/ Subject Code: 49373/ Data Structure

1T01873 - S.E. Computer Science & Engineering (Artificial Intelligence & Machine Learning) (R-2019) SEMESTER - 111 / 49373 - Data
Structure
QP CODE: 10012055 DATE: 25/11/2022

(3 Hours) Total Marks: 80

N.B: (1) Question No. 1 is compulsory.


(2) Attempt any three questions out of the remaining five questions.
(3) Figures to the right indicate full marks.
(4) Make suitable assumptions wherever necessary.

Q.1 (a) Compare linear and non-linear data structures. [05]


(b) Explain the advantage of circular queue over linear queue. Write a [05]
function in C language to insert an element in circular queue.
(c) Define binary search tree. Discuss the case of deletion of a node in binary [05]
search tree if node has both the children.
(d) Write a C function to search a node in doubly linked-list. [05]

Q.2 (a) Construct AVL tree for the following sequence: [10]
67,34,90,22,45,11,2,78,37,122
( b) Write algorithm for postfix evaluation. Demonstrate the same step by step [10]
for the expression: 9 6 7 * 2 / -

Q.3 (a) Write a program to perform following operations on a circular linked list: [10]
i) insert a node from the end of the list, ii) delete first node,
iii) count the number of nodes with even values, iv) display the list.
( b) Write a C program to simulate linear queue as linked list. [10]

Q.4 (a) Construct Huffman tree and find the Huffman codes for each symbol [10]

I I I� I I I
given below with frequency of occurrence:

�:::�cy �o 7 �3 ;5 �o
(b) Explain the various ways to represent graph in the memory with example. [05]

(c) Construct binary search tree from given traversal sequences: [05]
In-order traversal D E B A C p G I H J
Pre-order p E D C B A G H I J
traversal

Q.5 (a) Apply linear probing to hash the following values in a hash table of size [10]
11 and find the number of collisions: 67,44,90,12,83,52,23,87,79.
( b) Define topological sorting. Perform topological sorting for the following [10]
graph:

Q.6 (a) Construct a B tree of order 3 by inserting the following given elements as: [10]
77,97,75,64,53,14,26,49,82,59.
Show the B tree at each step of insertion.
( b) Write a function in C for DPS traversal of graph. Explain DPS graph [10]
traversal with suitable example.

�
Aeraxia.in
Voulube

You might also like