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
MathematicsI  3110014
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
Winter2014
BE  Semester
3
Winter  2014

01/01/2015
Total Marks
70
Q1
(a)
What is data structure? Explain linear and nonlinear data structure with example.
3 Marks
(b)
Discuss best case, average case and worst case time analysis with example.
4 Marks
(c)
Explain PUSH and POP operation of the stack with algorithm.
7 Marks
Q2
(a)
Write an algorithm to perform insert and delete operation on single queue.
7 Marks
(b)
(a) Convert the following infix expression to postfix prefix form.
7 Marks
OR
(b)
Define the following term : Path, Cycle, Degree of vertex, Sibling, Height Balanced Tree, Strictly binary tree, in degree
7 Marks
Q3
(a)
Explain delete operation in doubly link list.
7 Marks
(b)
What is the difference between queue & Dqueue . Explain insertion operation in Dqueue.
7 Marks
OR
Q3
(a)
Write an algorithm to reverse a given single link list.
7 Marks
(b)
Create a binary search tree by inserting following nodes in sequence.
7 Marks
Q4
(a)
Write an algorithm to perform traversal of Binary search tree
7 Marks
(b)
Explain AVL tree with the help of an example also show insertion and deletion with the help of an example.
7 Marks
OR
Q4
(a)
Write a short note on :spanning tree , threaded binary tree
7 Marks
(b)
Explain the basic two techniques for Collisionresolution in Hashing with example. Also explain primary clustering.
7 Marks
Q5
(a)
Compare and contrast Prim’s and Kruskal’s algorithm with the help of an example
7 Marks
(b)
Explain various multiple key access file organization in brief with advantages and disadvantages of each method.
7 Marks
OR
Q5
(a)
What do you mean by Hashing? Explain any FOUR hashing techniques
7 Marks
(b)
Explain and differentiate BFS and DFS graph traversal method with suitable graph.
7 Marks