1. What is data structure?
A
data structure is a way of organizing data that considers not only the items
stored, but also their relationship to each other. Advance knowledge about the
relationship between data items allows designing of efficient algorithms for
the manipulation of data.
2. List out the areas in which data structures
are applied extensively?
Ø
Compiler Design,
Ø
Operating System,
Ø
Database Management System,
Ø
Statistical analysis package,
Ø
Numerical Analysis,
Ø
Graphics,
Ø
Artificial Intelligence,
Ø
Simulation
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.
5. Minimum number of queues needed to implement
the priority queue?
Two.
One queue is used for actual storing of data and another for storing
priorities.
6. What is the data structures used to perform
recursion?
Stack.
Because of its LIFO (Last In First Out) property it remembers its ‘caller’ so
knows whom to return when the function has to return. Recursion makes use of
system stack for storing the return addresses of the function calls.
Every
recursive function has its equivalent iterative (non-recursive) function.
Even when such equivalent iterative procedures are written, explicit stack is
to be used.
7. What are the notations used in Evaluation of
Arithmetic Expressions using prefix and postfix forms?
Polish and Reverse Polish notations.
8. Convert the expression ((A + B) * C – (D – E) ^ (F + G)) to equivalent Prefix
and Postfix notations.
Prefix Notation:
^ - * +ABC - DE + FG
Postfix
Notation:
AB + C * DE - - FG + ^
9. Sorting is not possible by using which of
the following methods?
(a)
Insertion
(b)
Selection
(c)
Exchange
(d)
Deletion
(d) Deletion.
Using
insertion we can perform insertion sort, using selection we can perform
selection sort, using exchange we can perform the bubble sort (and other
similar sorting methods). But no sorting method can be done just using
deletion.
10. What are the methods available in storing
sequential files ?
Ø
Straight merging,
Ø
Natural merging,
Ø
Polyphase sort,
Ø
Distribution of Initial runs.
11. List out few of the Application of tree
data-structure?
Ø
The manipulation of Arithmetic expression,
Ø
Symbol Table construction,
Ø
Syntax analysis.
12. List out few of the applications that make
use of Multilinked Structures?
Ø
Sparse matrix,
Ø
Index generation.
13. In tree construction which is the suitable
efficient data structure?
(a)
Array (b) Linked list (c) Stack (d) Queue (e) none
(b)
Linked list
14. What is the type of the algorithm used in
solving the 8 Queens problem?
Backtracking
15. In an AVL tree, at what condition the
balancing is to be done?
If the ‘pivotal value’ (or the
‘Height factor’) is greater than 1 or less than –1.
16. 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.
17. 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
|
In the next
pass we get the sorted form of the array.
|
45
|
50
|
55
|
60
|
65
|
70
|
75
|
80
|
85
|
18. 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.
19. 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…
20. 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.
21. 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
(b) Complete Binary Tree.
By the method of elimination:
Full binary
tree loses its nature when operations of insertions and deletions are done. For
incomplete binary trees, extra storage is required and overhead of NULL node
checking takes place. So complete binary tree is the better one since the
property of complete binary tree is maintained even after operations like
additions and deletions are done on it.
22. What is a spanning Tree?
A spanning tree is a tree associated
with a network. All the nodes of the graph appear on the tree once. A minimum
spanning tree is a spanning tree organized so that the total edge weight
between nodes is minimized.
23. 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.
32. Which is the simplest file structure?
(a) Sequential
(b) Indexed
(c) Random
(a) Sequential
33. Whether Linked List is linear or Non-linear
data structure?
According to Access strategies
Linked list is a linear one.
According to Storage Linked List is
a Non-linear one.
.jpg)
