Scribd
Upload
60 views2 pages

667 Question Paper

Parul university DSA previous year paper

Uploaded by

jrtufailmd
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
60 views2 pages

667 Question Paper

Parul university DSA previous year paper

Uploaded by

jrtufailmd
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. Summer 2017 - 18 Examination
Semester: 3 Date: 12/06/2018
Subject Code: 03105203 Time: 2:00 PM to 4:30 PM
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 (All are compulsory) (Each of one mark) (15)
1. 1. Which of the following has search efficiency of Ο (1)?
A - Tree B - Heap C - Hash Table D - Linked-List
2. In a stack, if a user tries to remove an element from empty stack, it is called
A. Underflow
B. Empty collection
C. Overflow
D. Garbage Collection
3. The Worst case complexity of Bubble sort algorithm is
A - O(n) B - O(log n) C - O(n2) D - O(n log n)
4. A linear list of elements in which deletion can be done from one end (front) and insertion can
take place only at the other end (rear) is known as a ?
A - Queue B - Stack
C - Tree D - Linked list
5. Array is a heterogeneous data type.(True/False)
6. What is the worst time complexity of inserting a node in a doubly linked list?
A - O(nlogn) B - O(logn) C - O(n) D - O(1)
7. After evaluation of 3,5,4,*,+ result is ?
8. A data structure where elements can be added or removed at either end but not in the middle is
known as.
9. Any binary tree with height 4 contains maximum ____ nodes.
10. The number of moves required in the Tower of Hanoi problem for k disks is ________.
11. A m*n matrix which contains very few non-zero elements. A matrix contains more number of
ZERO values than NON-ZERO values. Such matrix is known as.
12. A__________ tree contain either 2 or 3 children.
13. Collection of field/item is known as?
14. A tree is said to be ________________ of connected graph G if it is subgraph of G and contains
all the vertices of G but not all edges.
15. The Breadth First Search algorithm has been implemented using the queue data structure.
(True/False)
Q.2 Answer the following questions. (Attempt any three) (15)
A) Define sparse matrix. Find the address of A [2][1] if base address is 1024 for an integer array
A[5][4] in row major order and word size is 2 byte.
B) What is data structure? Differentiate linear and non linear data structure and explain sequential
file organization.
C) Write an algorithm to insert a node at beginning position in singly linked list
D) What is Stack? Write an algorithm for PUSH and POP operation.

Page 1 of 2
Q.3 A) i) Write an algorithm for bubble sort. (03)
ii) Define binary search tree and generate a BST tree for following data. (04)
10,8,9,30,20,50,40,3
B) i) Given Inorder and Preorder traversal , Generate tree and find Postorder traversal (04)
Inorder traversal = {4, 2, 5, 1, 3, 6}
Preorder traversal = {1, 2, 4, 5, 3, 6}
ii) List and explain various hash functions. (04)
OR
B) List applications of stack and Convert 2 * 3 / (2-1) + 5 * 3 infix expression into postfix format (08)
Showing stacks status after every step in tabular form and evaluates that postfix notation.

Q.4 A) Define Directed graph, complete binary tree, indegree and minimum spanning tree. Find (07)
minimum spanning tree for following graph.

Figure 1.
OR
A) Differentiate array and linked list and write an algorithm for deleting a last node from doubly (07)
Linked list.
B) Explain any one Graph representation technique with example. Write an algorithm for binary (08)
Search.

Page 2 of 2

You might also like