Scribd
Upload
43 views

WWW - Yuvadhan.ml: L) A'l'A S l'RU ('L'L RE ' - AL ) 1-tl'l'II

Uploaded by

Atul Kumawat
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
43 views

WWW - Yuvadhan.ml: L) A'l'A S l'RU ('L'L RE ' - AL ) 1-tl'l'II

Uploaded by

Atul Kumawat
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/ 2

1705

r·s..101
H.oll No.: ........... .. ....... ..

2015
l)A'l'A S'l'RU(~'l'l JRE '-~ AL< ;<)1-tl'l'II M
f.ltiHh1 ~ : ~til' 1 [30~ 3'lf;' . 70
Time nllowed : Thn-c lloursl !Maximum Marks : 70

~--",,-- : (i)
"""'
•I, Note : Question No. I is c o111p1tlsmy, {111.,·1,·cr any .fiv<' l/lll'Stions from thl' remaining
(ii) ~ 'flR 'cfi ~ 'lflTlT 'ifJ1 "{fi17qf( 1[q, 7-TT'tl ffl qi/f;ff[ I

Sol\le all parts rfa lJLIC'Stion c o11scc11til'l'(\' to~eth er.


(iii) 11m" 'flR cfiT :p7 'f'iI "fl Wf1ll ~ I
Slart eac!t ques tion un a.fi·esh pa{!e.

(iv) ~'I/TffT31T'l13FrR'rn'cfft~q~~;ftirP-Tt I
On~r h'nglish version is ,•a/id in case ffdif/eren ce in hot/, the lang uag<'., .

I. (i) ~~ nu~ ~ ~ ct,lf-il~ 1

Define algorithm.
,1) (ii) ~~~ ct,lf-il~ I
Define Queue.
\
')
(iii) ~W·lR ~~ ~ ct,7f-ij~
Define binary tree.
(iv) ~ mt~ q;1&01fcffl21 ~ ft;r@
Write complexity order of merge sort.
(v) ~_g;;)~aj ~f?iffi ~ ~ ct,lf-il~ I
(2 X5)
Define adjacency matrix.

2. f-ii:.:ifo1forn q)f ~ &ilf"1~ :


Prove the foll owing :
(i) I 2 + 22 + 32 t- ... + n 2 == 0 ( n .1 )
(ii) e
4* 2 11 + n 2 = (2 11 ) (4 X3)
(iii) 9 n2 + yn + I = Q ( n 2) P.T.0 .
www.yuvadhan.ml
CSJOI
(2) 1705 ,
3. (i) ~ ~ ft.rR- it~ -;rr~ cf>1. ~ ~4 ~ fi;Trl l~?T'tfra:r fr~
Write an algorithm to insert a node in linear linked list.
(ii) ~~~it fcfim~cf>1 rn;) ~m
c!~ilR\!ll ftvwit
Write an algorithm to delete a node from dnubly linked list.

4. (i) ~it~ (push) fif;m cf>~~ cffi ~f<i41("Pfl«t ~ Q('"lllR'al wr&T I


Write an algorithm for push operation in stack using urray.
(ii) f--1Yf<:1f©ct ~ cfiT tTIR ~ ~cfi" f--1c+ilf<:1q I
Find the post fix expression of the following expression :
A + (B '!' C - (D I E$ F) * G) * H (6+6)

5. (i) ~ ~ fc:nfif;mm cf>f ~4$ll~q I


Explain circular queue operations.
(ii) f--1t.-tf<:1forn ef\" cfiT fu-~ m?: 3Titt cf B ~ ~ ~ :
Write the pre order, post order and in order traversal of the following tree. (f7)
1

6. (i) f--1t.-tf<:1f<sict q;l ~,~.,u ef\" i t ~ ~ :


Insert the following in binary tree :
40. 10,20.30. 70,80, 5~60,90
(ii) Wtf,-q-~~~cf)f llfficf>Rcf>m ci,n,,M Q('"lnutll f<:1f<siQ
Write Warsha] algorithm to find shortest path in _graph. (6&
7. (i) f~kfcfi?H mt~~ ~@ilRtil ~ I )
Write an algorithm for selection sort.
(ii) mtn ~cH-!M cf>1 ~ cfi1 ~ -q t44$ll~q
Explain graph traversal techniques in brief.
(6+6)

8. f1i::.:ifo1fo1a ~ ~ fc~ 0 nf<:1f©Q :


Write short notes on the following :
(i) ffiPT
Hashing
(ii) ~,~.,R~
Binary tree (6+6)

www.yuvadhan.ml

You might also like

pFad - Phonifier reborn

Pfad - The Proxy pFad of © 2024 Garber Painting. All rights reserved.

Note: This service is not intended for secure transactions such as banking, social media, email, or purchasing. Use at your own risk. We assume no liability whatsoever for broken pages.


Alternative Proxies:

Alternative Proxy

pFad Proxy

pFad v3 Proxy

pFad v4 Proxy