<br>
2326
NRCAM-25
STRUCTURES AND APPLICATIONS
DATA
CC-A4:B23.CTS.401
Pajer
|Maximum
Marks:50
Time Allowed: 3 llours)
all., selecting
onc qucstion
questions in
Note : Attempt five No. I is compulsory. AI
Qucstion
from cach Unit.
marks.
questions carry cqual
Compulsory Question
: 5×2=10
on following
1. Write short notes the
are Data structure traverscd ?
(a) How
complexity.
(b) Explain O notation for algorithm
AB^C + D.
(c) Give prefix form for
an array float values in row major
(d) Given of
A[1 ..M][1..N). If base address of this
representation
array S00 then find the address of A[iJU).
total number of nodes in a complete
(e) Compute the
binary tree of height 4.
UNIT-I
2. Explain with example on the following:
5
(a) Static and Dynamic Dala structures.
2326/K/947/3.400 P.T. O.
2326
NRCAM-25
STRUCTURES AND APPLICATIONS
DATA
CC-A4:B23.CTS.401
Pajer
|Maximum
Marks:50
Time Allowed: 3 llours)
all., selecting
onc qucstion
questions in
Note : Attempt five No. I is compulsory. AI
Qucstion
from cach Unit.
marks.
questions carry cqual
Compulsory Question
: 5×2=10
on following
1. Write short notes the
are Data structure traverscd ?
(a) How
complexity.
(b) Explain O notation for algorithm
AB^C + D.
(c) Give prefix form for
an array float values in row major
(d) Given of
A[1 ..M][1..N). If base address of this
representation
array S00 then find the address of A[iJU).
total number of nodes in a complete
(e) Compute the
binary tree of height 4.
UNIT-I
2. Explain with example on the following:
5
(a) Static and Dynamic Dala structures.
2326/K/947/3.400 P.T. O.
