Data Structures
Data Structures
2. List out the areas in which data structures are applied extensively?
3. What are the major data structures used in the following areas : RDBMS, Network
data model & Hierarchical data model.
RDBMS – Array (i.e. Array of structures)
Network data model – Graph
Hierarchical data model – Trees
4. If you are using C language to implement the heterogeneous linked list, what pointer
type will you use?
The heterogeneous linked list contains different data types in its nodes and we
need a link, pointer to connect them. It is not possible to use ordinary pointers for this. So
we go for void pointer. Void pointer is capable of storing pointer to any type as it is a
generic pointer type.
7. What are the notations used in Evaluation of Arithmetic Expressions using prefix and
postfix forms?
Polish and Reverse Polish notations.
Null Branches
i ii iii iv v
In general:
If there are n nodes, there exist 2n-n different trees.
14. List out few of the applications that make use of Multilinked Structures?
Sparse matrix, Index generation.
16. What is the type of the algorithm used in solving the 8 Queens problem?
Backtracking
18. What is the bucket size, when the overlapping and collision occur at same time?
One. If there is only one entry possible in the bucket, when the collision occurs,
there is no way to accommodate the colliding value. This results in the overlapping of
values.
19. Traverse the given tree using Inorder, Preorder and Postorder traversals.
Given tree:
A
B C
D E F G
H I J
Inorder : D H B E A F C I G J
Preorder: A B D H E C F G I J
Postorder: H D E B F I J G C A
20. There are 8, 15, 13, 14 nodes were there in 4 different trees. Which of them could
have formed a full binary tree?
15.
In general:
There are 2n-1 nodes in a full binary tree.
By the method of elimination:
Full binary trees contain odd number of nodes. So there cannot be full
binary trees with 8 or 14 nodes, so rejected. With 13 nodes you can form a complete
binary tree but not a full binary tree. So the correct answer is 15.
Note:
Full and Complete binary trees are different. All full binary trees are complete
binary trees but not vice versa.
21. In the given binary tree, using array you can store the node 4 at which location?
2 3
1 2 3 - - 4 - - 5
where LCn means Left Child of node n and RCn means Right Child of node n
22. Sort the given values using Quick Sort?
65 70 75 80 85 60 55 50 45
Sorting takes place from the pivot value, which is the first value of the given
elements, this is marked bold. The values at the left pointer and right pointer are indicated
using L and R respectively.
65 70L 75 80 85 60 55 50 45R
Since pivot is not yet changed the same process is continued after interchanging the
values at L and R positions
65 45 75 L 80 85 60 55 50 R 70
65 45 50 80 L 85 60 55 R 75 70
65 45 50 55 85 L 60 R 80 75 70
65 45 50 55 60 R 85 L 80 75 70
When the L and R pointers cross each other the pivot value is interchanged with the value
at right pointer. If the pivot is changed it means that the pivot has occupied its original
position in the sorted order (shown in bold italics) and hence two different arrays are
formed, one from start of the original array to the pivot position-1 and the other from
pivot position+1 to end.
60 L 45 50 55 R 65 85 L 80 75 70 R
55 L 45 50 R 60 65 70 R 80 L 75 85
50 L 45 R 55 60 65 70 80 L 75 R 85
45 50 55 60 65 70 75 80 85
Merge Sort
1. Divide Step
If given array A has zero or one element, return S; it is already sorted. Otherwise,
divide A into two arrays, A1 and A2, each containing about half of the elements of
A.
2. Recursion Step
Recursively sort array A1 and A2.
3. Conquer Step
Combine the elements back in A by merging the sorted arrays A1 and A2 into a
sorted sequence.
We can visualize Merge-sort by means of binary tree where each node of the tree
represents a recursive call and each external nodes represent individual elements of given
array A. Such a tree is called Merge-sort tree. The heart of the Merge-sort algorithm is
conquer step, which merge two sorted sequences into a single sorted sequence.
23. For the given graph, draw the DFS and BFS?
BFS: AXGHPEMYJ
DFS: AXHPEYMJG
24. Classify the Hashing Functions based on the various methods by which the key value
is found.
Direct method,
Subtraction method,
Modulo-Division method,
Digit-Extraction method,
Mid-Square method,
Folding method,
Pseudo-random method.
25. What are the types of Collision Resolution Techniques and the methods used in each
of the type?
Open addressing (closed hashing),
The methods used include:
Overflow block,
Closed addressing (open hashing)
The methods used include:
Linked list,
Binary tree…
26. In RDBMS, what is the efficient data structure used in the internal storage
representation?
B+ tree. Because in B+ tree, all the data is stored only in leaf nodes, that makes
searching easier. This corresponds to the records that shall be stored in leaf nodes.
27. Draw the B-tree of order 3 created by inserting the following data arriving in
sequence – 92 24 6 7 11 8 22 4 5 16 19 20 78
11 -
5 7 19 24
4 - 6 - 8 - 16 - 20 22 78 92
28. Of the following tree structure, which is, efficient considering space and
time complexities?
(a) Incomplete Binary Tree
(b) Complete Binary Tree
(c) Full Binary Tree
30. Does the minimum spanning tree of a graph give the shortest distance between any 2
specified nodes?
No.
Minimal spanning tree assures that the total weight of the tree is kept at its
minimum. But it doesn’t mean that the distance between any two nodes involved in the
minimum-spanning tree is minimum.
31. Convert the given graph with weighted edges to minimal spanning tree.
600
1 3 200
612
410 310
2985 5
400
2 4
1421
1 3
200
410 612 310
2 4 5
A * B - (C + D) * (P / Q)
* *
A B + /
C D P Q
35. For the following COBOL code, draw the Binary tree?
01 STUDENT_REC.
02 NAME.
03 FIRST_NAME PIC X(10).
03 LAST_NAME PIC X(10).
02 YEAR_OF_STUDY.
03 FIRST_SEM PIC XX.
03 SECOND_SEM PIC XX.
01
STUDENT_REC
02 02
NAME YEAR_OF_STUDY
03 03 03 03
FIRST_NAME LAST_NAME FIRST_SEM SECOND_SEM
Data Structures
~~~~~~~~~~~~~~~~