The document outlines a comprehensive examination for various software engineering and computer science subjects, including system software, database management systems, and operating systems, detailing the structure of questions and marking schemes. It emphasizes the importance of selecting questions from each part and covers a wide range of topics such as software attributes, legacy systems, process design, and database architecture. The exam requires students to demonstrate their knowledge and understanding by explaining concepts, solving problems, and working with algorithms.

1. 5u Se,n eS
10rs51USN
Software Engineering
Time: 3 hrs. Max. Marks:l(Su
Note: Answer any FfWfull questions, selecting , *ff*
atleast T"WO questions from each part. nP "
, mi,P
B
PARr-A n$"
#*'
E I a. What are the four importart attributes which all software products ,gffite? Explain.
E
---r ----'- -- ' '
QY (04 vtart<s;
H b. Explain the system design process with diagram ('I:' (06 Marks)
I i c. What are legacy systemi? Explain the components of lega.y slUqdfi with neat diagranr
*
= (}4F' (10 Marks)
gEtrc-^
g f 2 a. Explain four dimensions of dependability. ffi, (04 Marks)
H+ b. With dia$am explain rational unified process. t/ (06 Marks)
E S c. What is process iteration? Explain Boehm's spi@podel. t10 Marks)
Ery Ah"
S E 3 a. Discuss the problems of using natural langffie for defuring user and system requirements
C'tr .,t r
b E with examples. f ^- (10 Marks)
g .E b. Explain the following : i) EthnoEW i| Scenarios. (10 Marks)
aE
! [ 4 ?. Y,lh
r:* {tfluT, .*pJlh {ffir,irg lodeJ
of a simp.le mjcrowave ove} . . I{.M:.IO
Fifth Semester B.E. Degree Examination, 0iS/Jan.2016
Task Tr "m Tr Tq Ts To Tt Ta Te Tro Trr Tn
Duration
(Days) d
d15 15 10 10 5 20 25 15 15 7 10
Denenden*l& Tr
(mr)
TzTq
(mr)
TrTe
(mr)
Tr
(mr)
Tq
(ms)
TrTo
(m+)
TsTz
(rnz)
Tg
(mr)
Tii
(m*)
(10 Marks)
E S b. Refer the foltwing table.
"Qffi
an activity chart showing the project schedule. Find the
o'd
.$ H critical path. -{U'-!b
}EF5
Ed
-z'B.E a ltvsyo, F--t I I I I
*X lDependen.iffi* I lr, I lr2ralrlr2gA I rltill I l(mr)l l(mz)l(mr)
6€ 8
E E *$t PARr-B€E ry-
af 5 u. 6fu|tuin with example objects and object classi (04 Marks)
S A . &,JDefure concurrent objects. Explain the implementation of concurrent objects. (06 Marks)
E€
"W
Definecontrolstyles. Explainevent-drivensystem. (10Marks)
g-kffi a. What is prototype? Explain the process prototype development with diagram. Mention
?K*- benefits oiusing prototype. (10 Marks)
-C{: " b. Explain Lehaman's laws. (10 Marks)
o-
V 7 a. With neat diagram, explain clean-room software development. (10 Marks)
E b. Explain the following : i) Integration testing ii) Release testing. (10 Marks)
8 a. Explain the factors of governing staffselection. (10 Marks)
b. Describe with neat diagram COCOMO II model. (10 Marks)
:1. {. * :F ,$

2. USN
qt
o
o(g
EI
()
:0)
ER
r:'B
d9
=r)bs ll
d6
.= c.t
6+
gd
otr-g!l
s5
3y
EE 4
bd
do
botr
d6
P6
6+
5a
Time: 3 hrs.
10cs52
(04 Marks)
(10 Marks)
(06 Marks)
(04 Marks)
(10 Marks)
(10 Marks)
(06 Marks)
(04 Marks)
(10 Marks)
(10 Marks)
(10 Marks)
(10 Marks)
Fifth Semester B.E. Degree Examination, Dec.2015 lJan.2016
System Software
Max. Marks:100
a.
b. Explain the instruction formats and addressing modes of SIC,DG machine architecture.
Note: Answer FIVE full qaestions, selecting
at least TWO questions from each parl
PART _ A
Differentiate between system software and application software.
Write an ALP in SIC/XE to add two arrays of 100 words.
Explain the different data struchrres used in designing SIC assembler.
Discuss pass 2 algorithm of two pass assembler.
Explain load and go assembler with an example.
Explain multipass assembler.
Give the format for define and refer records.
What is a loader? Develop an algorithm for a bootstrap loader.
c.
2a.
b.
U. What is program relocation? Explain the problems associated with it and their solutions.
(06 Marks)
a.
b.
c.
a.
b. What is dynamic loading? What are its advantages and disadvantages? Explain with a neat
diagram loading and calling,of a subroutine using dynamic linking.
5 a. with a neat diagraar,; el-plain,n. u*lru.r..oru r.xt editor.
b. Explain the feaures'of interactive debugging system.
Etso-X
$ F 6 a. Explain any three machine independent macro processor features. (10 Marks)
3 I b. Write an algorithm for a one pass macro processor. (10 Marks)
9:E
p
E 7 a. What is regular expression? Briefly explain all the characters that form regular expression.
I E (12 Marks)
5 .: ..nr. "
nts .btiWrite a LEX program to count the number of characters, words, spaces and lines in a given
.f; g * *_
".1 input. (08 Marks)
a E -:*q
E i ffiry
.
. Write a YACC program to evaluate an arithmetic expression involving operators +, -, *, l.
)= tFa"* o3
{1,&' - (O8Marks)
ir"i b. Explain shift reduce parsing with an example. (08 Marks)
€ c. Define the following terms: i) yytext, ii) yylval, iii) yylex, iv) yyparse. (04 Marks)
z

3. *if,*i...:;l;,r..ir :ie. r.*USN,t
10cs54
Fifth Semester B.E. Degree Examination, Dec.2015 lJan.20l6
Database Management System .,,,r,
Time: 3 hrs. Max. Marks:lOQ
i,. ,..r . .. ". Note: Answer FIVEfull qaestions, selecting q';:*
Eli, .,*..i" . -.. ; ,,;,,i*.;:.r,. . , - At leASt TWO qUeStiOnS frOm eACh pArt 6&n
!t oro.r, ^ {3*.:.9 PART-A x,,,,,,.,1..i
h, 'u
iil . .,1.8, ...,',.ti :, .a;r . Write a.note on various types of end users who use DBMS. * *'
"d (08 Marks)
E b. Explain the three level DBMS architecture, with a neat diagram. Why do we need mappings
H between schema levels? Explain mapping in DBMS architecture. (12 Marks)
!0)
d
.,
g 2 a. Explain the ER notations used for various constructs in database schema (10 Marks)
$g b. With respect to ER model, explain with example
;"E- i) Composite attributes
g I ii) Cardinality ratio
.H + iii) Participation constraints
.E
+ iv) Binary relationship (10 Marks)
EBt {*.
€ E 3 a. Discuss the various type of JOIN operations'htPhy is theta join required? (06 Marks)
S
'E b. Consider the following relational scherna;
9 A users (uid, uname, cost) r 1
; 'E groups (gid, title, category, n, gsize, owner)
E B' posts (pid, uid, gid, tid, ptext, pdate)
= b Write the following queries-iu retational algebra.
I ; ':.^^"-;;'- -::"
"-B0 S l) Show the text and quffidr of all the posts made by user number 4 before March
: E 1,2007. ,.4ft-
-6
€ + ii) Show the namplbflthe all the users who responded to post number 2.
5 B iil) Show the g;(hYiil cost of all the users who are group owners and posted a thread on
H S 1.1.2004, m (oe Marks)
E I c. Explain the-ffi],ncT and PROJECT operations in relational algebra with example.
E q ;5" (os rvrarks)
e .H * d;"-
H S 4 a. rsp*ffihe following :
E E *-flf erimary key
E f *#"ii) noreign key>H{
.H & b J iii) Candidate key (06 Marks)
SE *ffiP. Consider the following relations:
5 E, db- Hotel (hotelno, name, address)
;*#W# Room (roomno, hotelno, type, price)
: 3 Booking (hotelno, guestno, datefronr, dateto, roomno)
ij Guest (guestno, name, address)
2 Write the SQL statements for the following :
E t) List the names and addresses of all guest booked the hotel, which is located in
e
g ,D ;l?:fi?lllri?liL"J;11',Tff'.'1.1#f:00 per night, in ascending order orprice
in hotel "RVH"
iii) How many hotels are there?
I of2
(09 Marks)

4. a
c.
l0cs54
Explain with example in SQL
i) Drop command
ii) Delete command A(0s Nrq{l$)
PART - B Fs#t
What is a view? Explain how to create the view and how view can be droppedS.i f,oh nnarrsy
Explain the following . q$"
i) Embedded SQL - S%
*
ii) Database stored procedure *q{%* (12 Marks)
{ $w
Explain informal {.?gjgn
griaeHnes for relation schemas. ,*q a w (06 Marks)
What is the need'for normalizatron? Explain the first, secondrforfrira normal forms with
examples.
Consider the schema
R: (A, B, C, D, E). Suppose the
E--+A
CD ---+ E
A --' BC
B+D
ion of R are lossless join decomposition or not,State whether the following
V
(10 Marks)
(10 Marks)
should be atomic? Explain ACID properties by
protocol used in concuffency control.
{<**
(10 Marks)
(10 Marks)
a#&. " (14 Marks)**+. &"
6S"_
$d
fo llowing fu nct"icinal dependencies ho ld
-',&s *,
t ,.,,,,,1
5a.
b.
6a.
b.
7a.
Justifz. 4
{(A, B, C), (A, D, E)} _tq
{(A, B, C), (C. D. E)} '* '
Explain the following i#
r) Inclusion dependencies
ii) Domain key Normal Form
8 a. Explain why a transaction execution
considering the fo llowing transaction
ri: i'#ri 1a;;
fl t'rrA: :A - 50;
",h"** write (A);
, ' read (B);
i::
{"T,rt B::B+50;
*".-
-' write (B);
y(5)b Briefly discuss on the two phase locking
{< {<
b.
2 of2

5. ile:14€9!{t}+{ '+
o)
o
o
!
($
6(g
0)
(d
0)
!
Ss 2
E=
''u'E
Ec
=Too ll
coa
,EA.d+
utoldo
tr'tro>
r9
(dO
ooi(!(B
- C.I
rt)
o
z
d
o
o,
Max. Marks: lOp
tu
/;i1!'
*+ i.?;"3, -
,i:ti|; ,l*
.,$s li'i1
?lUSN rbcsss
Fifth Semester B.E. Degree Examind ,2015lJan.20l6
Time: 3 hrs.
Operating Systems
Note: Answer FIVE full questions, selecting
at least TWO questions fro* each part.
PART - A
I a. Define an operatiing system? What is system's viewpoiint of an operating qysfam? Explain
the dual mode operation of an operating system.
-1;---
id*;.u,)
b. Explain the types of multiprocessor systems and the types of clustering. What are fault
b.
tolerant systems?
c. Explain the concept of virtual machines.
Process Arrival Time Burst Time Priority
Pr 0 10 4...,.. !:.:;;::,
Pz 0 1 t,
P3
1
J 2
a
J
Pq 5 1 4
Ps 10 2
Draw Gantt charts illrrsfre ecllflon o
What is a process? Draw and explain the state diagram ofua.".process. Give a note on context
switch. l .r,;
, (08 Marks)
Consider the following set of processes. Assume the length'of the CPU burst time is given in
(06 Marks)
(06 Marks)
(08 Marks)
(08 Marks)
EE
esYdoo
c.
'f,r
=Els,
!d
2-B
4+.
o
60
L
oo
*i5 {ts - aa
6 s" fl-vo -"i- q,e#s
'5qf,P -
Draw Gantt charts illustrating-'t$e'bxecution of these processes using FCFS'and pre-emptive
priority scheduling algoritffi"-Assume highest priority: 1 and lowest priority: 4. Also,
calculate average waitinF;lii,ft€ and averuge turn around time of both the algorithms.
..+.1, (06 Marks)*
*d., " (u0 NrarKs,
Discuss any 3 threadi issues that come with multithreaded programs. (06 Marks)
What are se ho?es? Explain any three use cases of semaphores. (04 Marks)a.
b. cess solution to critical section problem which uses test and set ( )Describe
. Prove how this algorithm satisfies all the requirements of critical
[em's solution.
how Readers - writers problem can be solved using semaphores.
ith the help of a system model, explain a deadlock and discuss the necessary conditions
that must hold simultaneously in a system for a deadlock to occur. (06 Marks)
following system is in a safe state.
lf a request from process Pz arrives for (0 0 2), can the request be granted immediately?
(10 Marks)
(04 Marks)
//se
r:7i'J
z
Usine Banker's alsorithm determine whether the
Process Allocation Max Available
Po
Pr
Pz
P3
P+
AB C ABC ABC
002
100
135
63 2
t43
004
201
137
8 42
1 5 7.
102
3:.:.t:;llLl*' j:." ii! 'i'?
c. How is a system recovered from deadlock?
I of2

6. 5a.
b.
c.
6a.
b.
c.
PART _ B
Discuss paging with an example. (08 Mapks)
Consider the following page reference string dS
r,2,3,5,2,3,5,7,2,1,2,3,8,6,4,312,2,3,6. ,1- r
Assuming there are 3 memory frames, how many page faults would occur in the Wffibf
D LRU ii) Optimal Algorithm. O( f/
Note that initially all frames are empty. (L/ (06 Marks)
What is thrashing? Explain. "t d{
^q)
- (06 Marks)
Explain the different file access methods. *-*m
*
(Q6-!talkq)t r*
ioii'rtilfl6:-u'r'ts+d'itDescribe the various directory structures. *,.$ 1,
W
Write a note on any four different methods for managing free S*dd (06 Marks)
7 a. Suppose the position of cylinder is at 53. The disk driv& Ccylinders numbered from 0 to
199. The queue of pending request in FIFO orderffi"98, 183, 37,122, l4;'t24;65;''67;'""'""= "'""
Starting from the current head position, what is theWll distance traveled (in cy.lrndgf$).rb1,,:;i_r.;Hn
the disk arm to satisff the requests using alftithms FCFS, SSTF, SCAN ;nd'Iiiok.
Illustrate with figures in each case. E1h" . ..,,{.1&Hs,_d.&-*Ft&IrIiS
b. Describe the access matrix model used for.plofection purpose. (0s Marki) ''
:to
a.
b.
c.
d.
Write short notes on :vvllttr SI-lUIt IlUtcS UIr
d*
Process Management in Linux ,d;/
Linux file system. 'n( !'
Benefits of Multi threading;5e;,*ii _
Inter process communic{i@
*$* F
.i
(20 Marks)
{<*t**
i.,",
,4- k
*'. ifl*s
.$
I
t'w
{ r*^b d
r t
.{Yq/}
*.4*
2 of2

7. USN
xCIcs55
Max. Marks:100
(&5 &6arks)
Fif'th Sernester B.E. Degree Exarnination, Dec.2015,6an.2016
Gomputer Networks .- I
Note: Answer FIVE.full questioms, selecting
ut least TWO questions from eack purt"
o
O
o
!
o
d
"a .,
3
-..1
d@
oci
c)2
i:(
_!
.., u
o-Xc:i
o,"
Ys
>'+
,.^ o
dbo
E?
L' <
;'r..i
a
o
t
Time: 3 hrs.
1a.
b.
(,.
2a.
4a.
1-
U,
5a.
b.
6a.
b.
7a.
b.
8a.
b"
c.
PART - A
Define network. With a neat diagram, explain the four basic topologies.
c. What is line coding? Represent the
N4anchester schemes.
Witir the heip of a diagrarn, explain the functionalities of each layer of OSI reference model.
{trO R4arks)
I-isi and expiain the four ievels of addresses used in an intemet employing the TCPiE)
protocois. (&5 S{arks}
Defirie latency. Briefly explain the components of latency. What are the propagation time
and transmission time for a 5 Mby.te message (image), if the bandwidth cf ths netv.ro;"k is
1 Mbps? Assurne that the distance between the sender and receiver is 12000 knt and that
light travels at2.4 x 108 m/s. (08 Marn<s)
b. Explain the FCM technique used for analog to digital conversion. (Tatr:ing suitabie example).
(&E Marks)
sequence "0100111C)" using i.'lRZ-L, NRZ-I and
(S4 Marks)
3 a. What is TDM? Explain in detail. (s;learks)
b. Explain virtual circuit network with an example, and also briefly discuss the phases.
{t& fr'Xarks}
c. Five channels, each with a 100 kHz bandwidth are to be multiplexed, toge&er. What is the
minimum bandwidth of the iink is there is a need for a guard band c,f l0 kFfz between tire
channels to prevent interference? {{}3 Marks}
How does datawords and codewords is represented in blcrck coding and
cffl errors be detected and corrected by using block coding.
Find the code word using CRC given data
001101"
and generator "1100".
with a neat diagram, explain unr rrnffiof noisy channel.
Explain the frarne fonnat of HDI-C protocol.
Describe pure ALOHA and slotted ALOHA.
What is channelization? List and explain the channelizatron prrctocols.
Explain the different types of addressing mechanism in IEEE 802..11.
Define Bluetoo,th and explain the architecture of Bluetooth.
With a neat diagram, explain the categories of connecting devices.
Exptrain classful addressing and classless addressing with respect to IPV4.
Explain in detail IPV6 packet format.
Give a comparison between IFV4 and iPV6.
also explain how
(1S Marks.g
(tr& Marks)
(12 Marks)
(CI8 &farks)
(tr0 Marks)
(trO Marks)
(S5 Vtrarks)
(CIS l${arksi
{t$ Marks)
(08 Marks)
(0E &tarles)
{CI4 S{arks)
*****

8. la.
b.
a)
o
O
d
d
.J
I
boP
X2
d9
:r)
.g&
io
eO
*-
6;;
oO
-k(dO
o€
qc-
oj
?-Y
!O
o.=>1 (F
cno
O=
F>
o
U<
o
o
Z
P
o
o.
E
USN 10cs56
Fifth Semester B.E. Degree Examination, Dec.2015 IJan.20l6
Formal Languages & Automata Theory
Time: 3 hrs. Max. Marks:100
Note: Answer FIVEfull questions, selecting
at least TWG questionsfrom ewck pat't.
PART _ A
What is Automata? Discuss why study automata.
Mention the differences between DFA, NFA and NFA-c .
d. Design the NFA-e or NFA for the languages given below:
i) abe, abd and aacd {Assume l: a,b,c,d }
ii) lab,abclx {Assume [=a,b,c]
2 a. Covert the following NFA-e to DFA using "subset construction sclxeme"
Fig. Q2 (a)
b. Define Regular expression and write regular expression for the following languages:
i) ;=1a2nb2-:n>0, m>0)
ii) Language over {0, 1} having all strings not containing 00.
c. Convert the regular expression (0+1).1(0+l ) to a NFA-e .
a. State and prove pumping Lemma theorem for regular languages.
I = {a"b' ln > 0} is not regutrar.
b. What is Homomorphism? Explain with an example.
c. Consider the transition table of DFA given below:
01
-+A
B
C
{<D
E
F
G
F{
F-ig. Q3 (c)
D Draw the table of distinguishabilities of states.
ii) Construct the equivalent minimized DFA.
Design a DFA to accept the language L = {W/W is of even length and begins with 01}.
,, {&6 Marks}
(85 Man'ks)
(04 Nlarks)
($4 Marks)
{08 Marks)
(06 N{arks)
(06 NIarks)
Show that
(08 h{arks)
(04 Manks)
B A
A C
D B
D A
D F
G 1.,
F' tl
G D
1 ofL
{08 *4arks)

9. 10cs56
a. Obtain a grarmnar to generate integers and write derivation for the unsigned integer 1965.
(08 Marks)
b. Consider the grammar:
S -+ aS I aSbS le
.Is the above grannma.r ambiguous? Show that the string aab has two -
i) . Parse frees
ii) Left most derivations
iii) Rightmost derivations
(08 Marks)
(12l{arks}
(08 IVIarks)
(S4 Marks)
(20 Marks)
PART _ B
5 a. Define pDA. Design PDA to accept the language L(M) = {*a*o lr,r e (a * b)-} by a final
state and also give the graphical representation of PDA. (tr2 Marks)
b. Convert the follorving CFG to PDA:
6a.
S+aABBlaAA
A -+ aBts la
B+bBBlA
C-+a
Consider the fcrllowing grammar:
S+AStsle
A+aASla
E+SbSlAlbb
i) Are there any useless symbols? Eliminate if so.
ii) Eliminate e productions.
iii) Eliminate unit productions.
iv) Fut the grarnmar into Chomsky Normal Form.
Show that L = {anbnc' in > 0} is not context free.b.
C. Frove thattthe context free languages are closed under union, concatenation and reversal.
(08 Marks)
7 a. Design a ttring machine that perf,orms the following function:
eoo l* *qrcoo for any rrl e {1}
x
and also write its transition diagram. (12 Marks)
b. Explain ttrLe general structure of multitape and non deterministic turing machines. (08 Marks)
I Write short notes on:
a. Applications of regular expressions.
b. Applications of context free Grammars.
c. Fost's correspondence problem.
d. Chomsky hierarchy.
,FA**r,<
2 of2