6th Semester (June; July-2015) Computer Science and Information Science Engineering Question Papers
1 like1,961 views
This document contains exam questions for the subjects of Management and Entrepreneurship, Compiler Design, Computer Graphics and Visualization, Computer Networks II, and questions related to algorithms, data structures, operating systems, computer architecture. The exam is divided into two parts for each subject with multiple choice and long answer questions. Topics covered include management functions, organizations, planning, decision making, compilers, computer graphics concepts, computer networks, algorithms, and more. Students are instructed to answer five full questions total, selecting at least two from each exam part.
![{$,",r es
:
i
Max. ivleu ,'.s i00
ote: Atrt:,i1tti!t t.rtti-i l:";'ir .e l'ul! qt.{estions, selecting
lrfl1.''1r*;t 7',lv'l'! qt.rk'stioflS from eACh pArt.
X:'..r l-lT - A
a. What is cl:r.t:r u(,rl[)r'i]ssir',rr '' hxlii,:r d'ri','rcrrt colnpression algorithms and their per.;,rttlnce
l11ellsllre'-",,,1': 1 ((i5 tl"rrkS)
b. Whirt tri' .rl:iillre!1' .1,:(:(,,1'r.,re '-'l 1-;i'"'e i!i('1:r'ccedure and detennine whether f .'ij':r,ving
cocies arc uir.r',';;cly iltr,r,,r , ,r- .-.r. .'... , ,.,}, .,,. , t i ,,) ,0,01, 10). ('ro r!.1o.pr;
c. A source crtill:, ietiers;ilt,r ,:-in t:r lr:i... r = lii:" [";, ii3. a4, a5] with probahilities P(a ]== 0 15,
P(a:):0.i.1.4" ['(a:) '= i;.?1-. !'{aa1'-- ii,,'!^, lri1d i'(a:)=.0.50. Entropy: 1.818 bits. calcr,iate :
i) I{uftirrrt[t L:{'}i.i,.]:, u:;iri.:,;.-tir.r.)l ,^ ,--:-'.c3 [i,':,..i'.jure; ii) A',,e:ege length; iii) Red...nrlancy.
(rt'i "l'larks)
a.
b.
C)
C)
()
Lr
E
a
C)
(!
()
EPoo#
Q.;-
ta
03u
7(n
i, tt
troo
.= c
c€$
9il
o)tt0)
oB
*.h
a:;
oc)
(6O
OE
c0i
c0d
>P
-(s!oa
!(d
-?o
5Sa-
o. 6_
tro.
5cdL);
ruu
0)=
5o(,lE
={-3- (l)
5.v> q-
oo-
=o0(l)=
:L 9.,
= o.)
L)
L'<
-N
0.)
z
(€
tr
USN
Sixtftr lletu'ee:i] *,{" .-:, ;:. l.l
'
.;iilt6"ri;i
Time: 3 hr s.
a. With a lraoit i;loct< oiagr,i:'1. '::;(i iiii:, 1
b. Gir,.,t t[,: l,L r- lt'lgp1 t,-'' 1 ,: :l-r:
C. IllUStfiltc !.rrri <i {rl ii;),'1. 1i,. rl., . , i
a. Stale iinr:tr $r,srelr"t nrr-llr: r'i,.'.
b. ' Find the ilr'et"s:, Z-lr';itrsll.ll-.,:r o{ I irr } ,
a. W[af is , ii-tii:r', .totilt]:-',':: c
the loles rrf' 'ntrtion cilili,rl
b. Wrire 3 turti: .)t-t. i) Lvlr-l<rei
i' ', .' E:r*rr,rrination, June/July 2Al5
tiit']: qfi ;$ trfi*g:;!5,iOn
'h
lock diagram.
audio coding algorithm.
a. Given an iititiirl tiic;;oiiii: i u - irii, i,li. of' lettei's entries (a, b, t,, y,
(1,2. 3,4. 5). Hnr:orl: ti-.,, rllc' :'ll ,t-r,,.,?.lc risirtril the LZW algorithm.
aYb a" |r't, r r a.r/'h' "' ji'.:, r'r a "t it rl/b ay.
b. Exp ';lll ' i'.".'t ' t ..1' ,, i , r. ' '1'
c. Write J lrt;l,'rtrr IP[rf, L.l ,i r. :
10c5,'[s663
(r'{l i'Xa.rks)
(.'.;', . arks)
1.,1 .tr ","ir_fkS)
( "'. -, rks)
,,, ,..' , :,rfkS)
/ii,, iirxnfks)
i ., ' ,,fkS)
('/) 'i''arks)
Wiiat is '--iistol"fu]n'.' l:<r;i:t,', il:: :- i.r; ::iiit, firi-',,i;S oi- iossy conrpression schelTle ., i[;t r.ireir
shapes. ( {l i'v.nrks)
Shorv thai S,'JFt ot'iI rinitorrn or r', rl,.1rl' i.;r unrlon:rly distributed source is 6.02n dB"
ltrlr rt,'lafkS)
(, i 'i:.:rks)
a
la -er'-, --:-:- -'',t--).5^z+l
c. Define sa.rntriing theore:lt. Ol:tarn invr.:.se Fourier transform t(t)
dornein vi*r'u,'
a. Illu..lt'i,,,c' i -, l;i.si: 5,.,r',J' :'''l: i,',:- ) iliit'ti ru';'i ifs
b. Explain :,.ir1'.1;,.; tt,,-rti .{i' :r,.'., ', ,- - . , ! {. '';:),..
c. Explain fi';ititt; srru(:ir,fr: :ii, ii;./,:l -i i , i.., ii i ig irr 4 PlJG
, 1,r :..:i qdanl.iz tltion procedure. ((i[i .',iarks)
'.r t' 'i-' i1,ri S,. tlers itnd distribution is known. (u*, v-arks)
'ir:.,ii i"a..:.r)'' ;'ti;ptive Delta Mociulation (CFDI i 'orks.
(',,*,",arkS)
-r'i['
i:i!
o r jr ;l - A;l
(,,,i J,,"
"rrkS)
i. ., )."rrks)
in ideal sampling t-i'eqriency
i: ,, , *rks)
a. E.r.;ligitt hi'lr.^'i.'],('l*fr.-'ii',.' ir(,lil ir-. i;;,-.1 , 3g1.rp.'t)ssion. with aneat skgtch.
b. Discuss SPil-i'l schen:e
''': ltiock rJiagram of H.261 video coder and !llil.;'rate
!r,op lllter. ('t) iv'rarks)
g tecirni.lue; ii) Video standard MPEG-2. i, r 'v arks)](https://image.slidesharecdn.com/2015may6thsemcse-150724064139-lva1-app6891/85/6th-Semester-June-July-2015-Computer-Science-and-Information-Science-Engineering-Question-Papers-7-320.jpg)
![USN 10IS63
Max. Marks:100Time: 3 hrs.
PART-A
- :-1 a. Briefly explain History of file structure design. gQqprxs)
b. Explain the sector based data organization in magnetic Disk with a neat diagram. g{ffirks)
.d c. Explain the organization of data on Nine - Track Tapes with a neat diagram. , ' '' .(06 Marks)
! Z a. Define Field and Record. Explain the different methods for organizing fields and records of
E a file. with examples. / (12 Msrks)
E b. Define RRN (Relative Record Number), Explain how does it su1@ direct access with
! example. ..., V (06 Morks)
E c. Distinguish between File access and File organization. 6X) (02 Marks)
69
t; 3 a. W}at is redundancy reduction? Explain how Run - Leng(ffi{incoding helps in redundancy
t 5 reduction with an example . ' U (06 Marks)
i5 T b. Explain How space can be reclaimed in files, using ieoord deletion and storage compaction
E _$^ c. Write an algorithm for searching a record frorq{fih using (i) Binary search
H 5 (ii) Sequential search. (t (06 Marks)
i .C d. Define Indexing and its significance in Filgsttctures. (02 Marks)
oi r-
Ee 4 a. What is co - sequential processing;a[+]rat are assumptions and components of the model?
; € ,iV (o8Marks)
t A 6. Explain the object - oriented qrod€Lfor implementing Co-Sequential process. (06 Marks)
E! s. Explain the K - Way merge Qt&orithm with an example. (06 Marks)
6s r
E! C .,.$l PART - B
; E 5 a. What are the two - major d.iawbackr *ttt bt.*ry search to search a simple sorted index on
€ E secondary storage. (02 Marks)
A g b. Define B - Treqiqffiw the B - Tree of oder - 4 (four) that result from loading the following
E ; sets of keys in o#r. il CGJXNSUOAEBHIF iil CSDAMPIBWNGIJRKE (0s Marks)
F F c. With exanrdft&xplain the following operations in B - Tree, with example.
; g i) D.t"Sp ii) Merging iii) Redistribution. o0 Msrks)
; S 6 a. Whatis indexed sequential access? Explain the Block splitting and merging due to insertion
E f .q4 deletion in sequence set with example. (10 Marks)
* E
tgEtRlain the internal structure of index set blocks. (10 Marks)
c 60 ,
E € + il Define Hashing? Discuss the various collision resolution techniques with example to avoid
H E f$., collision. (lo Marks)
_:p1.);' b. Suppose that 10,000 addresses are allocated to hold 8000 records in a randomly hashed file
td.' - and that each address can hold one record. Compute the following values.
;
- i) The packing density for the file
E ii) The expected number of address with no records assigned to them by the hash function.
; iii) The expected number of addresses with one record assigned.
E iv) The expected number of overflow records. (10 Marks)
q
E 8 a. Write short notes on the following:
i) Dynamic Hashing ii) Linear Hashing iii) Extendible Hashing.
b. Explain, How does Extendible Hashing works?
(12 Marks)
(08 Marks)
Sixth Semester B.E. Degree Exam
File Structures -::'":
Note: Answer FIVE full questions, selecting
at least TWO questions from eech part.
.:
:, :.
t 1_: ir
l/.ir
fif-! i
frl: /r
.''r1 ,'
,i
e/July 2015
..-,rr,r,a .r.,
r ,, '.1 1
ts'{-'r., 'i de
*ui *r..,t jy.
t[ld
o](https://image.slidesharecdn.com/2015may6thsemcse-150724064139-lva1-app6891/85/6th-Semester-June-July-2015-Computer-Science-and-Information-Science-Engineering-Question-Papers-9-320.jpg)
6th Semester (June; July-2015) Computer Science and Information Science Engineering Question Papers
- 1. trge^,es 10AL51USN Fifth Semester B.E. Degree Examination, June/July 2015 Management and Entrepreneurship ta) A Time: 3 hrs. Max. Marks:lQ0 E Not", Answer any FIVE full questions, selecting atleast TWO questions from.qiih jtart 'ori. € PART-A -q $".'.. $: I a. Define Management. Explain different levels of Management. fl (0s MrdO E:" b. Explain functional area of Management. _ 1 $- (0s Ma*s) t,! c. What is ttre profession and administration managernent? ep - (10 Merks) '=t ,'r- E + 2 a. Give any four important reasons for the performance ofpfannjng functions. (05 Marks) E 86 b. DifTerence between strategic planning and tactical plannin).- (05 Marks) € E c. What is decision making? Explain different types ofdlfisions. (10 Marks) :. .E g 3 a. Define an organization and explain principles gf{.gbnisation. (0s Marks) ? E b. Write a brief note on the following : il Mqql ii) MBE. (05 Martrs) _q f c. Discuss any two types of organization stupfrIts with highlighting their merits and demerits. E_€ fy (l0Marks) $E {"i"r ! I 4 a. Briefly explain the purpose of comrirfnication. (0s Marks) € € b. Briefly explain the essentials ofa sound control system. (05 Marks) F ! c. Explain Maslow's and Herybqry theories of Human motivation. (t0 Marks) b! E-[ PARr-B 8s g.E 5 a. Who is an Enteq$i?ur? Explain the characteristics of an Enterpreoeur. (05 Mrrks) e !E b. Explain the role.sTan Enterpreneur in economic development of any country. (05 Merks) 5 € c. Explain tlqdhlrier involved in entrepreneurship. (10 Marks) >' ! ;'' H g 6 a. What'ls'Small Scale Industry? Briefly explain the need and rationale of SSI's. (0s Marts) 9_. E b. Er$lai, briefly the Govemment support for SSI during 5 year plan. (05 Marks) E g c. 6f,,pplain the objectives and functions of WTO. (10 Mr*s) :u. {$-i> P ,, : : 7, c. Write functions of District industries centers / single window concept. (05 Marks) ! -"ltt b. Write a short note on NSIC. (05 Marks) E " rf. c. Explain the objectives and functions provided by TECSOK and KSSIDC. (10 Marks) -xira $ " 8 a. Briefly outline the contents ofa project. (05 Mart<s) .E b. What is Financial and Social feasibility study? (0s Merks) c. What is Project Appraisal? Explain the steps followed in project appraisals. (10 Marks) *****
- 2. USN Time: 3 hrs. 10cs63 ',i Max. Marks:10O (05 Marks) (09 Marks) E + E I g * E I (E) | id, wrire an (06 Marks) Sixth Semester B.B. Degree ExaminationrhicZluly 201^5 Gom piler Design Note: Answer any FIVE full questions, selecting atleast TWO questions from each part.C) o o e3 O. (ll v, Cd ELa. ub. E9bo- ;} Eo c' :=n -* ll c€.;i r .= C'I Et" 2 a. Etra)A .Eqr.= tr'tro> EZ '= .9 b. eE bU (t0 orooocGl 6 =L. o }HGl -i EGI -br {1 -U. =ct 48.tro. 5Groj ;6 b'E ZE 3 a. tO) t=>, ! ,rlir .ry i *,b,.- 6 E ln,3& i' ; ,u."'i;" :r E g, " {-t#' c. = $*qo''t*,*".P t=&"9,'. * (JK. -.: c.i ij 4a.o zb. E(s o O. PART-A .1 I _**5:,; ', Explain with a diagram, the phases of complier. i f,- (08 Marks) Write regular definitions for the following using extended regul4ft.eftfression notation : i) identifier tr-... ii) unsigned number. *-flH (06 Marks) Write a program for look ahead code with sentinels. ,,1,;,,,, 1 ,{t, (06 Marks) Define teft - recursive grammer. Eliminate f. il,uision from the following grammer : E-+E+TlT T+T*FlF F -+ (E) I id. Given the grammer : S -+ AaAb I nUna A+ € B +e i) compure FIRST( ) ffFOI-t-OW( ) functions ii) construct predictive parsing table iii) parse the input ring w = ab. Show that the fotlowing grammer is ambigious E -+ equivalenfJuplarrb igious grammer for the same. (06 Marks) id. Using the grammer (08 Marks) (06 Marks) &J tt1t ''-t:' ;t What-is meant by handle pruning? construct Bottom - up parse tree for the input string _*-K= aaa * a ++. Using the grammer : $S-+SS+lSS*la. ' Explain the working of shift reduce parser. Parse the input string id *, of question no, 2(a). With a diagram, explain the model of an LR parser. Write an algorithm to construct LALR parsing table. Construct the parsing table for LALR(I) parser using the grammer : S+CC C-+aC C+d. Compare LALR and canonical LR parsers. (06 Marks) (10 Marks) (04 Marks)c. 1 n
- 3. 5a. b. 8a. b. C:, PART - B Explain the concept of syntax directed definition. Consider the context free grammer given below : S-+EN E+E+TlE-TlT T-+T*FIT/FIF F + (E) ldigit N+; i) Obtain SDD for the above grammer ii) Annotated parse tree for the input string 5 * 6 + 7 . : 10cs63 (04 Marks) rl; N$sia .s ll.li & 'i.',"'i '"'' .4.: ,..;i. iir ' 4.,, (10 Marks) (06 Marks) (08 Marks) (08 Marks) (04 Marks) (06 Marks) (08 Marks) a garbage (06 Marks) a. Construct DAG and three address code for the following expression : a + a * (b - c) + (b - c) * d. # j:,,* b. Explain the following with an example : i) ryselhirles ii) triples. c. Generate three address code for the followigrldtatement : switch (ch) #"* { case l: c=a+b;break; .,.,,,{ * case 2:c=a-b; break i ,iri-,"",n'a' ) r 'iirjY , 1;'i,"l"ti. b 7 a. With a neat diagram, d{*ufibe the general structure of an activation record. b. Explain in the stratpffiffir reducing fragmentation in heap memory. c. Explain briefly l"Qo# performance metrics to be considered while designing collector. . ,o:h uu*., ' , ''11 ;i.ni c. Define : i) Synthesized attrlbute ii) Inheritedamribute. Discuss the various issues in the design of a code generator. whC e basic blocks and flow gruphrr write in algorirhm to .inStiuctions into basic blocks. .List the characteristics of a peephole optimization. (10 Marks) partition the three address (06 Marks) (04 Marks) ''''L ",,r "'i,, +'"i:.1,, r:. ij'rli i l1 ,,:i'I* -i' ... tl 'i:t ! fu *.r r*" $, +t ,.?'"i: ' ***{<x 2of2
- 4. USN 10cs64 Sixth Semester B.E. Degree Examination, June/July 2015 Time: 3 hrs. Gomputer Networks - !I Max. Marks: tOb i u:*',,,'-ij Note: Answer any FIVE fall questions, selecting 'i :irrJ,rr, atleast TWO questions from each part. . ,, PART - A ,'.. 1 a. Explain datagram and virtual circuit packet switching with delay calcqlqiwtiagrams. (08 Marks) (04 Marks) Fig,Q.I(d) i) Use the Dijkstra's algorithm to find"&e set of shortest paths from node 4 to other nodes. () () (J d l-i a(€ ?,, d (.) (l! !) EPbI) - Q;= y5 SH "*"gl oo .=N (ns 6!{ c)tr -c c)'€E tr'tro3 R,A tr!i gE bU Glo 80E Gt ad 'oH )g 6E E 'cd -bts 6EU)a b-x trt aE 5()., lE Etj !r c) dP>r +r ooo trbo€E a 'F ..1' =((lr!f 9 i'' !'116" l*,o 'B X lr .': .+r ot * (rl C) o z (ll ts o oI b. With neat diagram, explain the generic packet switch. c. Consider the network in Fig.Q.1(c). ii) Find the set of associated routing"table entries. + *'*'' Discuss the priority and weighfed'r r queuing. Explain the concept of RandOhEarly Detection (RED). (08 Marks) (06 Marks) (04 Marks) 2a. b. c. 3a. b. Give the classification o-f"iffiestion control algorithms. Explain the leaky bucket and token bucket traffic shaper wltti'neat diagram. (10 Marks) .-,5 Describe the vari-offields of IP version 4 header. (06 Marks) i) A sma,ll organization has a class C address for seven networks each with 24 hosts. Whatl$efu appropriate subnet mask? ii) Pp&ffi CIDR aggregation on the 124 IP address 200.96.86.0124, 200.96.87.0124, ,+-2@.96.88.0124,20a.96.89.0124. (06 Marks) *.U$#U*sition from IPV4.0 to IPV6.0 is required? Explain the IPV6 network rddr?iiill;u, 4 #.F*g*plain the TCP 3 way handshake for establishing a TCP connection. (06 Marks) .',;'t b. What are the classification of internet routing protocols? Explain in detail routing rj ' information protocol (RP). (0g Marks) c. Write note on: i) Reverse path multicasting ii) Mobile IP. (06 Marks) PART _ B 5 a. Explain the remote login protocols. (06 Marks) b. What are the elements of network management? Discuss the interaction between SNMP management station and SNMP agent. (08 Marks) c. WriteRSAalgorithm.ForRSAalgorithmof4bitmessage 1001,choose a:3 andb:11, find the public keys and private keys for this and show the cipher text. (06 Marks) I of 2
- 5. 6 a. Describe the various types of resource allocation schemes. b. Define VPN. Discuss the concept of tunneling and point to point protocol in VPN. c. What is MPLS network? Explain MPLS operation. 7 a. Explain the JPEG compression for still images. b. Explain the following: i) Huffman encoding r,"., ii) Lempel - Ziv - wetch encoding with an example. 10cs64 (06 Marks) (06 Marks) (08 Mar[o-) 't*il*tl, ' (06"tIa"r*b) .roO,. a (08 Marks) c. Briefly explain with neat diagram, how Content Distribution Networ( (EAN) interaction 'u'','"""'fl -* (06 MafkS)with DNS (Domain Name SYstem)' ,ii .i,,,,,, 8 a. Explain DSDV, TORA routing protocols for mobile adhoc netwffiu "' (08 Marks) b. What are the classifications of sensor networks? Explain Wtifu,televant diagram DEEP clustering protocol in sensor network. (06 Marks).. i ".!E c. Describe the direct or multihop intracluster routing proto€ffil$tith neat diagram. (06 Marks) ***:B* ! .i:: "!.i 'i.:l '1 ,rlrili;r:ti 2 of2
- 6. ffiK.3"*t* i-/*7I a e *>?2r' *=z USN 10rs665 Sixth Semester B.E. Degree Examination, June/July 201'.5 Gom puter Graphics and Visualization Time: 3 hrs. Max. Marfsffi Notez Answer FIVE full questians, selecting , L E * least TWO questionsftom each part. _e;:, E _-',S Q^. E pART-A - &.'J { r a. Explaintheapplicationsofco-pu*!ffi ,f}' (06Marks) E b. With a neat diagram, explain the graphici pipeline architecture. ..{ r t/ (06 Marks) * E c. Explain the concept of pinhole camera of an imaging system. $tpb derive the expression for $i angleofview. 6- (o8Marks) fl 3 2 a. With the help of diagram, describe the openGl interft{q. (04 Marks) 5? b. Write a note on RGB color model and indexed color Xddel. (06 lr,tarks) E ,$. c. Explain a 2D - Sierpinski gasket program in dgfuwith comments. (10 Marks) E S ,..i}* € .! 3 a. Explain thc different classes of logical inpgrceUvices. (06 Marks) 3 : b. Explain picking in detail. ( ,' (0s Marks) E .E c. Explain the mouse callback functio6[r?nouse interface. (06 Morks) aE {tY ! [ 4 a. Define a plane in office space€dYrive the equation of a plane in office space. (10 Marks) ! : b. Explainthemodelingofiq{ft'ttcubeindetail. (roMarks) E'E .ev6 r -,flq. qr ; € &*,:" E ) s*%#" ! = {x *". PART_B- l- m1u..."rf ='O E ^ T^f: l ------^l&.-&,--#^r-^ f-rr- : - ,rh I r. fl 3 5 a. Define ana r"pr$$in" following 2ffirforr.utions in homogeneous co-ordinate system. E n (i) Translatio- (ii) Scaling (iii) Rotation (10 Marks)f E (i) TranslatirN - (ii) Scaling (iii) Rotation (10 Marks) i F b. Explain ttr$ptition of an object about an arbitrary point (i,e, other than origin) and also I S derive SQtncatenation matrix. (10 Marks) e € derive$fUncatenation matrix. (10 Marks) A E O a. Stfre perspective normalization matrix for viewing. (r2 Marks) E g b. Silcuss the following openGl functions: i) glulookAT ; ii) gluPerspective. (0E Marks) >! ?vqo:^ J..H S (-ir Explain the phong lighting model. (f0 Marks) -g g ^{ b. Explain the polygon shading in detail. (r0 Marks) &ftSt}; a. ExplainliangBarskytineclippingalgorithm. (roMarks) -.: .i b. Explain and derive the equations for Bresenham's line drawing. (f0 Marks) tz GI o a
- 7. {$,",r es : i Max. ivleu ,'.s i00 ote: Atrt:,i1tti!t t.rtti-i l:";'ir .e l'ul! qt.{estions, selecting lrfl1.''1r*;t 7',lv'l'! qt.rk'stioflS from eACh pArt. X:'..r l-lT - A a. What is cl:r.t:r u(,rl[)r'i]ssir',rr '' hxlii,:r d'ri','rcrrt colnpression algorithms and their per.;,rttlnce l11ellsllre'-",,,1': 1 ((i5 tl"rrkS) b. Whirt tri' .rl:iillre!1' .1,:(:(,,1'r.,re '-'l 1-;i'"'e i!i('1:r'ccedure and detennine whether f .'ij':r,ving cocies arc uir.r',';;cly iltr,r,,r , ,r- .-.r. .'... , ,.,}, .,,. , t i ,,) ,0,01, 10). ('ro r!.1o.pr; c. A source crtill:, ietiers;ilt,r ,:-in t:r lr:i... r = lii:" [";, ii3. a4, a5] with probahilities P(a ]== 0 15, P(a:):0.i.1.4" ['(a:) '= i;.?1-. !'{aa1'-- ii,,'!^, lri1d i'(a:)=.0.50. Entropy: 1.818 bits. calcr,iate : i) I{uftirrrt[t L:{'}i.i,.]:, u:;iri.:,;.-tir.r.)l ,^ ,--:-'.c3 [i,':,..i'.jure; ii) A',,e:ege length; iii) Red...nrlancy. (rt'i "l'larks) a. b. C) C) () Lr E a C) (! () EPoo# Q.;- ta 03u 7(n i, tt troo .= c c€$ 9il o)tt0) oB *.h a:; oc) (6O OE c0i c0d >P -(s!oa !(d -?o 5Sa- o. 6_ tro. 5cdL); ruu 0)= 5o(,lE ={-3- (l) 5.v> q- oo- =o0(l)= :L 9., = o.) L) L'< -N 0.) z (€ tr USN Sixtftr lletu'ee:i] *,{" .-:, ;:. l.l ' .;iilt6"ri;i Time: 3 hr s. a. With a lraoit i;loct< oiagr,i:'1. '::;(i iiii:, 1 b. Gir,.,t t[,: l,L r- lt'lgp1 t,-'' 1 ,: :l-r: C. IllUStfiltc !.rrri <i {rl ii;),'1. 1i,. rl., . , i a. Stale iinr:tr $r,srelr"t nrr-llr: r'i,.'. b. ' Find the ilr'et"s:, Z-lr';itrsll.ll-.,:r o{ I irr } , a. W[af is , ii-tii:r', .totilt]:-',':: c the loles rrf' 'ntrtion cilili,rl b. Wrire 3 turti: .)t-t. i) Lvlr-l<rei i' ', .' E:r*rr,rrination, June/July 2Al5 tiit']: qfi ;$ trfi*g:;!5,iOn 'h lock diagram. audio coding algorithm. a. Given an iititiirl tiic;;oiiii: i u - irii, i,li. of' lettei's entries (a, b, t,, y, (1,2. 3,4. 5). Hnr:orl: ti-.,, rllc' :'ll ,t-r,,.,?.lc risirtril the LZW algorithm. aYb a" |r't, r r a.r/'h' "' ji'.:, r'r a "t it rl/b ay. b. Exp ';lll ' i'.".'t ' t ..1' ,, i , r. ' '1' c. Write J lrt;l,'rtrr IP[rf, L.l ,i r. : 10c5,'[s663 (r'{l i'Xa.rks) (.'.;', . arks) 1.,1 .tr ","ir_fkS) ( "'. -, rks) ,,, ,..' , :,rfkS) /ii,, iirxnfks) i ., ' ,,fkS) ('/) 'i''arks) Wiiat is '--iistol"fu]n'.' l:<r;i:t,', il:: :- i.r; ::iiit, firi-',,i;S oi- iossy conrpression schelTle ., i[;t r.ireir shapes. ( {l i'v.nrks) Shorv thai S,'JFt ot'iI rinitorrn or r', rl,.1rl' i.;r unrlon:rly distributed source is 6.02n dB" ltrlr rt,'lafkS) (, i 'i:.:rks) a la -er'-, --:-:- -'',t--).5^z+l c. Define sa.rntriing theore:lt. Ol:tarn invr.:.se Fourier transform t(t) dornein vi*r'u,' a. Illu..lt'i,,,c' i -, l;i.si: 5,.,r',J' :'''l: i,',:- ) iliit'ti ru';'i ifs b. Explain :,.ir1'.1;,.; tt,,-rti .{i' :r,.'., ', ,- - . , ! {. '';:),.. c. Explain fi';ititt; srru(:ir,fr: :ii, ii;./,:l -i i , i.., ii i ig irr 4 PlJG , 1,r :..:i qdanl.iz tltion procedure. ((i[i .',iarks) '.r t' 'i-' i1,ri S,. tlers itnd distribution is known. (u*, v-arks) 'ir:.,ii i"a..:.r)'' ;'ti;ptive Delta Mociulation (CFDI i 'orks. (',,*,",arkS) -r'i[' i:i! o r jr ;l - A;l (,,,i J,," "rrkS) i. ., )."rrks) in ideal sampling t-i'eqriency i: ,, , *rks) a. E.r.;ligitt hi'lr.^'i.'],('l*fr.-'ii',.' ir(,lil ir-. i;;,-.1 , 3g1.rp.'t)ssion. with aneat skgtch. b. Discuss SPil-i'l schen:e ''': ltiock rJiagram of H.261 video coder and !llil.;'rate !r,op lllter. ('t) iv'rarks) g tecirni.lue; ii) Video standard MPEG-2. i, r 'v arks)
- 8. USN Time: 3 hrs. and,ffisting. c, Explain dependability properties. a. Briefly explain the terminologies of fault based testing and mutation b. Discuss : i) Scaffolding ii) Test oracle. a. Explain clean room process, with neat diagram. b. Give the standard structure of an analysis and test plan. 10IS65 Max. Marks:1'00 €ech parl cycle, with (10 Marks) (05 Marks) (05 Marks) (10 Marks) (10 Marks) (14 Marks) (06'Marks) R model and modeling (10 Marks) (10 Marks) (04 Marks) techniques for analysis (10 Marks) (06 Marks) analysis. (10 Marks) (I0 Marks) (10 Marks) (10 Marks) Sixth Semester B.E. Degree Examination, June/July 2015 Software Testing o o o tr a cg €o I ER de oo ll .E?- -'l- .= c ES otr -c 9? o> ?a a*a= Li c.) OE oo=(!as -(trlq5 'od NB =9 A- d_9 HO- 6cs oj ;5 ,eatE FG) 5.=>r! bo- tro0 AEtr> =()9_ U< -N () z, i< Note: Answer any FIVE full questions, selecting atleast TWO qaestions from PART-A ,, , '''' 't. "'''I a. Define Error, Fault, Failure, Incident, Test and Test case. Explain testing life neat diagram. ' l b. Define all the faults classified by severity. c. Explain database diagram for a structural triangle program. 3 a. Explain Millers test coverage metrics which are based on program graphs. b. Explain Rapps - Weyuker dataflow,cgVcrage metrics with a neat diagram. , '1r,,. 4 a. With a neat sketches, briefly .*ptuil{ifferent alternative life cycle models. b. Describe top down and bottomup integration strategies. ,-,.'='-" PART - B ,' :: a. Explain basic conCbpts for requirement specification with E - relationships anrong basic constructs. b. Explain different Upes of interactions with example. a. Discuss :-'i) Verification ii) Validation. b. Exptdih'basic principles that charactertze various approaches and a. Explain the limitations of boundary value analysis and develop a formula for the number of robust worst case test cases for a function of two variables. (08 Marks) b. Describe weak and strong normal equivalence class testing, with a neat diagram. (06 Marks) c. Explain the basic decision table terms. (06 Marks) ,r,(* **
- 9. USN 10IS63 Max. Marks:100Time: 3 hrs. PART-A - :-1 a. Briefly explain History of file structure design. gQqprxs) b. Explain the sector based data organization in magnetic Disk with a neat diagram. g{ffirks) .d c. Explain the organization of data on Nine - Track Tapes with a neat diagram. , ' '' .(06 Marks) ! Z a. Define Field and Record. Explain the different methods for organizing fields and records of E a file. with examples. / (12 Msrks) E b. Define RRN (Relative Record Number), Explain how does it su1@ direct access with ! example. ..., V (06 Morks) E c. Distinguish between File access and File organization. 6X) (02 Marks) 69 t; 3 a. W}at is redundancy reduction? Explain how Run - Leng(ffi{incoding helps in redundancy t 5 reduction with an example . ' U (06 Marks) i5 T b. Explain How space can be reclaimed in files, using ieoord deletion and storage compaction E _$^ c. Write an algorithm for searching a record frorq{fih using (i) Binary search H 5 (ii) Sequential search. (t (06 Marks) i .C d. Define Indexing and its significance in Filgsttctures. (02 Marks) oi r- Ee 4 a. What is co - sequential processing;a[+]rat are assumptions and components of the model? ; € ,iV (o8Marks) t A 6. Explain the object - oriented qrod€Lfor implementing Co-Sequential process. (06 Marks) E! s. Explain the K - Way merge Qt&orithm with an example. (06 Marks) 6s r E! C .,.$l PART - B ; E 5 a. What are the two - major d.iawbackr *ttt bt.*ry search to search a simple sorted index on € E secondary storage. (02 Marks) A g b. Define B - Treqiqffiw the B - Tree of oder - 4 (four) that result from loading the following E ; sets of keys in o#r. il CGJXNSUOAEBHIF iil CSDAMPIBWNGIJRKE (0s Marks) F F c. With exanrdft&xplain the following operations in B - Tree, with example. ; g i) D.t"Sp ii) Merging iii) Redistribution. o0 Msrks) ; S 6 a. Whatis indexed sequential access? Explain the Block splitting and merging due to insertion E f .q4 deletion in sequence set with example. (10 Marks) * E tgEtRlain the internal structure of index set blocks. (10 Marks) c 60 , E € + il Define Hashing? Discuss the various collision resolution techniques with example to avoid H E f$., collision. (lo Marks) _:p1.);' b. Suppose that 10,000 addresses are allocated to hold 8000 records in a randomly hashed file td.' - and that each address can hold one record. Compute the following values. ; - i) The packing density for the file E ii) The expected number of address with no records assigned to them by the hash function. ; iii) The expected number of addresses with one record assigned. E iv) The expected number of overflow records. (10 Marks) q E 8 a. Write short notes on the following: i) Dynamic Hashing ii) Linear Hashing iii) Extendible Hashing. b. Explain, How does Extendible Hashing works? (12 Marks) (08 Marks) Sixth Semester B.E. Degree Exam File Structures -::'": Note: Answer FIVE full questions, selecting at least TWO questions from eech part. .: :, :. t 1_: ir l/.ir fif-! i frl: /r .''r1 ,' ,i e/July 2015 ..-,rr,r,a .r., r ,, '.1 1 ts'{-'r., 'i de *ui *r..,t jy. t[ld o
- 10. USN 10cs62 , Sixth Semester B.E. Degree Examination, June/July 2015 Unix System Programming A Time:3 hrs. Max. Marks:(OQ Note: Answer FIVE futl questions, selecting O(:J at least TWO questions from each pafi. ."(r. 'I p.^Rr-A t3'd- g I a. All posix confirming system are not unix system ( True/False). l(J (01 Marks) E b. What are the restrictions specified to POSX.I by FIPS standard? ^ftt (07 Muks) { ". DefinedifferentCpreprocessorsymbolsdefinedbyANSIC. ay (06Mrrks) E d. What is ermo variable? Write a C/C# program to print enq.Qiffrostic message of API d i executions (using ttris variable). - $- (06 Marks) P= -/' {^{ 2 a. With a neat structure, explain how Kemel supporb for nfN thfe operation open, read/write, fl? .tseek). @ (roMarkg 5i b. Whut is the relationship between file sfream pql1ter Ed file descriptor? What functions to E : be used to convert ttrem one from each oflrer. 1L3 " (06 Marks) E H' c. Give any four differences betrveen hard linQffsymbolic link files. (04 Markr) €g H E 3 a. What is umask value? What is the S4ipemrission set for newly created file, if umask E .E value is 0002 and perrnission spegdSlY open call is 0664? Define how umask value can be E * changed by calling process to r{€tite write pemrission of group members and read, write ; ; permission for other memberg - (0S Marks) -8^; b. Write C/C+r command linft r6'gram to implement Unix mv commaad. (05 Marts) S E c. What access permissioq{sH foi a process created while executing excutable file, if set UID : E and set GID flags arerO$? (0s Marks) gE d. Define structure ffilYcreare a write lock for a region behind 5 bytes from current file E ; offset position $$* end of the file. Consider file size is 100 bytes and current file offiet is EB at tobvt*$* (osMarks) ;.E 4 a. IllushaQ$tth simple program how atexit function is used to register exit handler function. E E u. qffio"u tunction? lrdicate any one advantage and disadvantage ofthi. tuo.ti#''"*t) i* pg$u, i, ,n. ,rse of setjmp and longimp tunctions? Illustrate them *itr, ,i.pt. proffiI"*t) €H .V (r0 Markg Ee -.sa6 P -*. PART - B ;S{+ 5 a. What is the effect when following hif,fi-orio the system? 5..: i) Parent temrinates before child. U ii) Child terminates before parent and paretrt not waited for child termination status. 2 iii) Any of the Ilit child process terminates. (06 Marks) E b. Explain wait and waitpid functions. What are the macros defned by POSD(.I to check how i process is terrninated? (08 Marks) E c. What is exec function? Describe different exec functions wittr their prototlpes. (06 Mr*O L of2
- 11. 6a. b. c. 7a. b. 8a. b. 10cs62 Explain characteristics of sessions and process groups with a neat diagram. (08 Maffi Explain with a neat diagram how Kernel supports for signals. (06 Mfuy Explain sigaction API with its prototype. gffiO *- %t What are pipes? With a simple diagram show how parent and child comry@ate using pipes. Write a program to send data from parent to child over a pipe. i. %.*1rz Marks) What is FIFO? With a neat figure show FIFO's are used for client se.uerpffirrnication. *{%% * (08 Marks) { #"3* What is message queue? Write functions to use message queuffiWending and receiving data. #-E#fu# write short notes on any two : .@ h# - (10 Marks) i) popen and pclose functions. % * ii) Semaphores ffi" iii) Characteristics of Daemon process. W (10 Marks) S#E &**l rybm "Ssd rk* '%.. "q& ,e%6 # "&"s d t &. ttk . %3tr# s &*k#%.'%d#r d%, # "*r" p W Wvtus d& m*&-{g' Nqfud &.q u-'%. ,*# " e#*&qh.d s%. &. %#- ffi+ s l,trep- wer -lb- ,rW * tuffi^s&& k'oh'ryfr,p "%. k "ruqfu%q y*q& 'qesd 2 of2