1. d e IUSN
Fifth Semester B.E. Degree Examination, June/July 2013
Software Engineering
Time: 3 hrs.
Notez Answer FIVE full questions, selecting
at least TWO questions from each part.
PART - A
1 a. What are the key challenges faced by software engineering? Give
delivery is challenge.
b. Explain the emergent system properties.
06rs51
Max. Marks:100
an example for how
(10 Marks)
(10 Marks)
(I0 Marks)
(10 Marks)
(10 Marks)
(05 Marks)
(05 Marks)
(05 Marks)
(05 Marks)
equivalence paft itioning
(10 Marks)
(05 Marks)
(10 Marks)
(05 Marks)
a.
b.
c.
a.
b.
E
9)
-^t
tE
;!!
..ir
'CA
o-a
9J;
AE,
;!
6=
o- ;:
:>
-i .i
E
2 a. What are various types of critical systems? Give example to each and state at least one
reason why your example is critical. (10 Marks)
b. with neat sketch, explain the spiral model of software development process. Give its
(10 Marks)advantages.
3 a. Explain non-functional requirements giving examples to each t)?es (product, organization,
(08 Marks)external).
b. Discuss the problems with using natural languages for requirement specifications. (08 Marks)
c. Write the structure of standard requiremenl Document. (04 Marks)
4 a. Write the state chart for
descriptions.
microwave oven model. Indicate all the possible states-and their
b. Explain the software project management activities.
PART - B
5 a. Discuss the various architectural design decision made during software design. (10 Marks)
b. Distinguish between centralized control and event based control styles. Give one example to
each. (05 Marks)
c. What are the advantages ofadapting object models for modular decompositions? (05 Marks)
8a.
b.
What are the principles of agile methods of software development?
What are advantages of pair programming?
What is software prototyping? What are its benefits?
Differentiate between verifi cation and validation.
Explain the concept of clean room software development.
What is equivalence partitioning? Explain with an example how
helps in testing.
Write a short note on P-CMM.
How is COCOMO used to estimate the cost of a software?
Write a note on project staffing.

2. USN
Time: 3 hrs.
06cs52
(04 Marks)
Fifth Semester B.E. Degree Examination, June/July 2013
Systems Software
Max. Marks:1O0
.E
o
s
3s
F=
-on I
.=N
ET
q=
g:
:i'ia
.9=
EO-
qJE
AE
6E
(-, <
-i 6i
o
z
s
E
Note: Answer FIVE full questions, selecting
at least TWO questions from each port.
PART_A :.
I a. Generate the target address for the following machine instructions:
D 032600h ii) 03c300h iii) 010030h
if(B):006000, (PC) = 003000, (x) = 000090. (06 Marks)
b. Explain the instruction formats and addressing modes of SIC,iXE machine architecture.
, '.. t., (10 Marks)
c. Write a sequence oi instructions in SIC/)G to write a l@-byte record fiom BUFFER into
2a.
b.
output device 'F5'
lass assembler.Write and explain the algorithm of pass 1 of 2,pass assembler. (10 Marks)
Generate the object code and the symbol tabh,for the following assembly level program
RDREC START 1036
CLEARX
CI,EAR A
CLEARS . '
+ LDT # 4096
RLOOP TD INPUT .
JEQ RLOOP
RD INPUT
CMPR A, S
JEQEXIT
STCH BUFFER, X
TIXR T
JLT RLOOP
STX LENGTH
RSUB
BYTE X'F1'
RESB 4OO
RESB 2
END RDREC
EXIT
INPUT
BUFFER
LENGTH
Assume:
CLEAR : 84, LOT : 74, TD: E0, JEQ = 30, STCH : 54, TrXR - 88, JLT = 38,
STX: 10, RD : D8, RSUB :4C, X: 1, T:5. (IO MArKS)
3 a. Differentiate between literal and immediate operands. How does the assembler handle the
literal operand? (05 Marks)
b. Differentiate between program blocks and control sections. With an example explain how
control sections are processed. (08 Marks)
c. With an example explain how forward reformers are handled by one pass assembler.
(07 Marks)
1of2

3. 06cs52
4 a. What do you mean by relocating loaders? Explain the two ways of doing relocation.
(10 Marks)
b. Briefly explain the data structures used in linking loaders. (04 Marks)
.....
c. What do you mean by dynamic linking? With a diagram explain dynamic linking. (06 Marks)
.:],,.,. PART-B
5 a. iWith a neat diagram, explain the structure of a text editor. (10 Marks)
b. Explain the features of interactive debugging system. (t0 Marks)
6 a. What are the basic functions of macro processor? Explain the various data structures used in
the implemd4lation of a one-pass macro processor . . (10 Marks)
b. Explain geneidtion ofunique labels in macro processors. (05 Marks)
c. List the advantages and disadvantages ofa general purpose macro processor. (05 Marks)
7 a. With an example opiiiloth. structure of a lex prograrn (06 Marks)
b. What is a regular exnressio{,fxllain any 8 chqracters that form a regular e*pr.r.if,t
r"rur;
c. Write a lex program to count the number of words in a text file. (04 Marks)
8 a. Explain shift reduce parsing with an dxample. (06 Marks)
b. Write a YACC program to evaluate the arithmetic expressions. (06 Marks)
c. Define YACC tools. What are two types of conllicts in YACC? Give examples. (08 Marks)
:F****
2 of2

4. IJSN
10cs52
(05 Marks)
machine.
(07 Marks)
(08 Marks)
(08 Marks)
(12 Marks)
(10 Marks)
(12 Marks)
(05 Marks)
(03 Marks)
Fifth Semester B.E. Degree Examination, June/July 2013
g
fry
-E!
.=&
g
oB
-6r
-a'= ..
6.9
:9
o<
;
a
z
E
c. Write sequence ofinstruction fbr SIC to clear 20 bytes strings to all blanks.
2 a. Write the fundamental functions olassembler.
b. Define assembler directive. Explain the different types of directives used in SIC
c. Write and explain the algorithm of PASS - 1 of two pass assembler.
4 a. Wrile a bootstrap loader algorithm. Explain it.
b. Illustrate linking and relocation with sample programs.
the implementation ofone - pass macroprocessor.
7 a. List and explain the different design options lor a macroprocessor.
b. Explain the structure of LEX program.
c. Explain the "communication parser".
a. Distinguish between literal and immediate operands. How does the assembler handle the
literal operands? (07 Marks)
b. What is a program block? How does the assembler handle the program blocks? (10 Marks)
c. What is the need of pass - 2 algorithms? Give example. (03 Marks)
8 a. Write a LEX program to corult the number of vowels and consonants in a given string.
(06 Marks)
b. Write a YACC program to recognize the given arithmetic expression containing +. -. /. *
operator. (08 Marks)
c. What do you mean by ambiguous grammer? How it can be overcome? Illustrate with an
example. (06Marks).
System Software
Time: 3 hrs. Max. Marks:100
Note: Answer FIVE full questions, selecling
atleast TWO questions ftom each part.
PART_A
a. Bring out the difference between system software and application software. (06 Marks)
b. With respect to Pentium pro architecture, explain the following :
i) Instruction format ii) Data format iii) Registers iv) addressing mode. (10 Marks)
(04 Marks)
PART - B
.,i )
5 a. With a neat diagram, explain the structure of text editor. . .. I (10 Marks)
b. Exptain the features of interactive debugging system. (10 Marks)
6 a. List machine independent macro processor features. Explain any two with an example.
(10 Marks)
b. What are the basic functions of macroprocessor? Explain the various data structures used in

5. 10cs53USN
Time: 3 hrs.
Fifth Semester B.E. Degree Examination, June/July 2013
g
E
2
g
;9p
.= o
'o5
-E
-a
d- g-
tro
}U
6.=
bno
F>
(r<
_. .i
z
ts
o
E
D
ii)
iii)
Max. Marks:100
:
executio processes using FCFS, SJF,
4
Operating Systems
Note: Answer FIVE full questions, selecting
at leost TWO questions.from each part.
Draw four Gantt charts
PART-A
a. List and explain services provided by an operating system that are designed to make using
computer systems more convenient for users. (08 Marks)
b. Is separation of mechanism and policy desirable while designing an operating system?
Discuss with an example. (04 Marks)
c. With.a neat diagram of VM-WARE architecture, explain the concept of Virtual Machine
(VM) and the main advantage of using VM architecture. (08 Marks)
a. What is a Proc-ess Control Block (PCB)? What are the different states in which a process can
be in its life cyele,-discuss with the help of a state kansition diagram. (05 Marks)
b. Is CPU scheduling necessary? Discirss the five different scheduling criteria used in
comparing scheduling mechanrsms. (06 Marks)
c. Consider the following set of processes, with length of the CPU burst time given in
milliseconds:
Process. .Arrival time. iurst-time Prioritv
P1
P2
P3
Pr
Pr
0
0
l0
I
2
I
5
3
1
3
4
2
ins the execution ofthese
a non preemptive priority and RR (Quantum - 2) scheduling.
What is the turn around time of each processes lbr each of the scheduling algorithms
in r i).
What is the waiting time of each process for each of the scheduling algorithm in (i).
3 a. Describe an N-process solution to critical section problem
(09 Marks)
test and test ( ) atomic
instruction. Also explain how the algorithm satisfies all the requirgrirents of critical section.
(08 Marks)
b. Servers can be designed to limit the number ofopen connections. For exarnple, a sever may
wish to have only N socket connections at any point in time. As soon as N connections are
made, the server will not accept another incoming connection until an existing connection is
released. Explain how semaphores can be used by a server to limit the number ofconcurrent
corurections. (04 Marks)
c. Explain the range of monitors with a schematic view of its structure; write a monitor
solution to bounded-buffer problem. (08 Marks)
a. What is a dead lock? Consider the traffic deadlock depicted in the figure given below,
explain that the four necessary conditions for dead lock indeed hold in this example.
(05 Marks)
Fig.Q.4(a)
I of2

6. 10css3
b. Consider the following snapshot ofora
Allocation Max Available
P6
Pr
Pz
P:
P+
ABC
002
100
135
632
143
ABC
004
201
137
842
157
ABC
102
Answer the lollowing questions using Banker's algorithm:
Is the system in a "satb state"?
Ifa request from process P2 arrives for (002) can the request be granted immediately?
(10 Marks)
c. What are the methods used to handle the dead locks? Explain how circular wait condition
can be prevented fiom occurring.
PART _ B
5 a. What are the drawbacks of contiguous memory allocation? Given five memory partitions of
100KB, 500K8, 200K8, 300KB and 600KB (in order), how would each ofthe l-rst fit, best
fit and worst fit algorithms place processes of 212 KB, 417 KB, 112KB and 426 KB (in
order)? Which algoiithm makes the most efficient use of memory?
b. Consider a paging system with the page table stored in memory.
i) If a memory reference takes 200 nano seconds, how long does a paged memory
reference take?
ii) Ifwe add associative register and 75 percentage of all page table references are fbund
in the associative registers, what is the effective memory access time? (Assume that
finding a page table entry in the associative memory/registers takes zero time, if the
entry is found). (04 Marks)
c. Consider the following page refergnce string:7 0 I 2 0 3 04230321201 7 01 fora
memory with three frames. How many page faults would occur for LRU, FIFO and optimal
page replacement algorithms? Which is the most efficient among them? (10 Marks)
6 a. Explain the various file operations supported by the operating system, also differentiate
mandatory lock and advisory lock mechanisms used on files by the operating system.
(05 Marks)
(06 Marks)
(05 Marks)
(08 Marks)
(07 Marks)
7 a. SuppoSe'that the disk drive has 5000 cylinders numbered llom 0 to 4999. The drive is
curreiitly serving a request at cylinder 143, and the previous request was at cylinder 125.
The queue of pending requests in FIFO order is 86, 1470, 913, 17'74, 948, 1509, 1022,
1750, 130. Starting from the current (location) head position, What is the total distance (in
cylinders) that the disk arm moves to satisfr all the pending requests, for each of the
following disk-scheduling algorithms?
i) FCFS; ii) SSTF; iii) SCAN; iv) LOCK; v) C-SCAN. (15 Marks)
b. Describe the methods used lor implementing the directories.
c. Explain v.arious file protection mechanisms.
Write short notes on:
Portability issues in LINUX
Performance of demand paging
Multithreading models
Network structure in LINUX.
2 of2
b. Discuss the strengths and weaknesses ol implementing an access matrix using access lists
that are associated with objects. (05 Marks)
a.
b.
c.
d. (20 Marks)

7. USN
Time: 3 hrs.
Fifth Semester B.E. Degree Examination, June/July 2013
o
E
q
--l
9?
-a'=^
!-=
o- ir
Fq
6.n
qE
ono
a3
=>
U<
a
z
o
la.
b.
c-
3a.
b.
c.
d.
(06 Marks)
(05 Marks)
and multithreaded process.
c. For the following processes in ready queue, find. _
i.; ar erage waiting time
ii) average turn around time using the following scheduling algorithms and Gantt chart
illustrations:
Process Burst time (ms) Arrival time Priority
A l0 0 3
R I 1 1(hieh)
C 2 2 J,
D 1 3 4
E 5 4 2
Shortest job first (preemptive and non -preemptive)
Priority
Round robin (q : 2).
(10 Marks)
What is critical section problem? Explain the requirements to be satisfied by any solution to
critical section problem. (04 Marks)
Describe test and set and swap instructions and their use in synchronization ofprocesses.
(05 Marks)
What is a semaphore? How can it solve mutual exclusion problem? Explain bounded buffer
D
iD
iiD
problem using semaphore.
Explain solution to dining philosophers problem using monitors.
Operating Systems
Notet Answer FIVE full questions, selecting
atleast TWO questions from edch port.
PART-A
Explain the different view points that are used to understand the role ofan operating_sy-stem.
(05 Marks)
Why is dual mode operation in operating systems required? Explain. 104 Marks)
(06 Marks)
Explain the salient features of
i) Distributed operaling systems
ii) Real time operating systems.
d. With examples, explain how system calls handle user applications.
2 a. With illustrations, explain how processes are created and executed i, u, op".uting(;I.J:ll;g
b. What is a thread? How does it differ from a process? Differentiate single threaded process
06cs53
Max. Marks:100
(06 Marks)
(05 Marks).
1of2

8. 06css3
4 a. Define deadlock and explain the necessary conditions for deadlock situation to occur.
(05 Marks)
b. Consider the following snapshort ofa computing system :
Answer the following questions using bankers algorithm :
i) What is the c<jiitent of matrix needl
ii) Is the system in a-sefe state?
iii) If the request frbr-n..process P1 arrives for (0,-4, 2,
immediately? Will syitem be in a safe state?
f)iscuss issues related with recovery from deadlocks.
0), can the request be granted
(10 Marks)
(05Marks)
(09 Marks)
(07 Marks)
(08 Marks)
(10 Marks)
(10 Marks)
'...
... PART_B
-.,',.
5 a. Explain intemal and external fragmentation problem encountered in a contiguous memory
allocation scheme. (04 Marks)
b. Consider the following page. relerence string :
232152453252,.
How many page faults occur in the following
frames : i) FIFO ii) LRU iii) Optimal.
replacement algorithms by assuming 3 page
c. What is virtual.memory? How can it be implemented? What are its benefits?
Explai&1hi different approaches to managing free space on disk strirage. (10 Marks)
What:.iire the different file tlpes? Give their functions along with one example
", ifflr:ff;
a. Sketch how SSTF disk scheduling occurs for request queue ofcylinder numbers :
55, 58, 39, 18, 90, 160, 150, 38, 184 when the head starts at 100. (04 Marks)
b. Describe the access matrix model used for protection in operating systems. (08 Marks)
c. Discuss the use of passwords as a mechanism for ensuring user authentication in operating
6a.
b.
8a.
b.
system security.
Explain the different components of a LINUX system.
Discuss how memory management is dealt with in LINUX operating system.
2 of2
Process
Allocation Max Available
A B C D A B C D A B C D
Po 0 0 1 2 0 0 1 2
,|
5 2 0
Pr 1 0 0 0 7 5 0
Pz I , 5 4 2 3 5 6
P3 0 6 J 2 0 6 5 2
P+ 0 0 I 4 0 6 5 6

9. USN
Time: 3 hrs.
06css4
Max. Marks:100
(10 Marks)
(06 Marks)
importance of referential integrity
- (06 Marks)
. : -l '
-li .i
ri
(08 Marks)
Fifth Semester B.E. Degree Examination, June/July 2013
NS:
E
E
I
--t
.=A
9.
Y6r
:s-r)
aB-
EO
66
,n
9;-
tr<
o
z
E
Database Management Systems
Notez Answer FIVE full questions, selecting
qt least TlltO questions from each part.
ii) Darabase
iv) Data model. (08 Marks)
b. Explain with neat diagram the operation of a two-tier,elient server architecture for RDBMS.
(08 Marks)
c. What are data base utilities? List the few funqions that utilities perform. (04 Marks)
'. - '. .'.,.
2 a. List out the notations for E-R diagfim a.nd their meaning. (10 Marks)
b. Design an E-R diagram for hospital information system by taking into account with at least
PART - A
I a. Define the terms:
i) Data
lour ent it ies.
3 a. Discuss the characteristics ofrelations with examples.
b. Define referential integrity conslraint. Explain the
constraint in SQL.
c. Consider the two tables, show the results of the fo
R tr( n.cote = s.core S
R +<pso14=5qe14 S
R ><= p 6o14 = 5.61o14 S
R +G p 6n1a=. pn1a S
R
Col A Col B
A 1
B 2
D J
F 4
E 5
4a.
b.
5a.
b.
Explain with syntax the sin clauses in SQL including EXISTS and ORDER BY clause.
(12 Marks)
Explain with examples in SQL: i) Drop command; ii) Delete command. (08 Marks)
PART - B
Define virlual table. Explain how to create the view and how view can be dropped.(07 Marks)
Write a note on aggregate functions with examples.
I of2
llo o
s
Col A Col B
A 1
C 2
D J
E 4
(13 Marks)

10. 7-
6a.
b.
06cs54
(08 Marks)
(12 Marks)
t--
.1 a. Explain the phases involved in an ARI ES algorithm with examples. (10 MeS
l(bt b. Discuss the properties of a transaction with state transition diagrarn (t0 Imls)ty{) t./r ,^Y l
I "F - write short notes on: .t)t
a.Clyo phase locking
b. Y,Fjdded sQL - ")
c. Re's&;iye relationship tlpe ,..
u4 '
d. TimeSryrp ordering algorithm. &' :) (20 Marks)
'",&*" n:'
'ld* ,'lt"''
v/ cli,*
?r, *****
ll-.- i
-
-
-(-t ^ ,{r- /A.
-a $ry
'S,"" o.
'// -.h-(rt'.(- Jr'r
Yr"
-v--'
. l
{)
ft" -f .,,
.6 a -'
{-
.' LQr^ l
.^) l yi
ht', 'av
" 6q "j'
it(/ ,)
^
./)'r.j.!
. .hef
- r.;,
x" I
.A !.,r
rr i;
,*J L/^
J
."J -
.,*1 -1,-,
,*--
4.:
i..,ii. & "/ 1
& -&{
Explain the informal guidelines for relational schema.
With examples discuss. First normal form lNF, 2NF, 3NF and 4NF.
2 of2

11. USN
10cs54
Max. Marks:100
Fifth Semester B.E. Degree Examination, June/July 2013
Database Management System
Time: 3 hrs.
PART_A:
I a. Whal are the main characteristics ol the database approach over the file processing
approach? (08 Marks)
b. Explain the different categories of data models. (06 Marks)
c. Explain the tfueg , schema architecture. (06 Marks)
2 a. Explain the diff6rent types of attributes that occur in the ER model. Write their
corresponding notations. (08 Marks)
b. Write the ER diagram for an employee database. The constraints are as follows :
i) An employee works for.a department
ii) Every department is headed by a manager
iii) Ar employee r.lorks on one or more projects
iv) An employee has dependents
v) A department controls the projects. (l2Marks)
3 a. Write the relational algebra op.irations to perform the following queries :
i) Retrieve the name and.'address of all employees who work for the "Accounts"
depanment
ii) Retrieve the names ofemployees who have no dependents
iii) Find the names.of employees who work on all the projects controlled by department
number 2. , - ... (12 Marks)
b. Explain the relational algebra operations from set theory, withexamples. (08 Marks)
4 a. Explain the different constraints that can be applied during table oeation in SQL, with a
(08 Marks)suitable example.
b. Write the SQL queries for the following database schema
student (USN, NAME, BRANCH, PERCEMTAGE)
faculty (FID, FNAME, DEPARTMENT, DESIGNATION, SALARY)
. coURSE (CrD, CNAME, FrD)
,. ENROLL(CID, USN, GRADE)
i) Retrieve the names ofall students enrolled for the course 'CS - 54'
iil I-ist att the departments having an average salary ofthe faculties above Rs 10,000
iii) List the names ofthe students enrolled for the course 'CS - 51' and having 'B' grade.
(12 Marks)
PART - B
a. Define views. Give an example to create a view. (08 Marks)
b. Explain the different approaches for database programming. Explain the problem that arise
in some ofthe approaches. (12 Marks)
Notez Answer FIVEfull questions, selecting
atleast TliltO questions from each part.
.S.
Yor
'CA
AE
5.Y
iD=
U:
(r<
-i ..i
o
z
E
1 of 2

12. r
10cs54
6 a. List the inference rules for functional dependencies. Write the algorithm to determine the
closure ofX(set ofattributes) under F(set of functional dependencies). (08 Marks)
b. Define the lNF, 2NF and 3NF with a suitable example for each. (12 Marr$)
*rA
-^ Write the algorithm fio testing non additive join property. (rrd$
rYr)); Exolunthe 4M witha suitable example.
.dp*""*,
A
'{
(Tr,rpllnthe ACID properties of a database transaction. , g. 1ol n'rarrrs)
b. -fi2fly e*plain theiwo phase locking protocol used in concurrency controlqi" (08 Marks)
" ,%;;phases orthe ARrES recovery moder.
.-S*.
(0E Marks)
,A/ ***'**
'nt/qn $'"%
o,@-o/
^ s*(r1 .
.r-o, -a"- nr,' -7^
^v-, 'u,
.$'
,"""
' @-,-
) /-i
dg' 'Po
, o' -'/a
-rrr -d.^
-*$'
^v 'o;1-l- /.
,..} 'v..
ri g
. ( "4^
,h-r t4o
_ -/
Y
2 of2

13. USN
06csss
Max. Marks:100
(06 Marks)
(06 Marks)
(06 Marks)
based on the layer of operation in a network.
(06 Marks)
ii) TDD - TDMA. (08 Marks)
(06 Marks)
(06 Marks)'
(08 Marks)
Fifth Semester B.E. Degree Examination, June/July 2013
Gomputer Networks - I
Time: 3 hrs.
Note': Answer FIYE full questions, selecting
atleast TWO questions from each part.
E
+wl
"-t
d9!
q.
-a
9'=
66
!.9
a,:
i9
i.-.; o
a3E>
?>,
U<
o
z
a
A
E
PART_A
I a. What do you mean by the term, data communication? Explain the different lorms
of data representation. (06 Marks)
b. Explain the fundamental characteristics for effective data communication. (06 Marks)
c. Explain with diagram, the OSI reference model for computer network. (08 Marks)
c. Draw the line coding waveforms for the data stream 101 101, in the following schemes
i) NRZ I iD RZ iii) Manchester iv) AMI write average signal rate for each r"niilii"ru,
a. With the help of neat wavefotms, explain the following :
i) Binary ASK ii) Binary FSK iii) Binary PSK. (06 Marks)
b. With the help of neat diagram, explain the synchronous and statistical TDM schemes'
c. what is spread spectrum? Explain the goals of spread spectrum. Discuss FHSS ,"Jfl:,H:i?
spread bandwidth. (08 Marks)
a. Explain the principle used to guide light in optical fibers. Discuss the advantages and
disadvantages oloptical fiber. (06 Marks)
b. Explain the terms - Hamming distance and minimum Hamming distance. What is the error
detection and correction capability ofa coding scheme which has d,in : 5? (06 Marks)
c. Obtain CRC codeword using generator polynomial g(r): *3 + xr + 1, for the data - 1001
show how CRC bits can be used for error detection. (08 Marks)
PART_B :
a. Explain the concepts of bit stuffing and blte stuffing, with example. (06 Marks)
b. With the help of flow diagram, explain stop and wait ARQ protocol. What is the drawback
c. Explain the frame formats and control fields of different tlpes of frames in HDLC.(08 Marks)
6 a. Explain the three persistence methods of CSMA. (06 .lvlarks)
b. Explain 802.3 MAC sublayer frame format. (06 Marks)
c. Explain with the help of an example, how encoding and decoding is done in CDMA
technique. (08 Marks)
2 a. Explain the causes of transmission impairment.
b. Discuss Nyquist bit rate and Shannon's channel capacity.
7 a. Explain with flowchart CSMA/CA.
b. Explain the categories of connecting derives
c. Write a note on : i) Hidden station problem
8 a. What is the bit rate of STS - l? Explain STS multiplexing.
b. Explain the architecture of an ATM network. Discuss virtual connections in ATM.
c. Write a note on (any one) : i) GSM iD SONET frame format.
*****

14. 10cs55USN
Fifth Semester B.E. Degree Examination, June/July 2013
Gomputer Networks - I
Time: 3 hrs. Max. Marks:100
Note: Answer FIVE full questions, selecling
b.
. . (10 Marks)
:-(10 Marks)
in unipolar, NRZ-L, Maiidhelsters, AMI,
Pseudoternary? (06llarks)
b. The losilin a cable defured in debels/km (dB/km). Ifthe signal at beginning ofa cable with
-3 dB/krn-!$ a power of 3 mW. What is the power of the signal atJ km? (06 Marks)
c. Explain theSCM encoder. ."- -.. - (08 Marks)
3 a. Explain frequency hopping spread spectrum (FHSS). (10 Marks)a. Explam requency ngppmg spreao spesrrum (rEDJr. (ru rvr rKs,
b. Four 1 Kbps connections are multiplexdd together. A unit is I bit. Find
i) The duration of 1 Lrit before multiplexing. ...",
ii) The transmission rate of the link.
iii) The duration ola time slot.
iv) The duration of a frame. ., (05 Marks)
c. Differentiate between circuit switciled, datalram networks and virtual circuit networks.
(05 Marks)
a. Explain structure of encoder and deoodr|&r hamming code. (08 Marks)
b. Find the codeword, using CRC given dataword 1001 and generator 101 1. (06 Marks)
c. What is internet checksum? W.ith. air example, list the steps undertaken by the sender and
receiver for error detection. (06 Marks)
PART - B
5 a. Explain stop-and-wait {(Q protocol with neat dialiam. (08 Marks)
b. What is framing? Elplaiir bit and character stu{frng with aii example. (04 Marks)
c. Write short notes.eiirHDlc. ,. (08 Marks)
6 a. Explain CD41. (06 Marks)
b. A slotted ALOHA network transmits 200 bit frames using--,.&. strared channel with
200 K-lit#iec bandwidth. Find throughput if system produc'ek,il 1000 frames/sec
ii) 50Q,6u-..7... iii) Frames/sec. (06 Marks)
c. E1.<plain 802.3 MAC fiame format. . .- (08 Marks)
7 a,_r.. Explain the architecture of IEEE 802.1 1 . r .-., ..{10 Marks)
b. Explain connecting devices. (l0Marks)
.8 d. Draw IPV4 header format and explain. (08 Marks)
. b. AISP is granted a block of address starting with 190.100.0.0/16 (655,536 address). The ISP
needs to distribute these addressing to 3 groups ofcustomers.
i) First group has 64 customers each needs 256 address.
ii) Second group has 128 customers each needs 128 address.
iii) The third group has 128 customers each needs 64 address.
Design the subblock and findout. How many addresses are still available after their
allocations? (07 Marks)
c. Compare between IPV4 and IPV6. (05 Marks)
t least TWO questions from each part.
.,.., PART-A
'-l' a. Explain OSI reference model.
b. ,Explain categories ofnetwork and di{ferentiate between them.
2 a. 'Represent the given sequence 01001110 in unipolar,g
E
oal
yo
32
'o!
;i
5r
9J i;
b!o
A;:
U<
z
t
o

15. USN 06cs/rss6
Fifth Semester B.E. Degree Examination, June/July 2013
'.Time: 3 hrs. Max. Marks.l00
Note: Answer FIVE full questions, selecting
at least TWO questions from each part.
PART-A
::-.-
Define a regular expression, pra..ve that for eiVery regular expression, there exists a finite
automata which accepts same lanil0age acceplid by the regular expression. (10 Marks)
Write a note on applications ofregular expressions. (04 Marks)
Give regular expressions for the following,languages:
D L: {Ww is in {a, b}* and iw}, mod 3 :0}
ii) L : {W/W is a strine
1f{.9
and b's ending with aab}. (06 Marks)
Prove thal regular languages are closed under union. complementation and intersection
operations. '. (08 Marks)
State and prove pump,ing lemma of regular languages. (08 Marks)
Prove that the language {anbn : n > 1 } is not regular. ... (04 Marks)
,.'.
Forma! Languages and Automata Theory
Define a coqterl fiee grammar. Design a context free grammar for tl
i) L= {Wa'b'WR: Wis in {a, b}*}
E
39
-^t
.s&
i ..)
-o
=11a-AFo.
5d
9ii
AE
^:
r-, <
.i ..i
o
z
ts
o
a
la.
b.
c.
2a.
b.
c.
3a.
b.
c.
4a.
b.
i) I.: {W a" b" W : W is in {a, b}*}
ii). ,L:(a2'b":n>1).
DEfirie ttre following terms:
(12 Marks)
ii) Parsing ,-/ |
iii) Inherently ambiguous grammar , ;'j t .
iv) Left most and right most derivations. rt (08 Marks)
PART-B
5 a. Explain the working of a PDA with a neat diagram. Which data structure helps a PDA to
accept a context llee language? (06 Marks)
b. Design a PDA for all strings of a's and b's with equal number of a's and b's. (08 Marks)
c. How can we construct a PDA for a given grammar? Explain the steps. (06 Marks)
I of2

16. O6CS/IS56
6 a. Define Chomsky normal form. Why normalization is essential for grammars? (06 Marks)
b. Define the following and show how these can be eliminated in a grammar:
i) Useless
ii) Null
iir) Unit productions. (06 Marks)
,* c. Convert the following CFG to CNF. S is the start symbol.
='/r-r. S +BC,B-+AB/e,A-+0ll/l C-+DC/e D-+01. (o8!tr)rs)
V4, (
I '(J- Oetne a Turing machine. Explain the working of a TM. How it differs from FA.(1d ruartrsy
O @d;i "
TM ro accept a language which has number of b's equal to twice:ffi-i,T;i:;
?{*^-rn -track TM is equivalent to a basic TM.s ^. s;:{Wmufti-track rM is eouilfent t93
[sic rM..
. .tlr*' (08 Mrrks)
b. write'a-Sr{e! note on halting problem of Turing machine. 65- (oo nra.r.s)
.. tr/ritc o n,{+dt(; rrniu"rca I Trrrino machine rvifh an erramnle in" tvr"'r"tc. Write a not6.rSmiversal Turing machine with an example
^tr*
'ersal I unng machme wlth an examplertv-, (06 Marks)
Y
bn ^'-1 , ***** @Yh
.r 4
*o, su-' Gn''
-
,s(Jo
*/- *
-./A. ( ,la v.-4
Y*
.{to ^d
.' t
-
r)" L4
xo" -
-)-L) -,rp -A v-/'^
{i(/ -Cr'
G- -{-/-
/s-(y
t"b" A, Y.'<r
COt Ojr
- ../ )
{.i f tc
t,'*) -'V
A"
*
-t
+r* "r4f
2 of2

17. USN
g
60
9e
U:
L,<
z
Fifth Semester B.E. Degree Examination, June/July 2013
Formal Languages and Automata Theory
Time: 3 hrs.
Note: Answer FrvE fuII questions, selecring
Max. Marks:100
at least TIYO questionsfrom each pai.
I a' Define D.F.A. what u..,h" dift"r.nffi#o.F.A and N.F.A? (06 Marks)b' construct a D'F.A. to accept strings over 1a, u1 suctr ttrat every block of length five containsatleast two a,s.
c. Define N.F.A. and construct an N.F.A. that accepts the language ,aa*(a + b)., [:il::13
2 a. Define €-NFA. Construct the 8-NFA that accepts 0l(0 + t;+.
b Let R be a. regular expression. Then there
"ri.r"
u nni
"
automaton AProve the above theorem.
c. Convert the following e-NFA to DFA.
10css6
(06 Marks)
= (Q, I, 6, qo, F).
(06 Marks)
(08 Marks)
(07 Marks)
(05 Marks)
(08 Marks)
(08 Marks)
(08 Marks)
(04 Marks)
3a.
b.
Fig.e2(c)
l?*. ur9 prove pumping lemma for the regular language.
Obtain the R.E. from the following FA usiig state e"limjnation method.
tlh
61-wd':t__>o
Fig.Q3(b)
lo DFA usins table fil
State +A B *(c) D E F G H
0 B G A C H C G G
F C C G F G E C
c. Minimize the fo rithm.
4 a. Consider the following grammar:
E-+E+E/E-E
E -+E * E/E/E
E -+ (E)
E -+ alb/c
b.
i) Obtain the left most derivation for the string (a + ! * s;
ii) Obtain the right most derivation for the striig (a + b; /g.
lrov:Ih:l lhe
following grammar is ambiguous,
"using
#" ,iilng .,ibtibtaea.,,
S -+ iClS/iClSeS/a
C-+b
Discuss the various applications ofcontext free grammar.
1 of 2

18. 10cs56
PART_B
5 a. Define PDA. Obtain a PDA to accept the following language:
L: {n"(w) = nb(w) where n > l}
Draw the transition diagram for PDA. Also, show the moves made by PDA for the string
aabbab. (12 Marks)
b. Obtain the PDA for the following grammar:
S + aSa/aa
S -+ bsb/bb (08 Marks)
6 a. What is an unit production? Begin with the grammer:
S -+ ABC/BaB
A-+ aAlBaC/aaa
B + bBb/a,lD
C -+ CA/AC
D-+e
i) Eliminate e - productions.
ii) Eliminate unit productions in the resulting grammar.
iii) Eliminate any useless symbols in the resulting grammar. (10 Marks)
b. Obtain the following grammar in CNF:
S + OA/1B
A -) OAA/I S/1
B -+ 1BB/OS/O (10 Marks)
7 a. Design a turing machine to accept the following language:
1,:{Qn1n/n>1}
Also show the sequence ofmoves mde by the TM for the string "00001 11 1". (14 Marks)
b. Write a note on multitape turing machine and non-deterministic turing machine. (06 Marks)
8 Write short notes on:
a. Post correspondence problem
b. Halting problem in TM
c. Universal turing machine
d. Applications of R.E. , (20 Marks)
2 of2