Computer Science and Information Science Engineering Question Papers

1. USN
061551
(10 Marks)
Discuss any one of its
(10 Marks)
t&, na
il
Fifth Semester B.E. Degree Examination, June/July 201,4
Software Engineering
Time: 3 hrs.
Note: Answer FIVEfall questions, selecting
atleast TWO questions from each part.
PART _ A
a+,'" Define software process and software process model. Discuss these two in brief. (08 Marks)
b. :M.ention and explain the attributes of good software. '1,'", (04 Marks)
c. Whrye legacy systems? Explain the same with its system componenls aad *rr,i5*!hli:
(09 Marks)
b. Explain the corfrpo4cnt based software engineering with its gendiic process model.1oo Marks)
{:U, ='
rtsqehdrrc
c. Discuss the functidnal classifications of CASE tools. :: ,:,,,,:,: (05 Marks)
a. What are functionall''4nd non-functional requirements? Discuss the non-functional
(10 Marks)
b. Discuss the requirements eliiitation and analrasisrwith a good process model. (10 Marks)
a. How does the structured methods{,qtrgrhelpfiil to produce the models for a system? Discuss
the components of CASE tools for
,:jn '1.
b.
81
o
!
a.
cd
d
!
ItdL()
L
Eg
x-
5r'
ooll 2
coo J.:a
.=N
6d+
ESotraoE9
sE 4
EE
3sY5
o()
OE
botr(Bcd
BE )lE5
E(d
5 .!t
€E
48.tro.
oi o
uio
bEiioatE
i-
x .:t
*a t
bo-q orJ
+uts?
to
o:
c f -
o{-'1
-
(ht
C)
o
z
E8o
"='.r'
':-
(08 Marks)
a. What is S dependability? Explain the principal dimensioms-.ahd system properties of
a.
b.
c.
Explain the process of risk man@!
stage of risk management, in d*sil'-
.,. "
..,^
li,i;'..,,.'
Mention and explain the main strategies that can be used to decompose a subsystem into
models. ,'" '',"','t. ::: (10 Marks)
What are the cqffint objects? Discuss the concurrent objectjmplementations. (06 Marks)
Mention and.,{d{ lie two types of design models of object oriertffie_sign. (04 Marks)
1 r r:,' jr, t! ".!
What is^&ilreme programming (XP)? Explain a number of practleffinvolving in extreme
I-ist;Cil and explain the Lehman's laws of program evolution dynamics. H ..,.,, (10 Marks)
.Brief out the following : i.*,,,,,."',,,,
i) Integrity testing
ii) Release testing.
What is intention of automatic static analysis? Discuss the following, in detail :
i) Checks detected by static analysis
il) Stages involved in static analysis.
interface testing.
Write short notes on :
Motivating people-human needs hierarchy.
Software cost estimation techniques.
Agile methods.
.
".irt
(0{"Merko
.o#1+
(10 Marks) '
Define component testing. Mention and explain different types of interface errors in
(06 Marks)
(06 Marks)
(08 Marks)
(06 Marks)
**1.x*

2. 06cs52USN
Fifth Semester B.E. Degree Examination, June/July 2Ol4
Systems Software
'=,,,,.'Time: 3 hrs. ax. Marks,le'0;
ffi1 ote: 1. Answer any FIYEfull questions, selecting u, :
..,.:.,.::: atleast TWO questions from each part ,, f'r,r
, 'i;'* - 2. Assume suitable opcodes for various SfC +i n I
. r1,-l** und SIC/XE instructions wherever needed. = ,,'.0' i' - 1':::'"=
o.-.i
1l
E ' *.*. - PART - A ,n
n"4,
,','
E I a. Definb s_y_stem software and explain SIC machine architecture. _. *
* (10 Marks)
B b. Explain-S{G&E instruction format with suitable examples. ",;--.
" (04 Marks)
E c. Write SICDG instructions sequence to add two arrays ALPIr{'+,ffi BETA using indexing
,,, 'i',,r"}' (06 Marks)
p" t
and looping ''''
',;;)I;""
. .: .:,:;
H; 2 a. Write a simple SiCqrygram to read record into a buf@'flnd write record from buffer and
i 3 hence generate object Wde. Also write the correspordforg object program. (10 Marks)
A? b. Write an algorithm for pa#,assembler. (10 Marks)
.i'r
E S 3 a. Describe LTORG assembler=Efij€ive used toftiedne literals. (04 Marks)
E -r
Y./:
E ry b. Explain the symbol defining stafbrp"it{s withiuitable examples. (06 Marks)
o=
E g c. Could a one pass assembler prothi#ft*a. relocatable object program and handle external
5
=
references? Describe the processing ffihat would be involved and identify any potential
X<6
.g t difficulties (Io Marks)
'r.i h .f;
6A
"5i^
-.i
'4 ./:'
6A
S * 4 a. Explain the following basic loads functions:
E ! i) Design of an absolute l@6r; ii) Design of4.ptmple bootstrap loader. (10 Marks)
SE b. Explain the various loa.f,cg design options. ,:1i., (10 Marks)(!d
;E d. PARr-B ' *
F5
: E 5 a. What is an intepa*tive editor? Explain the structure of a typical editor. (10 Marks)
E I b. Briefly explain debugging functions and debugging capabilities (06 Marks)
E i c. Write a drorrtmote on uses interface criteria. * e (04 Marks)
A $ 6 a. Ho11z Bftould a programmer decide whether to use a rnacro o, u ,rrbiOirtfqg, to accomplish a
$ € givcg"logical function? 't
,,,.,,,.,.
(04 Marks)
E € b. Exptain the following machine-independent macroprocessor features:
6=
i E . ..,.,,,'i) Concatenation of macro parameters; ii) Generation of unique labels. -
..,,".i:'' ('10 Marks)
LE c. Discuss recursive macro expansion design option. (06lVlarks)
ry[
Ef; , -f*? a. Explain the general sections of a typicat LEX program and commands to create and e$9y,61
E E ' atypical LEX program. (10 Mcffi.+
; 5 b. Write a LEX program to count the number of words, characters, blanks and lines in a givere#
o5
, I text. (10 Marks)
E 8 a. Discuss YACC gralnmilr, recursive rules and a simple parse tree with suitable examples.
V (06 Marks)
E b. Explain the arithmetic expressions and ambiguous input for a typical YACC program.
g (10 Marks)
,E c. Write a short note on the lexer. (04 Marks)
**rl.rl.*

3. O6CS/IS54
USN
Fifth Semester B.E. Degree Examinationo June/July 201,4
Database Management Systems
s
Max. u*|t,
, I u aw. a,,J ,"
"' :_: -t^" ;tr
' .'.
'
j . at least TWO qruestionsfrom each part. '''-
''"
-S 1 a. fi*t.*tO explain the importurt charu.teristics that distinguish the datab{.se approach from
i thai of traditional file processing system. (05 Marks)
# b. Discuss th roles of d.ifferent actors on the scene. u,=,,,f"",',,- (10 Marks)
E c. What do you mean by data independence? Explain with a ngqt'*i{iagram the three-schema
$i architectuie (05 Marks)
g t 2 a. What are the concdpts used in ER modeling? Explain eae-h'ofthem with an example.
E ff -",,., ,,,.,,..,
E",,,,,"'' (06Marks)
oo ll
.g oP
.=.S i) Entitv type. "' ,{,"'y
g g iii) Entity set with an example.u ri''
,,,,,'"',,= {'*q*"' (04 Marks)
I
=
c. Define: i) Recursive relationship,o','*4'; ,' ii) Weak entity
9 * iii) Role {. * u iv) Cardinality ratio. (04 Marks)
Z E d. Draw the ER diagram for BANK&t*6,i{Se application. (06 Marks)
3B'
E i 3 a. What is a relation? List the,.@ortant chardcte-ristics of a relation. Explain the relational
& E model constraints. (08 Marks)6cg_g cg
: ; , b. Discuss the relational alfe'bia operations with an exbngfe.for each. (08 Marks)
€ * c. Write the queries in relational algebra for a company database for the following:
5 ii i) List the namw-pfall employees with two or more depdiid'ents.
A 3 ii) Retrieve the name and address of all employees who work for'Research' Dept.
E [ (04 Marks)
tro-
o'r
d € 4 a. List ths'data types and data definition statements in SQL. (06 Marks)
; E b. Give the complete syntax of SELECT statement in SQL and explain clause with an
E E exampte. (06 Marks)
i#c.wit"thequeriesinSQLforthecompanydatabaseforthefollowing:
$ B i) Retrieve the names of employeeswho have no dependent. '"'*'1,
g;, : ii) For each Dept, retrieve the dept number, Number of employees in the dept; dtheirFor each Dept, retrieve tle dept number, Numbir of employees in the depL and their
average salary. ii ,,
Rcfrierrc qll ctnnlnrrcec rvhn rvere hnrn drrrino the 1990s 'rr1lli.
! e , " iii) Retrieve all employees who were born during the 1990s. -'''{*iriii
o t :-, T)^+-:^-,^ +L^ T^ ^f ^*-I^-,^^^.,,^-r-:*^ ^- ^^^L ^-^:^^+ /Ao rr--r.^n.^i.
: I iv) Retrieve the No. of employees working on each project. (08 Marks)
-N
()
E PART-BA
E 5 a. Explain the update statements in SQL. (06 Marks)
E b. What are views in SQL? List their advantages. (06 Marks)
g. c. Write notes on:
i) embedded SQL
ii) dynamic SQL. (08 Marks)
oiitr.>Xo
o
I of2

4. tr
Discuss the informal guidelines for relational databases.
Defure:
D functional dependency
O6CS/IS54
. (06 Marks)
ii) rNF
,. iii) 2NF
"*+ iv) 3NF and r,-". ,rt"L'
'u5$.q; v) BCNF. (Lo nk'ft0
List the inference rules for FDs.
.-.ldtMart
s)
,tr t*--'
b. oendvfop along with the join dependency.
^M***"
[8:ffi:[]
c. Give th8ffiprithmto find the
oKey' ofthe relation and compute,lffi8y for
F : {SSN +"E name * ," u.
Pnum *P ourn" . i .,
SSN, Pritrrfi,+ hrs) - . ".. (08 Marks),.:::::
;:
8 a. Explain the desirable prop@ of a transactiory:* 6 (04 Marks)a. txplalll tne Oes[aDle propefms.,ol a ransactlo+:tu q (04 Marks)
b. Discuss the different concurfBffi"pontrol teclhiryles. (10 M:$Iks)
&
c. Write a note on database recoveiy.-,"*.. '.=,.'{ (06 Marks)
6a.
b.
#"
a:"
*
,] q.'
- - E5
m *J"
qS S
e &."
i- k/
'Ef ?,. -..:r::
q6
l1-s;
ss:q.
., ,,,1
&%
dEq'.
"
$tu''
{6..4
1;
-;;' a q .:
e-'__ -: I
dt
= --.$
I
"-d*
;ri- ':::n
, x,""'
. 4gq-
*,"d.
."nd
..:.:: ,
It
't j1 ::'':'
2 of2

5. USN
La.
b.
c.
06csss
(08 Marks)
(12 Marks)
(10 Marks)
(10 Marks)
(10 Marks)
(10 Marks)
Fifth Semester B.E. Degree Examination, June/July 2014
Gomputer Networks - I
Note: Answer FIVE fall questions, selecting
at leust TWO questionsfrom each part.
'Time: 3 hrs.
.r' '" ,tl
l* !r "'C)
o
o
L
a
(d
og
0)
!
ER
y-
dU
=h
;o ll
.E OP
.=N
(dsl
:. oo
Y.C)
otr5c)
8*
a=
o(l)
c6O
o!o0c
.9d
-o>e?6
!g=
!!d
-b6
5.8
d. 8.
=6o'r
9E
AE,
o-
!o
3E>'*
qo0
o=
t+9
E6o
->;
o{
-i c..i
;
o
z
cd
r
2 a. Encode the bit patf6rt 01001 1 10 using:
i) Polar NRZ-L
ii) Polar NRZ-[
iii) Manchester
iv) Differential Manchester- Sghornes
!r li,,r,,
':;;,,.,,,.... ...::
b. Write a descriptive note on the three causes eftransmission impairments.
7 a. Explain Hidden and Exposed Station Problems in IEEE 802.11.
b. Explain Bluetooth architecture in detail.
8 a. Explain in detail the architecture of SONET system.
b. Explain briefly the three categories of satellites.
.::=.,._,=_ ..
3 .a. Explain briefly the following along,yx[ eforms:
D Amplitude shift keying
. _il) Frequency shift keying ..
'"'',i
,,- , ,1t. (06 Mafts)
b. An analog signal has bit rate" qf 8000 bps and,,a. hand rate of 1000 band. How many data
elements are carried by eac,ft;pilnal element? How@ signal elements we need? (04 Marks)
c. Explain FDM and Synchronous TDM with an exadlle. . (10 Marks)
::. :..=,::
, ...,-:::_...
4 a. List the characteriffis of microwaves. r * (04 Marks)
b. Draw a CC.e$er and decoder for CRC code with C(7, 4)..Also explain how this CRC
design workqtuith an example *,*_ (10 Marks)
. c. What is ,ihtbrnet checksum? List the steps undertaken by sentk'hnd receiver for error
dete$44i:"
.
(06 Marks)
PART - B
5 a,
-
Explain briefly with neat figures stop-and-wait ARQ. ,
(10 Marks)
,:,t,;,,,bt'"'
Explain different phases of PPP' with a diagram' (10 Marks)
'*"
'5 a. Explain different controlled access methods. (rdruarks)
''r, b. Define channelization and explain its three protocols with diagrams. (10 Mar.ks)
,
*****

6. USN 06cs56
Fifth Semester B.E. Degree Examination, June/July 2Ol4
S+ r | 1s).,.{t}..i a I
C -1, I (^) (-)
E
* ii) L: {dr.}wconsistsof0'sand 1'swith0ll assubstring} u..,,r.', (07Marks)
g c. Convert ttreffihwing DFA to NFA using subset construction@$thod. (08 Marks)
aAe'
$3 s. l"o t '"-'
Q'-1.--r-
E e Automata.
S H c. Consider following e-NFA.
E r o,L,.,1
E + i(s I trt {;it.
b9pE q
:l'rf
*
€ E 2 a. Define Regular Expressions. Desbh$#gulaheipressions for following languages:€ E 2 a. Define Regular Expressions. Des$hftegulaftefu.pressions for following languages:
E E i) Set of all strings that consists o{.@rating 0's and I's.
E e ii) Set of all strings over the alphald:-{a, b, c} containing atleast one a and atleast one b..= o , e
; E (06 Marks)
t f' b. Prove that every language dqfln€d by a rbgul4r expre5sion_ is also_ defined by a [inilq
-qE e Automata. (06 Marks)
Formal Languages and Automata Theory
Max. Marks: lOQ
"1'',lf*"'
3 hrs'
Note: Answer FrvEfult questions, selecting fu;p.1'r', 'i"'r1" at least TWO questionsfrom each parl .'. '':..
.t.-() .,.," e.-..$
€ ,::::"",::: PART _ Ao t h ::...
fr I a. W....,$at is automata theory? Why we study automata theory? - 1os Marks)
=E b. Corlpare DFA and NFA. Design DFA to accept the following language$r#'
I i) L =={*lw is of even length and begins with 01} _
E: *. { gri;@ St
eg ; nie.[zrcl :
xdB E
N Fig.Q2(c)
q F i) Corryrte e-closure of each state.
$ € if Eliminate e-transitions and convert to a DFA. (08 Marks)
3(,
EE
q E 3 a. Stqte and prove pumping lemma for Regular languages. "',-'.,.....,..=. (08 Marks)
1E b. IfL and M are Regular Languages, prove that L n M is also regular.
-
";'ftos Marks)
qp ?^ . " f-nnoirlar +lra fnlln'.,i-- I-E A a! r' eqg' $ ,,, C'i,*il' Consider the following DFA. W".
:
*,
o=
-W"
'u;;-Eg
Es
:>
?,@(JLo{
j.'l
o)
z
il
o.
Fig.Q3(c)
i) Draw a table of distinguishable and in-distinguishable states.
ii) Construct minimum state equivalent DFA.
L of2
(07 Marks)

7. 06css6
a. Define: i) Context free grammer, ii) Language of a grammer, iii) Sentential forms.(O4 Marks)
b. Construct context free grammer for L: {atU ck ; i + j: k}. (03 Marks)
c. Following grarnmer generates the language consisting of strings of even length.
S-+ASle
A-+aalbblbalbb
Give leftmost and rightmost derivations for the following strings:
i) aabbaa ii) baabab
',:
::1,,, '::::, '
(08M'arks)
What is ambigious grammer? Prove that the following grammer is ambiguous for
w: ababa:
+i-== S -+ SbSla 1,," i,,,. (05 Marks)
'lqm- PART-B i.,,,".'"'.
5a.Definedi$s:,qo".tructPDAfo.th"-fo[o*irrg1anguagebyemprff}8ithestack:
L : {wlfuffilpist of equal number of 0's and 1's} over E &*{0, 1}
Write InstantanLdus"Descriptions for the string 001011. .11.:}' (12 Marks)
b. Construct PDA fof$qfollowing gratnmer:
iptions for the string 001011. ***'nwino srammer: n !'
(12 Marks)
b&-@
S -+ aABB I aA,Alfl
-",.
. i
A -+ aBB I a '"4i;,. d-
B -+ bBB I A *
&..*- ,- .,,.],*
''
C+a (O8Marks)p
6 a. Consider the following gralnmer: =ff=
S -+ ABC I BaB r':,.-.'=',,--
.:.
A -+ aA I BaC I aaa _='.,{:,i* n,
.,*,,,
B-+bBblalD 1.,",
C+CAIAC ,#ff}D->e
i) Eliminate e - productions. "
ii) Eliminate ug{{p ductions from resulting grammer. $
iii) EliminatqUseLss symbols and productions from in resulting'grammer. (09 Marks)
b. Convert the f8lbwing grammer into CNF form. *;
E -+ E*{q}-T *,F I (E) I a lb I Ia lIb I Io I Ir
T+ Fl(E)lalbllallbllolll " .,'.
' ,t "
F$$i*E) I a lb I Ia I Ib llo I Ir ,,,.-:::,,...::
' :._'
,..t"+"albllallbll0llr QTMarks)
,,,=,{srove
that L: {0n ln 0n I n > 1} is not a context free language.
1];1,l*"'u.,
-vrfit h. Explain with a neat diagrarn, the working of turing machine model. (06 Mar-ks)
",;;-.?;l b. Design a turing machine to accept the set of all palindromes over {0, 1}*. Write transttioq
t':.'&"- table and instantaneous descriptions on input string 10101. (14 Marll$.lrl
8 Write short notes on:
a. Pumping lemma for CFL
b. Universal Turing Machine
c. Recursive languages
d. Post's correspondence problem.
**<***
2 of2
(20 Marks)

8. USN
Time: 3 hrs. Max. Haarfs:101,.
10cs53
(08 Marks)
(06 Marks)
(06 Marks)
(05 Marks)
(05 Marks)
(10 Marks)
(05 Marks)
(06 Marks)
(06 Marks)
-rn
5 €em cs
Fifth Semester B.E. Degree Examination, June/July 2Ol4
Operating System
a.
b.
c.
a.
b.
oi
,o
(.)
!
a
(B
.()
()
!
3.e
6V
3
^^ll
cco
.=N
d+
nooy()
otr-O
o2
6X
o(J
do
ootr
ad
6r
-4 o)
6|l
o-A
5c0
":
.9,
o=
.o tE
6E
LO
==
boo
tro0
ii=
o- ei
Xo
UL
e<
-.i o'i
o
'7
L
o
Note: Answer FIVEfull questions, selecting
atleast TWO questionfrom each part.
PART _ A
E4plain multiprogramming and time sharing operating systems.
List 6ut the different services that an OS provides? Explain any two.
Whai are the different categories of system program? Explain. r,,,,
With neat diaglam, explain components of PCB.
Explain direct,and indirect communication with respect to message passing systems.
d1
c. Consider the follci$i*e set of processes with CPU burst,{!&p'(in m secs)
, ?rocess Arrival time '" Burst time
Po 0 6
Pr I J
Pr '2 I
Pr J 4
D Draw Gantt chart illustrating the execution of above processes using SRTF and non
preemptive SJF
ii) Find the turn around timo*,.for.,each processos for SRTF and SJF. Hence show that SRTF
3 a. What do you mean..by a binary semaphore and counting semaphore? Explain the
implementation of wait( ) and signal( ) semaphore operatiom, (10 Marks)
b. What is race condition? List the requirements that a solutim to critical section must satisff.
' (05 Marks)
c. Explain &nt-6ns synchronization
scheme..
problem for testing new$"p osed synchronization
4 a. Consider the following snapshot of resource allocation at time tr
':, ::
J't
-,o.r.
";M.""' ,t1'|"::
':, ,,...,'
Po
Pr
Pz
Pr
P+
Allocation
ABC
010
2 0 0
303
211
002
Request
AB C
000
202
000
100
002
Available
AB C
000
i) Show that the system is not deadlocked by generating one safe sequence
ii) At instance tz, Pz makes one additional request for instance of type C. Show that the
system is deadlocked if the request is granted. Write down the deadlocked processes.
(08 Marks)
Describe resource allocation graph
i) With deadlock ii) With a cycle but no deadlock.
What is wait for graph? Explain how it is useful for detection of deadlock.
I of2
c.

9. 6.l l
t
10cs53
PART _ B
;:::.: 5 a. Explain internal and external fragmentation, with examples. (06 Marks)
,'}t. b. Considerthefollowingpagereference string 1,2,3,4,2,1,5,6, 2,1,2,3,7,6,3,2,1,'2,3,6.
"&.h,{ How many page faults would occur for the following page replacement algorithms assuming
"'";t"'',r:.,; 3 and 5 frames. i) LRU ii) optimal. (10 Marks)
",,c.
, What is the cause of Thrashing? How does the system detect thrashing? (04 Marks)
bd' i u
6 a. ',frff.tat do you mean by free space list? With suitable example, explain any two methods of
impl$,sqntation of free space list. (08 Marks)
b. What'alethe three methods for allocating disk space? Explain with suifable example.
(12 Marks)
7 a. Suppose that"a fisff has 50 cylinders named 0 to 49. The B/S/ head is currently serving at
cylinder 15. Theffire of pending requests are in order :'4{-N ll 35 7 14 starting from the
current head positikL.Wt ut is the total distance travelEfl'(in cylinders) by the disk arm to
satisff the requests uii*igalgorithms FCFS, SSTF end LOOK. Illustrate with figure in eaeh
. t,r.,tt
b. Write a note on : 'r "'' q
i) Domain of protection
ii) Access matrix.
r'L
(12 Marks)
(08 Marks)
(08 Marks)
(12 Marks)
8a.
b.
With diagram, explain componenls dftinux system.
Explain in detail, the componentb the k module support under Linux.
'i'l ?
'
':: ':::""
*,k*** ,
&.,f'!
,,,,,i,
2 of2