Scribd
Upload
87 views1 page

11 18DS PDF

This document contains instructions and questions for a data structures exam. It includes 5 questions with 3 parts each. Question 1 asks about recursion, the difference between stacks and queues, and algorithms for push and pop operations on a stack. Question 2 involves converting infix to postfix expressions using stacks, average case timing analysis of search algorithms, and algorithms for converting infix to postfix expressions or insert/delete in circular queues. Question 3 evaluates a postfix expression using a stack, insertion in linked lists, and binary search tree traversals. Question 4 covers bubble sort, insertion in doubly linked lists, and hashing techniques. Question 5 is about spanning trees, sequential search, and file organizations.

Uploaded by

Urvish
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
87 views1 page

11 18DS PDF

This document contains instructions and questions for a data structures exam. It includes 5 questions with 3 parts each. Question 1 asks about recursion, the difference between stacks and queues, and algorithms for push and pop operations on a stack. Question 2 involves converting infix to postfix expressions using stacks, average case timing analysis of search algorithms, and algorithms for converting infix to postfix expressions or insert/delete in circular queues. Question 3 evaluates a postfix expression using a stack, insertion in linked lists, and binary search tree traversals. Question 4 covers bubble sort, insertion in doubly linked lists, and hashing techniques. Question 5 is about spanning trees, sequential search, and file organizations.

Uploaded by

Urvish
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/ 1

Seat No.: ________ Enrolment No.

___________

GUJARAT TECHNOLOGICAL UNIVERSITY


BE - SEMESTER–III (New) EXAMINATION – WINTER 2018
Subject Code: 2130702 Date:28/11/2018
Subject Name: Data Structure
Time: 10:30 AM TO 01:00 PM Total Marks: 70
Instructions:
1. Attempt all questions.
2. Make suitable assumptions wherever necessary.
3. Figures to the right indicate full marks.

Q.1 (a) What is Recursion? Write a pseudocode in ‘C’ language to find the 03
multiplication of two natural numbers.
(b) Differentiate between Stack and Queue. 04
(c) Write algorithms for Push and Pop operations on a stack. 07
Q.2 (a) Convert Infix Expression A ^ B * C - D + E / F / (G + H) into Postfix 03
expression using stack.
(b) Explain average case timing analysis for Search Algorithm. 04
(c) Write an algorithms to convert Infix Expression(without parenthesis) into 07
Postfix Expression
OR
(c) Write algorithms for Insert and Delete operation in Circular Queue. 07
Q.3 (a) Evaluate the Postfix Expression 6 2 3 + - 3 8 2 / + * 2 $ 3 + using Stack. 03

(b) Write an algorithm for insertion of node at last position in Liner Linked List. 04

(c) Create a Binary Search Tree for the following data and do Inorder, Preorder 07
and Postorder traversal of the tree.
45, 70,30, 60, 15,75,35,55,20,85,80
OR
Q.3 (a) Explain Priority Queue? 03
(b) Write an algorithm for deletion of node in Liner Linked List. 04
(c) What is Binary Search Tree? Construct a binary search tree for the 07
following elements
11,6,14,8,12,15,16,7,9,23
Q.4 (a) Write an algorithm for Bubble sort. 03
(b) Write an algorithm for insertion of a node in Doubly Linked List. 04
(c) What is hashing? Explain Different Hashing techniques in brief. 07
OR
Q.4 (a) Write an algorithm for Selection sort. 03
(b) Write an algorithm for deletion of a node in Doubly Linked List. 04
(c) What is hashing? Explain hash clash and its resolving techniques. 07

Q.5 (a) Explain spanning tree with example. 03


(b) Write an algorithm for Sequential Search. 04
(c) Explain different types of File Organizations and discuss the advantages and 07
disadvantages of each of them.
OR
Q.5 (a) What is Topological sorting? 03
(b) Write an algorithm for Binary Search. 04
(c) Explain Sequential Files and Indexed Sequential Files Structures. 07

*************
1

You might also like