Subjects
Applied Mathematics for Electrical Engineering  3130908
Complex Variables and Partial Differential Equations  3130005
Engineering Graphics and Design  3110013
Basic Electronics  3110016
MathematicsII  3110015
Basic Civil Engineering  3110004
Physics Group  II  3110018
Basic Electrical Engineering  3110005
Basic Mechanical Engineering  3110006
Programming for Problem Solving  3110003
Physics Group  I  3110011
MathematicsI  3110014
English  3110002
Environmental Science  3110007
Software Engineering  2160701
Data Structure  2130702
Database Management Systems  2130703
Operating System  2140702
Advanced Java  2160707
Compiler Design  2170701
Data Mining And Business Intelligence  2170715
Information And Network Security  2170709
Mobile Computing And Wireless Communication  2170710
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
Summer2014
BE  Semester
3
Summer  2014

06/04/2014
Total Marks
70
Q1
(a)
Answer the following
10 Marks
(b)
Evaluate the following postfix expression using stack
4 Marks
Q2
(a)
Write an algorithm to convert infix to postfix expression and explain it with example
7 Marks
(b)
Translate the following string into polish notation and trace the content of stack
7 Marks
OR
(b)
(i) Consider a dequeue given below which has LEFT=1, RIGHT=5
7 Marks
Q3
(a)
Write a program in any programming language to concatenate two doubly linked lists.
7 Marks
(b)
Write an algorithm to insert a node in an ordered linked list
7 Marks
OR
Q3
(a)
Give the preorder and Inorder traversal of the tree given in fig 1.
7 Marks
(b)
Given the following traversals create a binary tree from that. Also give the postorder traversal for the same.
7 Marks
Q4
(a)
Explain DFS and BFS with example
7 Marks
(b)
Construct a binary search tree for the following sequence. Also do the inorder and postorder traversal for the same
7 Marks
OR
Q4
(a)
What is a spanning tree? Find the minimum spanning tree for the graph shown in fig 2.
7 Marks
(b)
Write short notes on (i) Height Balanced Tree. (ii) IndexedSequential Files
7 Marks
Q5
(a)
What do you mean by Hashing? Explain any FOUR hashing techniques
7 Marks
(b)
Define the following terms
7 Marks
OR
Q5
(a)
Compare and contrast Prim’s and Kruskal’s algorithm with the help of an example
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