Bachelor of Computer Application (BCA) Examination,

December 2005
INTERNET AND E-COMMERCE
Duration : 3 Hours Max. Marks 100
Min. Pass Marks 40
funsZ’k %
1. iz’ui= ik¡p bdkb;ksa esa foHkkftr gSaA izR;sd bdkbZ esa vkUrfjd fodYi fn;k x;k gSA
2. izR;sd bdkbZ ls ,d iz’u dk mÙkj nhft,A bl izdkj dqy ik¡p iz’uksa ds mÙkj nhft,A
3. lHkh iz’uksa ds fy, leku vad fu;r gSaA
4. tgk¡ vko’;drk gks ogk¡ mi;qDr MkVk ekuk tk ldrk gSA
5. vuqokn esa folaxfr gksus ij vaxzsth Lo:i dks lgh ekuk tk,A
6. iz’ui= ds fo:) vkifÙk] ;fn dksbZ gks rks] iz’ui= gks tkus ds i’pkr~~ foHkkxk/;
{k@izHkkjh v/;;u laLFk ds ek/;e ls izLrqr dh tk,A iz’ui= dk cfg"dkj fdlh Hkh
ifjfLFkfr esa ijh{kkfFkZ;ksa }kjk u fd;k tk,A

Instructions:
1. The Question Paper is divided in five units. Each unit carries an internal choice.
2. Attempt one question from each unit. Thus attempt five questions in all.
3. All questions carry equal marks.
4. Assume suitable data wherever necessary.
5. English version should be deemed to be correct in case of any anomaly in translation.
6. Protest against question paper, if any, should be lodged after paper through Head of
Department/Study Institute. No boycott of paper should be made under any
circumstances by the examinees.

bdkbZ I Unit I
1. ¼v½ vkadM+ksa dh rFkk ,cLVªsDV vkadM+ksa dh lajpuk dks le>kb;sA
Define Data structure and Abstract data structure. 10
¼c½ ,d vo;o dks iafDr ls fudkyus ds fy, ,yxksfjFke fyf[k,A
Write an algorithm to Delete and Element from a queue. 10
2. ¼v½ iafDr dh lmnkgj.k O;k[;k dhft,A
What is queue? Explain with example. 10
¼c½ lkekU; rkfydk esa ;fn dksbZ vo;o lfEefyr djuk gks] rkfydk ds igys o ckn
esa rks og dSls djsaxs\ ,yxksfjFke fyf[k,A
In a general list if an items is to be inserted before and after a list. How it will be
done? Write algorithm. 10

bdkbZ II Unit II
3. ¼v½ rkfydk VªsoYl dh O;k[;k dhft,A
What is list traversal? Explain. 10
¼c½ fdlh o`Ùkh; iafDr esa fdlh vo;o dks lfEefyr djus o fudkyus ds fy;s D;k djrs
gSa \ ,yxksfjFke fyf[k,A
How can we delete and add element in a circular queue? Write algorithm. 10
4. ¼v½ fyad fyLV ds mi;ksxksa dks fyf[k;sA
Write application of link list.
¼c½ dM+h&xM~Mh dks fdl rjg ?kksf"kr o mi;ksx fd;k tk ldrk gS \
 How linked stacks can be declared and used? 12

bdkbZ III Unit III

5. ¼v½ ,yxksfjFke fyf[k, %
(i) B+-tree esa Mkyus ds fy, (ii) B+-tree ls fudkyus ds fy,A
Write an algorithm to:
(i) Insert into a B+-tree (ii) Delete from a B+-tree. 10
¼c½ larqfyr Vªh dh lmnkgj.k ifjHkk"kk nhft,A
With example define balance tree. 10
6. ¼v½ Threaded binary tree dks le>kb;sA
Explain threaded binary tree. 10
¼c½ fuEufyf[kr vfHkO;fD;ksa ds fy, fjiztsUVs’ku nhft,%
Determine the tree representation of the following expressions:
(i) A + (B-C) * D/(E * F) (ii) (A + B * C) + ((A + B) * C). 10

bdkbZ IV Unit IV
7. ¼v½ vkUrfjd@cká 'kkfVZax esa vUrj Li"V dhft,A
Differentiate between External/Internal sorting. 10
¼c½ fDyd 'kkWVZ dks fØ;kfUor djus ds fy, ,yxksfjFke fyf[k,A
Write an algorithm to implement quick sort. 10
8. ¼v½ f}vk/kkjh vUos"k.k ds fy, ,yxksfjFke fyf[k,A
Write an algorithm for binary search. 10
¼c½ laf{kIr esa fVIi.kh fyf[k, %
(i) ghi lksVZ (ii) flysD’ku lkWVZA
Write short notes on :
(i) Heap sort (ii) Selection Sort 10

bdkbZ V Unit V
9. ¼v½ gsf’kax dh ifjHkk"kk nhft,A fdUgha Hkh rhu gsf’kax i)fr;ksa dks
le>kb;sA
Define Hashing. Discus in brief any three hashing techniques. 10
¼c½ dksfytu D;k gS \ bls dSls gasMy fd;k tk ldrk gS \
What is Collision? How it can be handled? 10
10. ¼v½ ,d ¼Mk;jsDVsM½ xzkQ G, fp= esa uhps n’kkZ;k x;k gS %
Consider the (Directed) Graph G in figure below :
x y

z w

(i) lHkh flEiy Path, X ls Z rd irk dhft,A

(ii) lHkh flEiy Path, X ls Z rd irk dhft,A
(iii) bufMxzh (Y) rFkk vkmV fMxzh (Y) dks irk dhft,A
(iv) D;k blesa lkslsZl rFkk flad gksaxs \
(v) Find all the simple paths from X to Z.
(vi) Find all the simple paths from Y to Z.
(vii) Find indegree (Y) and out-degree (Y).
(viii) Are there any sources or sinks? 10
¼c½ fuEufyf[kr VeZl~ dks ifjHkkf"kr dhft, %
(i) Mk;jsDVsm xzkQ (ii) dEifyV xzkQ (iii) osVsM xzkQ
(iv) eYVh xzkQ (v) Vªh xzkQA
Directed the following terms:
(i) Directed Graph (ii) Complete Graph (iii) Weighted Graph
(iv) Multi Graph (v) Tree Graph. 10