Scribd
Upload
26 views3 pages

Bca 3rd Sem( Data Structure) HC- 3026

The document outlines a paper for a BCA examination, detailing various topics related to data structures and algorithms, including memory representation of 2D arrays, linked lists, stack operations, binary search trees, and algorithm complexity. It includes specific questions and tasks for students to complete, such as explaining concepts, writing algorithms, and evaluating expressions. The exam is set for three hours and consists of multiple sections with a total of 60 marks.

Uploaded by

bhargavbharadwaj19
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
26 views3 pages

Bca 3rd Sem( Data Structure) HC- 3026

The document outlines a paper for a BCA examination, detailing various topics related to data structures and algorithms, including memory representation of 2D arrays, linked lists, stack operations, binary search trees, and algorithm complexity. It includes specific questions and tasks for students to complete, such as explaining concepts, writing algorithms, and evaluating expressions. The exam is set for three hours and consists of multiple sections with a total of 60 marks.

Uploaded by

bhargavbharadwaj19
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 3

_pri'rr~ p a ~

.....,(3J &cA - BC- 3 0 2 6

2-022
( He.Id 2023 J

E>.ATA. ,S TRUCTU-.Ri!: .AN"I> . A . L O < > R i T ~


Paper : .BCA-HC-3026

F'u.ll ~arlc:s : 60

Time : Three ho-...irs


The ftg-ures 'l.n. t h e rn.czrg'i.n. 'i.n.d'i.cczte
- ' " ' ' rn.czrlcs f o r t h e qz.c.est'i.on.s.

Arz..szver czn.y s'i.,c questions.

1. (a) Briefly explain m~mory representation


o f 2D arrays. Write kc:ic:iress translation
£1...2nction £or 2D arrays. 6
{b} Ea.ch element of" _a.n a.r~a.y ARR [10] [10]
req1...2ires bytes · of storage. Base
address of ARR is 500. Determine the
location. of ARR f3] fSJ vvhen. the array
-is stored a.s (a) rovv major~ (b) column.
major. 2+2=4

Cont:d.
.,.... afte r diagram 6 _
. ,..,. 't~-,,.,,r,, rc fb'r-.d
fnJ J..J r.ft~ n U'<-. h -' "'-f't-(t
. • . .

d~~nl>c- the rnsin action ot deletJn


:· . •• . . _ft_
node froft'J vrnddfc r>oS1tJon of Stnai~
linked lis t . s
(bj WJ, at i s double ~inked l ist ? E~p1~
the cases o f deletion for dou b le hnkect
0
Jist. 5

3. (a} Expl ain stack overflow and underf10 \l/


conditions . s
(b} Show the following post£ix arithmetic
expression evaluation in stack : 5
396 - /\ 62 / s * + 73 %
U
4. (a} Explain the non-recursive function for
preorder traversal. 5

(b} Write the differences between BFS and


NFS. 5

,. (a} What is binary search tree ? Write an


algorithm to i"nsert a node in binary
search tree. 5
· (b} Describe the concept of binary search
technique with a suitable example. 5

3) BCA-HC-3026/G 2
fa) Sort f<>Unn..: .. •
8oft: : -....-,ng <f6tw U.stn~ Sel~" r•~;
3·a, 63, 3 1, 89. 10. 910, g;2 0

{bJH W
·• J t ia fl <IUic~ 1 ~ its ~i0lrithrn .
• -. i a
.

OW YoU can '-Y that it i~ o;e ~ei:1 on


the coneept of divide and conqu"r ?
Exi>!ain. 5

(a} What is Cotnple,aty of algorithm ? What


are the cases
algorithm ? for complexity of
5
~• What is asymptotic analysis of ~n
1v1
algor1thrn
•
?. What
•. ·.
are asymp tohc
notations. ?
5

3 800 ·
026/G

You might also like