
	Trending ▼ ICSE CBSE 10th ISC CBSE 12th CTET GATE UGC NET Vestibulares ResFinder

IGNOU UNIVERSITY MCA - I (SEM 2) JUN 2009 : Data And File Structures

4 pages, 16 questions, 0 questions with responses, 0 total responses,

	mca_india	+Fave Message
	Profile Timeline Uploads Q & A

Home > mca_india >

Formatting page ...

MCA (Revised) ro Term-End E xamination \O june, 2409 Fll O MCS-021 : D ATA A ND F ILE S TRUCTURES Time : 3 l rcurs Note : 1. M aximum M arks : 1 00 (Veightage 7 5%) m Q uestion nnber1 i s C ompulsory.A ttempt a ny t hree questions f ro* t lrc r est.A ll. a lgoritltnss houldb ez ttritten nearert o C t nguage. ( a) D efine t he t erm " Complexity". F or w hat types o f a pplications i s T ime C omplexity Critical a nd f or w hat t ypes o f a pplications is S paceC omplexity C ritical. 10 (b) W rite a n a lgorithm f or 2 -way m erge s ort. Sort t he f ollowing n umbers a nd s how a ll intermediate s teps : 10 7, 1 9, 3 9, 5 , 7 2, 1 15, 1 3, 4 4, 5 6 (c) H ow A A T rees a re b etter t han R ed-Black trees? C onstruct a n A A-tree u sing t he following n odes. S how a ll i ntermediate 10 steps a nd b alancing o f t ree. 8 , l _ 5 2 5 , 9 9 , 5 , 7 0 , 3 2 , 4 5 , 3 31 2 ,1 7 , 9 4 , , , 112, L 3 MCS-021 P.T.O. ( d) W rite a n a lgorithm t o i mplement t he following f unctions o f a d equeue.A lso, g ive an e xample t o s how t he w orking o f t hese functions. (i) (a) C reate D EQUEUE (iii) 2. I nsert E lement (ii) 10 D elete E lement Write a n a lgorithm f or e valuating p ostfix expression. S how t he w orking o f y our algorithm o n t he f ollowing e xpression. L0 [10,8 , + ,12, 9 , 5 , / , + , * ) (b) 10 (u) Explain a c ircular l inked l ist. W rite a n algorithm t o i nsert a nd d elete a n e lementi n circular l inked l ist. L0 (b) 3. Find t he r ninimum C ost S panning T ree o f the f ollowing g raph. Write an algorithm for multiplication of two sparse m atrices. 10 MCS-021 (u) 1 4/hats c ylinder - s urfacei ndexing ? E xplain i it w ith a n e xample. A lso, w rite i ts m erits and d emerits. (b) D efine A bstract D ata T 'yp", a nd g ive t wo exampleso f i t. (.) 4. C onstruct a b inary t ree u sing t he f ollowing pre-order a nd i n-order t raversals: L0 Pre-order:ABGFIMCDEF In-order:BHMGADFEC 5. (u) C onstruct a B -Tree f or t he f ollowing d ata. Show a ll i ntermediate s teps d uring t he 10 process. DHKZBPOQEASWTCLNYM (b) Explain t he f ollowing u sing a n e xample : (i) B readth F irst S earch (ii) A VL T ree -oOo- MCS-021 10

Formatting page ...

Additional Info : Mca - I (sem 2) June 2009 Question Paper - Data And File Structures(Revised Course)
Tags : mca exam papers, mca question papers, ignou mca question papers, ptu mca question papers, mca sample question paper, mca mumbai university question papers, mca exam syllabus, mca exam question paper, online mca exam papers, online mca exam preparation, mumbai university mca question papers, ignou university mca question papers

mca_india chat

Horizontal lines at:
Guest Horizontal lines at:
AutoRM Data:
Box geometries: