Frequently Asked Question (DS)
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
Define data structure. List the various linear and non-linear data
structures and explain them in brief. DEC-2009
Discuss the basic operations performed with linear structure. DEC-2009
What is recursion? Write a C program for GCD using recursion. DEC-2009
Write an algorithm to convert infix expression to postfix expression
DEC-2009
Write an algorithm for evaluation of postfix expression and evaluation
the following expression showing every status of stack in tabular form.
(i) 5 4 6 + * 4 9 3 / + * (ii) 7 5 2 + * 4 1 1 + / - DEC-2009
Trace the conversion of infix to postfix form in tabular form.
(i) ( A + B * C / D - E + F / G / ( H + I ) )
(ii) ( A + B ) * C + D / ( B + A * C ) + D
(iii)A/B$C+D*E/F-G+H
(iv) (A+B)*D+E/(F+G*D)+C
DEC-2009,Dec 2011, May 2012,summer 2013
Explain Difference between Stack and Queue
Consider the following arithmetic expression P, written in postfix
notation. Translate it in infix notation and evaluate.
P: 12, 7, 3, -, /, 2, 1, 5, +, *, +
DEC-2009, May 2012
Write the implementation procedure of basic primitive operations of
the Queue using:
(i) Linear array (ii) linked list.
DEC-2009
Discuss advantages and disadvantages of linked list over array. DEC 2009,march 2010
Explain Sequential Files and Indexed Sequential Files Structures.
DEC 2009,March-2010,May 2012
Explain the Preorder, Inorder and Postorder traversal techniques of the
binary tree with suitable example. March-2010
Construct the AVL search tree by inserting the following elements in
the order of their occurrence.
64, 1, 44, 26, 13, 110, 98, 85 Summer 2013
Explain matrix and linked list representation of a graph
Discuss following with reference to graphs.
(i) Directed graph (ii) Undirected graph (iii) Degree of vertex
(iv)Null graph Summer 2013
Write an algorithm to implement ascending priority queue using singular
linear linked list which has insert() function such that queue remains ordered
list. Also implement remove() function March -2010 ,May 2012
Write a c/c++ program to add two polynomials represented using doubly
linear linked list. Also write necessary functions to represent polynomial
using doubly linear link list. Summer-2013
Construct a tree for the given inorder and postorder traversals
Inorder DGBAHEICF
Postorder GDBHIEFCA
DEC-2011
Construct binary search tree for the following data
10,3,15,22,6,45,65,23,78,34,5
20
22
23
24
25
26
27
28
29
30
31
32
33
34
Find its inorder, preorder and postorder travesal
DEC-2011
Define height of the binary tree. Define height balanced tree with its
advantages. Construct a height balanced binary tree (AVL tree) for the
following data
42,06,54,62,88,50,22,32,12,33
Dec-2010, March-2010, May 2011, Summer-2013, May 2012
The integers given below are to be inserted in a hash table with 5 locations
using chaining to resolve collisions. Construct hash table and use simplest
hash function.
1,2,3,4,5,10,21,22,33,34,15,32,31,48,49,50 Summer-2013
What are the advantages of Multiway search tree in disc access?
Construct B tree of order 5 for the following data
1,7,6,2,11,5,10,13,12,20,16,24,3,4,18,19,14,25 summer-2013
What is sparse matrix? Explain March-2010,dec-2010,summer-2013,May 2012
Write an algorithm to insert an element into a singly link list
Write an algorithm to delete an element from a doubly link list
Dec-2010,May 2011,Dec-2011
Write a short note on threaded binary tree –March-2010,Dec-2010,May 2012
Write an advantage of link list , doubly link list and circular link list May-2011,May
2012
Give traversal order of following tree into inorder, preorder and postorder.
Explain BFS and DFS with example
May-2011,Dec2010,May 2012
Explain various multiple key access file organization in brief with advantages
and disadvantages of each method.
May 2012
Explain hashing for direct files
May 2012
What do you mean by hashing? What are various hash function. Explain each
one in brief
may-2011,Dec-2010
Differentiate the following terms:
a. Liner and Non-Linear Data Structures
b. Primitive and Non-Primitive Data Structures dec-2010,May-2011,summer-2013,may
2012
Write a Program to perform insert and delete operations on a circular
Queue. dec-2010,May-2011,DEC-2011
Write an algorithm to convert parenthesized infix expression to
postfix.
35
36
37
38
39
40
41
42
44
Define Hash Clash. Explain its resolving techniques. Explain Primary Clustering,
secondary clustering,rehashing and double hashing May 2011,May 2012
What is the advantage of postfix expression over infix expression? Write an
algorithm of postfix expression evaluation summer -2013,DEC-2012
What is the advantage of postfix expression over infix expression? Write an
algorithm of postfix expression evaluation May 2011,summer-2013
Briefly explain advantages of doubly link list over singly link list. Write
function delete (p, &x) which delete the node pointed by p in doubly link list.
May 2012, May 2012
First insert 10 and then insert 24. After these insertions, delete 37 and
then delete 22 from the following binary search tree. Draw the tree after
each operation.
May 2012
(1) Explain insertion operation in the 2-3 tree: (i) if the parent has 2 children
and (ii) if the parent has 3 children. May 2012
Obtain the adjacency matrix A for the following graph. Find A2. Find
outdegree of E and D nodes.
May 2012
Write a short note on Spanning tree
May 2012
Advantages and disadvantages of linked list over array.
What is Tower of Hanoi? Explain it with n=3. May 2012
DEC-2011