You are on page 1of 8

BSIT - 61

1ourt4 Seme ter B.Sc. (IT) Examination, May/June 2011 (Directorate of Di tance E!ucation) $-)*#IT8MS
Time : 3 Hours Instructions : 1) Pan A is Compulsory (25 marks). 2) Answer any 5 questions from Part B. (75 marks). 3) Assume necessary information if require . Max. Marks : 100

&$#T - $
I. !nswer all questions. 1* .efine algorithm. ,* 'hat is tree + @ist its properties. 3* 'hat is re"ursion + 3i e example. -* .efine "ir"ular queue. /* 'hat do $ou mean %$ ad<a"en"$ matrix + Jxplain. B* .efine "omplete %inar$ tree. F* .efine de%ugging. >* @ist arious operations on )ueue. 1 ,/ Marks * , / / , / , , ,

&$#T - B
1. .esign an iterati e and re"ursi e algorithm to generate :i%ona""i sequen"e of length XnY. ,. a* .esign an algorithm to illustrate insertion sort. %* Jxplain the following terms i* 6ath iii* In"iden"e ii* Mullgraph i * Isolated ertex &.T.*.

BSIT-61
3. 'rite an algorithm to find the roots of a quadrati" equation "onsidering all the "onditions. -. Tra"e out the algorithm M!VIMIM on a data set "onsisting atleast 10 elements. /. :or a gi en data set AH>( 1B( F/( ,B( 10( /0C a* 5imulate qui"k sort. %* Merge sort. B. .esign and tra"e7out qui"ksort algorithm. F. Jxplain preorder( postorder and in order tra esal with example. >. 'hat are the wastage of memor$ for a %inar$ tree with > nodes represented in one dimension arra$ and , .imension arra$. Jxplain. 1/ > F 1/ 1/ 1/ 1/

NNNNNNNNNNNNNNNNNNNNNNNNNNN

BSIT ' 62
I/ Seme ter B.Sc. (IT) Examination, May/June 2011 Directorate of Di tance E!ucation J$/$ &#*)#$MMI")
Time : 3 Hours Instructions : 1) Part A is com!ulsory. (25 "arks) 2) Answer any FIVE full questions from Part B. (75 Mar s) Max. Marks : 100

&$#T-$
I. .efine the following : a* 8lasses and o%<e"ts %* !pplet "* Inheritan"e d* 6ol$morphism e* .$nami" %inding f* Ea a pa"kage g* 5"ope of a aria%le h* Multi7threading i* 8onstru"tor and .estru"tor <* 8onstant and aria%le k* Ea a tokens. 1* 6rogramming. , , , , , , , , , , 3 ,

6.T.#.

BSIT ' 62 &$#T ' B


II. 1* a* 'rite a Ea a program to displa$ OHello worldO and list "ommands in ol ing its exe"ution. %* How Ea a is different from other languages + ,* a* 'rite a Ea a program to displa$ :i%ona""i num%ers %etween 0 to /0( %* Jxplain fun"tion protot$pe in Ea a. ( 3* a* 'hat is an arra$ + How do we "reate and initialiKe arra$s in Ea a + Jxplain with example. %* @ist arious data t$pes a aila%le in Ea a. -* a* 'rite a program to "reate an user defined pa"kage and its usage. %* .is"uss life "$"le of a thread. /* a* Jxplain the "lassifi"ation of Ea a streams. %* .emonstrate the use of Ea a interfa"es in inheritan"e implementation. B* a* .es"ri%e the life7"$"le of a thread. %* 8ompare o erloading and o erriding. F* a* 'rite a Ea a program to add , matrix. %* 'rite a Ea a program to illustrate the working of %reak and "ontinue statement. >* 'rite a note on : 1/ marks ea"h* a* E9M %* ##6 "* 5wit"h statement in Ea a.
NNNNNNNNNNNNNNNNNNNNNNNN

> F > F 10 / 10 / > F 10 / 10 /

BSIT ' 63
I/ Seme ter B.Sc. (IT) Examination, May/June 2011 Directorate of Di tance E!ucation +"I; $"D S8E-- &#*)#$MMI")
Time : 3 Hours Instructions : 1) Part A is compulsory. 2) Answer any FIVE questions from Part B. Max. Marks : 100

&$#T - $
I. !nswer all the questions. 1* 'hat are internal and external "ommands + ,* How unix is different from windows 8V5 + 3* 'hat is multi7pro"essing + -* 'hat is a shell in unix + /* 'hat is the fun"tion of unix kernel + B* .efine .aemon pro"ess. F* How hard links are "reated + >* How we "an "hange dire"tor$ permissions + H* @ist arious attri%utes of a unix file. 10* How do $ou "he"k a file for spelling mistakes + 11* How do $ou $ank and paste lines in unix. files + 1,* @ist ke$ features of unix.

,/

, , 1 1 , , , , , , , /

6.T.#

BSIT ' 63 &$#T ' B


1.

a* Jxplain la$ered ar"hite"ture of unix #.5. %* .ifferentiate relati e path and a%solute path.

10 / 1/ 10 / 1/x321/*

,. Jxplain arious modes in 9i editor. 3. a* 'rite a shell s"ript to delete files in "urrent dire"tor$ intera"ti el$. %* Jxplain the use of wild7"ards in unix. -. Jxplain the different "ontrol stru"tures in shell programming. 'ith example for ea"h. /. Jxplain the following 13 marks ea"h* a* grep %* "hmod "* sort d* "al e* "mp B. a* .ifferentiate pine and mail V "ommand. %* How to ran and terminate pro"ess in %a"kground + F. Jxplain the following "ommand with example. a* ni"e %* tail "* tr >. 'rite a note on a* 6ipes %* set "ommand "* 6!TH "ommand NNNNNNNNNNNNNNNNN

/ 10 1/x321/*

1/x321/*

BSIT ' 66
I/ Seme ter B.Sc. (IT) Examination, May/June 2011 (Directorate of Di tance E!ucation) S*1T7$#E E")I"EE#I")
Time : 3 Hours . Max. Marks : 100

Instructions : 1) Part - A is compulsory. (25 marks) 2) Answer any FIVE questions from Part - B. (75 marks).

&$#T ' $
I. !nswer all the questions. 1* .efine 5oftware. ,* .efine Risk Management. 3* 'hat are 5pe"ifi"ation @anguages + 3i e example. -* 'hat is 6rogram .o"umentation + /* 'hat is 5R5 + 'h$ do we need it. B* 'hat is &ase7line + 3i e example. F* .es"ri%e the following : a* 6.@ %* 8#8#M# "* &la"k %ox testing d* 5oftware reusa%ilit$. , , 1 1,x-2>*

&$#T ' B
II. !nswer any 1I/E full questions. 1* a* @ist arious importan"e "hara"teristi"s of s=w. %* 'hat are the limitations of waterfall model + ,* a* Jxplain s=w design prin"iples. %* @ist important approa"hes used in program de%ugging. > F 10 / 6.T.#.

BSIT ' 66
3* a* 'hat is "ohension and "oupling + Jxplain. %* Jxplain arious design steps for transa"tion mapping. -* a* 'hat is s=w testing + 3i e its importan"e. %* Jxplain the different kinds of software de elopment team stru"ture. /* a* .efine : )ualit$( )ualit$ assuran"e and )ualit$ "ontrol. %* 'hat are aggregate o%<e"ts + 3i e example. B* .is"uss M8 "oil0s software qualit$ fa"tors. F* a* 3i e important fun"tions of 58M pro"ess. %* Jxplain %asi" 8#8#M# model. >* 'rite a note on : a* 6rogramming tools %* 8oupling "* 5piral model of s=w pro"ess d* 6rotot$ping e* 5$stem testing. NNNNNNNNNNNNNNNNNNNN > F > F H B 1/ / 10 1/x321/*