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?
1. Compiler Design,
2. perating !ystem,
". Database #anagement !ystem,
$. !tatistical analysis package,
%. &umerical Analysis,
'. (raphics,
). Artificial *ntelligence,
+. !imulation
3. What are the major data structures used in the following areas : !"#$% &etwor' data model
and (ierarchical data model.
1. ,D-#! . Array /i.e. Array of structures0
2. &etwork data model . (raph
". 1ierarchical data model . 2rees
). *f you are using + language to implement the heterogeneous lin'ed list% what pointer type will
you use?
2he heterogeneous linked list contains different data types in its nodes and we need a link, pointer to
connect them. *t is not possible to use ordinary pointers for this. !o we go for void pointer. 3oid pointer is
capable of storing pointer to any type as it is a generic pointer type.
,. #inimum num-er of .ueues needed to implement the priority .ueue?
2wo. ne 4ueue is used for actual storing of data and another for storing priorities.
/. What is the data structures used to perform recursion?
!tack. -ecause of its 5*6 /5ast *n 6irst ut0 property it remembers its 7caller7 so knows whom to return
when the function has to return. ,ecursion makes use of system stack for storing the return addresses of the
function calls.
8very recursive function has its e4uivalent iterative /non9recursive0 function. 8ven when such e4uivalent
iterative procedures are written, e:plicit stack is to be used.
0. What are the notations used in 1valuation of 2rithmetic 1xpressions using prefix and postfix
forms?
;olish and ,everse ;olish notations.
3. +onvert the expression 442 5 "6 7 + 8 4! 8 16 9 4: 5 ;66 to e.uivalent <refix and <ostfix
notations.
1. <refix &otation: 9 < =A-C > 9 D8 = 6(
2. <ostfix &otation: A- = C < D8 9 6( = > 9
=. $orting is not possi-le -y using which of the following methods? 4*nsertion% $election%
1xchange% !eletion6
$orting is not possi-le in !eletion. ?sing insertion we can perform insertion sort, using selection we can
perform selection sort, using e:change we can perform the bubble sort /and other similar sorting methods0.
-ut no sorting method can be done @ust using deletion.
1>. What are the methods availa-le in storing se.uential files ?
1. !traight merging,
2. &atural merging,
". ;olyphase sort,
$. Distribution of *nitial runs.
11. List out few of the 2pplication of tree data8structure?
1. 2he manipulation of Arithmetic e:pression,
2. !ymbol 2able construction,
". !ynta: analysis.
12. List out few of the applications that ma'e use of #ultilin'ed $tructures?
1. !parse matri:,
2. *nde: generation.
13. *n tree construction which is the suita-le efficient data structure? 42rray% Lin'ed list% $tac'%
?ueue6
5inked list is the suitable efficient data structure.
1). What is the type of the algorithm used in solving the 3 ?ueens pro-lem?
-acktracking.
1,. *n an 2@L tree% at what condition the -alancing is to -e done?
*f the 7pivotal value7 /or the 71eight factor70 is greater than 1 or less than 91.
1/. What is the -uc'et siAe% when the overlapping and collision occur at same time?
ne. *f there is only one entry possible in the bucket, when the collision occurs, there is no way to
accommodate the colliding value. 2his results in the overlapping of values.
10. +lassify the (ashing :unctions -ased on the various methods -y which the 'ey value is found.
1. Direct method,
2. !ubtraction method,
". #odulo9Division method,
$. Digit98:traction method,
%. #id9!4uare method,
'. 6olding method,
). ;seudo9random method.
13. What are the types of +ollision esolution Bechni.ues and the methods used in each of the
type?
1. Cpen addressing 4closed hashing6% 2he methods used includeA verflow block.
2. +losed addressing 4open hashing6% 2he methods used includeA 5inked list, -inary tree.
1=. *n !"#$% what is the efficient data structure used in the internal storage representation?
-= tree. -ecause in -= tree, all the data is stored only in leaf nodes, that makes searching easier. 2his
corresponds to the records that shall be stored in leaf nodes.
2>. What is a spanning Bree?
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.
21. !oes the minimum spanning tree of a graph give the shortest distance -etween any 2
specified nodes?
&o. 2he #inimal spanning tree assures that the total weight of the tree is kept at its minimum. -ut it doesn7t
mean that the distance between any two nodes involved in the minimum9spanning tree is minimum.
22. Which is the simplest file structure? 4$e.uential% *ndexed% andom6
!e4uential is the simplest file structure.
23. Whether Lin'ed List is linear or &on8linear data structure?
According to Access strategies 5inked list is a linear one.
According to !torage 5inked 5ist is a &on9linear one.