Subjects
Advanced Java  2160707
Compiler Design  2170701
Data Mining And Business Intelligence  2170715
Data Structure  2130702
Database Management Systems  2130703
Information And Network Security  2170709
Mobile Computing And Wireless Communication  2170710
Operating System  2140702
Software Engineering  2160701
Theory Of Computation  2160704
Semester
Semester  1
Semester  2
Semester  3
Semester  4
Semester  5
Semester  6
Semester  7
Semester  8
Data Structure
(2130702)
DS2130702
Winter2015
BE  Semester
3
Winter  2015

01/02/2016
Total Marks
70
Q1
(a)
What does abstract data type means? Briefly explain linear and non linear data structures.
7 Marks
Q1
(b)
Given a two dimensional array A1(1:8, 7:14) stored in rowmajor order with base address 100 and size of each element is 4 bytes, find address of the element A1(4, 12).
7 Marks
Q2
(a)
Write an algorithm to implement PUSH and POP Operations on Stack.
7 Marks
Q2
(b)
Write an algorithm for evaluation of postfix expression and evaluate the following expression showing every status of stack in tabular form.
7 Marks
Q2
OR
Q2
(b)
Enlist difference between recursive and iterative algorithms. Write any one recursive function showing the stack contents while function call and return.
7 Marks
Q3
(a)
Write a program to perform insert and delete routines on a queue.
7 Marks
Q3
(b)
Write advantages and disadvantages of linked list, doubly linked list and circular linked list with example.
7 Marks
Q3
OR
Q3
(a)
Explain priority queue and dequeue. Write an algorithm/program for insert routine in input restricted dequeues.
7 Marks
Q3
(b)
Write a program to search an element in a linked list.
7 Marks
Q4
(a)
Create a Binary Search Tree for the following data and do inorder, Preorder and Postorder traversal of the tree.
7 Marks
Q4
(b)
Define the following with example :
7 Marks
Q4
OR
Q4
(a)
What is Binary Search Tree? Write recursive algorithm/program to implement inorder traversal of the Binary Search Tree.
7 Marks
Q4
(b)
Define height balanced tree. Construct a height balanced binary tree (AVL tree) for the following data
7 Marks
Q5
(a)
What is hashing? Briefly explain various methods of hashing.
7 Marks
Q5
(b)
Explain with example DFS and BFS traversal of graph.
7 Marks
Q5
OR
Q5
(a)
What is File Structure? Explain any one File Structure in detail.
7 Marks
Q5
(b)
Show how graph can be represented using example? How path matrix can be found out using adjacency matrix
7 Marks