0% found this document useful (0 votes)
70 views2 pages

883 Question Paper

1. This document contains instructions and questions for a Data Structures exam taken on November 28, 2018. It has 4 sections with multiple choice, short answer, and long answer questions. 2. Section 1 contains 15 multiple choice questions testing knowledge of arrays, linked lists, stacks, queues, sorting, searching, and other data structure topics. 3. Section 2 has 3 short answer questions asking about queue problems, linked list searching, and bubble sort. 4. Section 3 contains problems on postfix expression evaluation, circular linked list operations, and binary search tree traversals. 5. Section 4 asks about directed graphs, minimum spanning trees, binary search trees, hashing, and collision resolution

Uploaded by

Saurabh Bodke
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
0% found this document useful (0 votes)
70 views2 pages

883 Question Paper

1. This document contains instructions and questions for a Data Structures exam taken on November 28, 2018. It has 4 sections with multiple choice, short answer, and long answer questions. 2. Section 1 contains 15 multiple choice questions testing knowledge of arrays, linked lists, stacks, queues, sorting, searching, and other data structure topics. 3. Section 2 has 3 short answer questions asking about queue problems, linked list searching, and bubble sort. 4. Section 3 contains problems on postfix expression evaluation, circular linked list operations, and binary search tree traversals. 5. Section 4 asks about directed graphs, minimum spanning trees, binary search trees, hashing, and collision resolution

Uploaded by

Saurabh Bodke
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/ 2

Seat No: ______________ Enrollment No: ____________________

PARUL UNIVERSITY
FACULTY OF ENGINEERING & TECHNOLOGY
B.Tech. Winter 2018-19 Examination
Semester: 3 Date: 28/11/2018
Subject Code: 03105203 Time: 02:00pm to 04:30pm
Subject Name: Data Structures Total Marks: 60

Instructions:
1. All questions are compulsory.
2. Figures to the right indicate full marks.
3. Make suitable assumptions wherever necessary.
4. Start new question on new page.

Q.1 Objective Type Questions - (Each of one mark) (15)


1. Which of following statements are incorrect about an array?

i. The array int num[26]; can store 26 elements.


ii. The expression num[1] designates the very first element in the array
iii. It is necessary to initialize the array at the time of declaration.
iv. The declaration num[SIZE] is allowed if SIZE is a macro
a) i c) i, iv
b) ii, iii d) ii, iv
2. The statement head->Link->Link->Link->link terminates a linked list after

a) 2nd node b) 3rd node


c) 4th node d) 5th node
3. The total number of comparisons in selection sort are
a) O(n logn) b) O(2n)
2
c) O(n ) d) O(n)
4. Which of the following applications may not use a stack?

a) A parentheses balancing program. b) Infix to postfix conversion.


c) Recursion. d) CPU scheduling.
5. The initial configuration of the queue is having the elements ‘x, y, z, a’ forming a queue with size
4 to get the new configuration ‘a, z, y, x’ one needs a minimum of
a) 3 additions and 4 deletion b) 3 deletions and 4 additions
c) 3 deletions and 3 additions d) 4 deletions and 4 additions.
6. Selection sort first finds the largest element in the list and put it in the first position.
TRUE/FALSE
7. The in-order traversing of binary search tree is always in _____________ order.
8. Every tree is a graph. TRUE/FALSE
9. Stack is also called a _________________ collection.
10. The best case time complexity of binary search is______________.
11. What is the worst case time complexity for searching a node in a singly link list.

a) O(n) b) O(nlogn)
c) O(n2 ) d) O(logn)
12. Hashing is a searching process? TRUE/FALSE
13. The number of moves required in the Tower of Hanoi problem for k disks is ___________.
14. FCFS scheduling is an application of queue. TRUE/FALSE

Page 1 of 2
15. What is data structure?
Q.2 Answer the following questions. (Attempt any three) (15)
A) What is the problem in simple queue? Explain circular queue with an example.
B) Write an algorithm or a function to search a node in singly link list.
C) Write the algorithm for push and pop operations in stack.
D) Write a procedure for Bubble sort. Sort the following elements using Bubble sort.
31, 22, 11, 4, 55, 56, 3, 11
Q.3 A) Transform the following expression to postfix and evaluate postfix expression by assuming (07)
A=1,B=2,C=3,D=4,E=6,F=6,G=1,I=3 and J=3

A +B-C*D/E +F*G/(I+J)

B) Write an algorithm to perform each of the following operations on circular link List using header (08)
node.
1) add node at beginning
2) add node at the end
3) delete a node which contain element x
OR
B) The post-order and Inorder traversal of binary search tree is: (08)
post-order: 5, 10, 35, 30, 40, 25, 55, 65, 70, 60, 50.
Inorder: 5,10,25,30,35,40,50,55,60,65,70.
Construct a binary search tree and find the pre-order traversal of the BST.
Q.4 (a) A) Define Directed graph, spanning tree and minimum spanning tree. Find minimum spanning (07)
tree for the graph using kruskal’s algorithm.

OR
A) What is a drawback of BST? How we can overcome that? Construct the AVL search tree by (07)
inserting the following elements in the order of their occurrence: 64, 1, 44, 26, 13, 110, 98, 85

B) What is hashing? Explain all open addressing collision resolution methods with suitable example. (08)

Page 2 of 2

You might also like