Professional Documents
Culture Documents
/q
p:/
htt
2011
Full Marks : 70
pap
1.
wb
er.
GROUP A
( Multiple Choice Type Questions )
Choose the correct alternatives for any ten of the following :
10 1 = 10
i)
Let q be the queue of integers defined as follows :
ii)
3131
a)
++q.data[q.rear]=x;
b)
q.data[q.rear]++=x;
in
a c.
ut .
#define MAX10
struct queue
{ int data [MAX];
int rear, front;
} q;
To insert an element into the queue, we may write operation
c)
q.data[++q.rear]=x;
d)
none of these.
The tree traversal technique in which the root is
traversed after its children is known as
a)
post-order traversal
b)
pre-order traversal
c)
in-order traversal
d)
none of these.
[ Turn over
CS/BCA/SEM-3/BCA-302/2011-12
iii)
/q
p:/
htt
iv)
v)
b)
34
c)
24
d)
none of these.
a)
2k
b)
c)
2k 1
d)
none of these.
a)
O ( n2 )
b)
O ( log n )
c)
O(n)
d)
O ( n log n ).
Graph is a
a)
b)
c)
d)
none of these.
Stack works on
wb
er.
vii)
14
pap
vi)
a)
a)
LIFO
c)
b)
FIFO
d)
none of these.
x)
3131
b)
c)
no access mechanism
d)
none of these.
in
a c.
ut .
ix)
a)
stack
b)
queue
c)
tree
d)
list.
O ( n log 2n )
b)
O ( 2n )
c)
O ( n2 )
d)
O ( 2 ).
CS/BCA/SEM-3/BCA-302/2011-12
xi)
/q
p:/
htt
xii)
a)
b)
c)
d)
none of these.
a)
reverse notation
b)
c)
polish notation
d)
none of these.
pap
GROUP B
( Short Answer Type Questions )
Answer any three of the following
3 5 = 15
3.
4.
wb
er.
2.
a+b*c(de*f)/g
6.
in
a c.
ut .
5.
GROUP C
( Long Answer Type Questions )
Answer any three of the following.
7.
3 15 = 45
a)
b)
3131
[ Turn over
CS/BCA/SEM-3/BCA-302/2011-12
c)
/q
p:/
htt
8.
Node with 55
ii)
Node with 66
iii)
3+3+3
35
a)
De-queue
b)
c)
Hashing
d)
Priority queue.
a)
b)
pap
9.
i)
a, g, f, b, k, d, h, m, j, e, s, i, r, x, c, l, n, t, u, p.
wb
er.
Also delete h, r, p, d.
b)
c)
11. a)
in
a c.
ut .
b)
c)
3131