Data Structures

1. What is a data structure?

2. List out the areas in which data structures are applied extensively
3. What are the major data structures used in the following areas : !"#$% &etwor' data model ( )ierarchical
data model.
*. +f you are using , language to implement the heterogeneous lin'ed list% what pointer type will you use?
-. #inimum num.er of /ueues needed to implement the priority /ueue?
0. What is the data structures used to perform recursion?
1. What are the notations used in 2valuation of 3rithmetic 2xpressions using prefix and postfix forms?
4. ,onvert the expression 553 6 "7 8 , 9 5! 9 27 : 5; 6 <77 to e/uivalent =refix and =ostfix notations.
>. $orting is not possi.le .y using which of the following methods?
5a7 +nsertion
5.7 $election
5c7 2xchange
5d7 !eletion
1?. 3 .inary tree with 2? nodes has null .ranches?
11. What are the methods availa.le in storing se/uential files ?
12. )ow many different trees are possi.le with 1? nodes ?
13. List out few of the 3pplication of tree data@structure?
1*. List out few of the applications that ma'e use of #ultilin'ed $tructures?
1-. +n tree construction which is the suita.le efficient data structure?
10. What is the type of the algorithm used in solving the 4 Aueens pro.lem?
11. +n an 3BL tree% at what condition the .alancing is to .e done?
14. What is the .uc'et siCe% when the overlapping and collision occur at same time?
1>. Dhere are 4% 1-% 13% 1* nodes were there in * different trees. Which of them could have formed a full .inary tree?
2?. $ort the given values using Auic' $ort?
0-% 1?% 1-% 4?% 4-% 0?% --% -?%*-
21. ;or the given graph% draw the !;$ and ";$?
22. ,lassify the )ashing ;unctions .ased on the various methods .y which the 'ey value is found.
23. What are the types of ,ollision esolution Dechni/ues and the methods used in each of the type?
2*. +n !"#$% what is the efficient data structure used in the internal storage representation?
2-. !raw the "@tree of order 3 created .y inserting the following data arriving in se/uence 9 >2 2* 0 1 11 4 22 * -
10 1> 2? 14
2*. 20. Ef the following tree structure% which is% efficient considering space and time complexities?
5a7 +ncomplete "inary Dree
5.7 ,omplete "inary Dree
5c7 ;ull "inary Dree
21. What is a spanning Dree?
24. !oes the minimum spanning tree of a graph give the shortest distance .etween any two specified nodes?
2>. Which is the simplest file structure?
5a7 $e/uential
5.7 +ndexed
5c7 andom
3?. Whether Lin'ed List is linear or &on@linear data structure?
31. !raw a .inary Dree for the expression :
3 8 " @ 5, 6 !7 8 5= F A7