F/2020/7154 [1] Total Pages : 4
Third Semester
Computer Science and Engineering/Information Technology
Scheme OCBC 2019
DATA STRUCTURE AND ALGORITHM
Time : Three Hours Maximum Marks : 70
Note : i) All 7 Questions are Compulsory. Internal choices has been
given in each LO (Learning Outcome)
g^r 7 àíZ A{Zdm¶© h¢& Am§V[aH$ {dH$ën à˶oH$ LO (b{ZªJ AmCQ>H$‘)
‘| {XE JE h¢&
ii) In case of any doubt or dispute, the English version question
should be treated as final.
{H$gr ^r àH$ma Ho$ g§Xoh AWdm {ddmX H$s pñW{V ‘| A§J«oOr ^mfm Ho$
àíZ H$mo A§{V‘ ‘mZm Om¶oJm&
Q. LO Questions Marks
1. LO1.1 Explain various types of data structures. 10
S>mQ>m ñQ´>³Mg© Ho$ {d{^Þ àH$mam| H$mo g‘PmBE&
OR/AWdm
Explain dynamic memory allocation. 10
S>m¶Zm{‘H$ ‘o‘moar EbmoHo$eZ H$mo g‘PmBE&
2. LO1.1 Explain methods of storing 2D array-row major 10
order and column major order.
2D array H$mo ñQ>moa H$aZo Ho$ VarH$m| H$mo g‘PmBE-amo
‘oOa AmS>©a Ed§ H$m°b‘ ‘oOa AmS>©a&
OR/AWdm
In a byte addressable memory a 2D array 10
A[5][4] is stored in row-major form. Each
element of the array needs 1 byte of memory.
First element of the array (A[0][0]) is stored at
location 300. Find the memory location of the
following array elements.
A[0][3], A[1][1], A[2][3], A[3][2], A[4][0]
F/2020/7154 P.T.O.
[2]
Q. LO Questions Marks
EH$ ~mBQ> ES´>ogo~b ‘o‘moar ‘| 2D Eao A[5][4] H$mo amo
‘oOa AmS>©a e¡br ‘| aIm J¶m h¢& Eao Ho$ à˶oH$ E{b‘|Q>
‘o‘moar ‘| 1 byte H$s OJh boVm h¢& Eao H$m nhbm
E{b‘|Q> (A[0][0]) ‘o‘moar ‘| 300 bmoHo$eZ na aIm
hþAm h¢& {ZåZ{b{IV Eao E{b‘|Q²>g H$s bmoHo$eZ nVm
H$s{OE&
A[0][3], A[1][1], A[2][3], A[3][2], A[4][0]
3. LO2.1 Sort the following array(data) using insertion sort. 10
At each stage show the items of the array -
data[8] = {51, 21, 45, 72, 17, 81, 27, 74}
B§ge©Z gm°Q>© H$m Cn¶moJ H$aVo hþE {ZåZ{b{IV
array(data) H$mo gm°Q>© H$s{OE& à˶oH$ MaU ‘| Eao Ho$
AmBQ>åg H$mo àX{e©V H$s{O¶o&
data[8] = {51, 21, 45, 72, 17, 81, 27, 74}
OR/AWdm
Sort the following array (data) using selection 10
sort. At each stage show the items of the array.
data[8] = {27, 72, 9, 19, 13, 98, 25, 88}
{gbo³eZ gm°Q>© H$m Cn¶moJ H$aVo hþE {ZåZ{b{IV
array (data) H$mo gm°Q>© H$s{OE& à˶oH$ MaU ‘| Eao Ho$
AmBQ>åg H$mo àX{e©V H$s{O¶o&
data[8] = {27, 72, 9, 19, 13, 98, 25, 88}
4. LO2.1 Explain Bubble sort, Merge sort with the help 10
of example.
~~b gm°Q>© Ed§ ‘O© gm°Q>© H$mo CXmhaU Ho$ gmW g‘PmBE&
OR/AWdm
Explain hashing techniques with the help of 10
example.
h¡qeJ VH$ZrH$ H$mo CXmhaU Ho$ gmW g‘PmBE&
F/2020/7154 Contd.....
[3]
Q. LO Questions Marks
5. LO3.1 Explain doubly linked list and operations 10
performed on it.
S>ãbr qb³S> {bñQ> Ed§ Cg na hmoZo dmbo Am°naoeÝg
H$mo g‘PmBE&
OR/AWdm
Explain circular linked list and operations 10
performed on it.
gHw©$ba qb³S> {bñQ> Ed§ Cg na hmoZo dmbo Am°naoeÝg
H$mo g‘PmBE&
6. LO3.3 Write the algorithm to evaluate postfix 10
expression using stack. And evaluate the
following postfix expression. At each stage show
the items of stack.
1, 3, +, 2, 4, *, +, 7, +
ñQ>H¡ $ H$s ghm¶Vm go nmoñQ>{’$³g E³gàoeZ H$m ‘yë¶m§H$Z
H$aZo H$m AëJmo[aW‘ {b{IE& {ZåZ{b{IV nmoñQ>{’$³g
E³gàoeZ H$m ‘yë¶m§H$Z H$s{O¶o& à˶oH$ MaU ‘| ñQ>¡H$
Ho$ AmBQ>åg H$mo àX{e©V H$s{O¶o&
1, 3, +, 2, 4, *, +, 7, +
OR/AWdm
Write the algorithm to convert infix expression 10
to postfix expression using stack.
ñQ>¡H$ H$s ghm¶Vm go BZ{’$³g E³gàoeZ H$mo
nmoñQ>{’$³g E³gàoeZ ‘| n[ad{V©V H$aZo H$m AëJmo[aW‘
{b{IE&
F/2020/7154 P.T.O.
[4]
Q. LO Questions Marks
7. LO4.1 Insert the following 10 numbers in order into an 10
empty binary search tree. Show the tree at all
the stages.
80, 35, 90, 5, 70, 98, 85, 110, 50, 20
{ZåZ{b{IV 10 g§»¶mAm| H$mo Imbr ~mBZar Q´>r ‘|
H«$‘e… BÝgQ>© H$s{OE& à˶oH$ MaU ‘| Q´>r H$mo àX{e©V
H$s{OE&
80, 35, 90, 5, 70, 98, 85, 110, 50, 20
OR/AWdm
Insert the following 10 numbers in order into an 10
empty AVL tree. Show the tree at all the stages.
17, 30, 40, 62, 10, 25, 35, 80, 50, 20
{ZåZ{b{IV 10 g§»¶mAm| H$mo Imbr [Link]. Q´>r ‘|
H«$‘e… BÝgQ>© H$s{OE& à˶oH$ MaU ‘| Q´>r H$mo àX{e©V
H$s{OE&
17, 30, 40, 62, 10, 25, 35, 80, 50, 20
F/2020/7154
![F/2020/7154
[1]
F/2020/7154
Total Pages : 4
Third Semester
Computer Science and Engineering/Information Technology
Scheme OCB](https://screenshots.scribd.com/Scribd/252_100_85/356/515566554/1.jpeg)
![F/2020/7154
[2]
Contd.....
Q.
LO
Questions
Marks
EH$ ~mBQ> ES´>ogo~b ‘o‘moar ‘| 2D Eao A[5][4] H$mo amo
‘oOa AmS>©a e¡br ‘|](https://screenshots.scribd.com/Scribd/252_100_85/356/515566554/2.jpeg)
![F/2020/7154
[3]
Q.
LO
Questions
Marks
5.
LO3.1
Explain doubly linked list and operations
performed on it.
S>ãbr qb³S> {bñQ>](https://screenshots.scribd.com/Scribd/252_100_85/356/515566554/3.jpeg)
![F/2020/7154
[4]
7.
LO4.1
Insert the following 10 numbers in order into an
empty binary search tree. Show the tree at all
the](https://screenshots.scribd.com/Scribd/252_100_85/356/515566554/4.jpeg)
