Download GTU (Gujarat Technological University) BE/BTech (Bachelor of Engineering / Bachelor of Technology) 2019 Summer 3rd Sem New 2130702 Data Structure Previous Question Paper
Seat No.: ________ Enrolment No.___________
GUJARAT TECHNOLOGICAL UNIVERSITY
BE - SEMESTER ?III (NEW) EXAMINATION ? SUMMER 2019
Subject Code: 2130702 Date: 04/06/2019
Subject Name: Data Structure
Time: 02:30 PM TO 05:00 PM Total Marks: 70
Instructions:
1. Attempt all questions.
2. Make suitable assumptions wherever necessary.
3. Figures to the right indicate full marks.
MARKS
Q.1 (a) Define Data Structure and differentiate between linear and nonlinear
data structures.
03
(b) Write a pseudocode for PUSH and POP operations of stack. 04
(c) Write algorithm for inserting an element in circular queue and deleting
a node from a singly linked list.
07
Q.2 (a) Illustrate the working of priority queue with suitable example. 03
(b) Write recursive algorithm to compute factorial of a given number.
Which data structure can be used to implement this algorithm?
04
(c) Sort the following numbers in ascending order by applying quick sort.
29 15 11 82 22 17 53 57 4 8
07
OR
(c) ?If no interchanges occurred, then all the elements must be sorted and
no further passes are required.? Which sorting technique works on this
principal? Apply the same sorting technique on the following data to
sort them in ascending order.
11, 15, 13, 14, 2, 8, 10
07
Q.3 (a) Evaluate the following postfix expression in tabular form showing
stack after every step.
7 6 + 4 * 4 10 + - 5 +
03
(b) Write the algorithm for binary search. 04
(c) Explain the working of the Prim?s algorithm with suitable example. 07
OR
Q.3 (a) List the advantages of a doubly linked list over singly linked list. 03
(b) List out graph traversal techniques & explain any one using suitable
example.
04
(c) Apply Djkstra?s algorithm on following graph with Node A as the
starting node.
07
Q.4 (a) Explain Sequential search method with suitable example. 03
(b) Given Inorder and Preorder traversal, find Postorder traversal.
Inorder:Y B K C F A G X E D H Z
Preorder:G B Y A C K F X D E Z H
04
(c) Explain collision in the context of hashing? Discuss collision
resolution techniques.
07
FirstRanker.com - FirstRanker's Choice
1
Seat No.: ________ Enrolment No.___________
GUJARAT TECHNOLOGICAL UNIVERSITY
BE - SEMESTER ?III (NEW) EXAMINATION ? SUMMER 2019
Subject Code: 2130702 Date: 04/06/2019
Subject Name: Data Structure
Time: 02:30 PM TO 05:00 PM Total Marks: 70
Instructions:
1. Attempt all questions.
2. Make suitable assumptions wherever necessary.
3. Figures to the right indicate full marks.
MARKS
Q.1 (a) Define Data Structure and differentiate between linear and nonlinear
data structures.
03
(b) Write a pseudocode for PUSH and POP operations of stack. 04
(c) Write algorithm for inserting an element in circular queue and deleting
a node from a singly linked list.
07
Q.2 (a) Illustrate the working of priority queue with suitable example. 03
(b) Write recursive algorithm to compute factorial of a given number.
Which data structure can be used to implement this algorithm?
04
(c) Sort the following numbers in ascending order by applying quick sort.
29 15 11 82 22 17 53 57 4 8
07
OR
(c) ?If no interchanges occurred, then all the elements must be sorted and
no further passes are required.? Which sorting technique works on this
principal? Apply the same sorting technique on the following data to
sort them in ascending order.
11, 15, 13, 14, 2, 8, 10
07
Q.3 (a) Evaluate the following postfix expression in tabular form showing
stack after every step.
7 6 + 4 * 4 10 + - 5 +
03
(b) Write the algorithm for binary search. 04
(c) Explain the working of the Prim?s algorithm with suitable example. 07
OR
Q.3 (a) List the advantages of a doubly linked list over singly linked list. 03
(b) List out graph traversal techniques & explain any one using suitable
example.
04
(c) Apply Djkstra?s algorithm on following graph with Node A as the
starting node.
07
Q.4 (a) Explain Sequential search method with suitable example. 03
(b) Given Inorder and Preorder traversal, find Postorder traversal.
Inorder:Y B K C F A G X E D H Z
Preorder:G B Y A C K F X D E Z H
04
(c) Explain collision in the context of hashing? Discuss collision
resolution techniques.
07
2
OR
Q.4 (a) Explain indexing structure for index files. 03
(b) Draw a Binary expression tree for the following and perform preorder
traversal:
a * ( b + c ) + ( d * e ) / f + g * h
04
(c) Explain insert and delete operations in AVL trees with suitable
examples.
07
Q.5 (a) Define: i) Cyclic Graph ii) Siblings iii) Strictly Binary Tree 03
(b) Explain Threaded binary trees with suitable examples. 04
(c) Write a C program to reverse a string using stack. 07
OR
Q.5 (a) Explain Sequential file organizations and list its advantages and
disadvantages.
03
(b) Write an algorithm for insertion sort. 04
(c) Discuss different representations of a graph. 07
*************
FirstRanker.com - FirstRanker's Choice
This post was last modified on 20 February 2020