9
USN PART _ B l0rs51 Max. Marks:100 (06 Marks) (08 Marks) (06 Marks) (10 Marks) (10 Marks) (10 Marks) (10 Marks) (10 Marks) (10 Marks) (10 Marks) (10 Marks) 'lr'i (10 Marks) , (10 Marks) (10 Marks) (10 Marks) Fifth Semester B.E. Degree Examination, Dec. 20l3lJan.2014 Software Engineering .,'rll', ,,,i'i' ,T,ime: 3 hrs. i,.,,' ' La. b. c. 2a. b. 3a. b. 4a. b. 5a. b. 6a. b. ':':7 a. b. o o o q (.) () ox Gle -uo ll trca .=N tsdJ oEl FO o2 a= o() 50i cnd ,G 'c cd -'a 'ia o .i= o-a tr0. o-l 9.9 6= 6E !o o.- >, li bo- ca0 so tr> :o VL U. U< -N (.) o '7 o Note: Answer FIVE full questions, selecting atleast TWO questions from each part. PART _ A Define software, software engineering, software process. What are attributes of good software? Explain two types of emergent properties. Explain system a.p.nauUitiry. Explain the process iteraiioif ; Give software requirement documbnt"(IEEE atandard). Explain requirement validation. : .r-'' ll :,, : t'' "' Explain structured methods. Explain risk management. ,], Explain system organization. Give state,diagram for weather station and explain design evaluation., ,: , ",,,, "" Explain extreme programming. Give Lehman's laws. Explain clean room software development. Explain component testing. a. Give factors governing staff selection. b. Name factors affecting software engineering productivity (10 Marks) and cost estimation techniques. (10 Marks) ***,f*

5th semester Computer Science and Information Science Engg (2013 December) Question Papers

Embed Size (px)

Citation preview

Page 1: 5th semester Computer Science and Information Science Engg (2013 December) Question Papers

USN

PART _ B

l0rs51

Max. Marks:100

(06 Marks)(08 Marks)(06 Marks)

(10 Marks)(10 Marks)

(10 Marks)(10 Marks)

(10 Marks)(10 Marks)

(10 Marks)(10 Marks)

'lr'i

(10 Marks)

, (10 Marks)

(10 Marks)(10 Marks)

Fifth Semester B.E. Degree Examination, Dec. 20l3lJan.2014Software Engineering

.,'rll',

,,,i'i'

,T,ime: 3 hrs.

i,.,,' '

La.b.

c.

2a.b.

3a.b.

4a.b.

5a.b.

6a.b.

':':7 a.

b.

oooq

(.)

()

ox

Gle

-uo ll

trca.=N

tsdJoElFO

o2

a=

o()

50icnd

,G

'c cd

-'a'iao .i=

o-atr0.o-l9.96=6E!oo.->, libo-ca0

sotr>:oVLU.

U<-N(.)

o'7

o

Note: Answer FIVE full questions, selectingatleast TWO questions from each part.

PART _ A

Define software, software engineering, software process.What are attributes of good software?Explain two types of emergent properties.

Explain system a.p.nauUitiry.Explain the process iteraiioif ;

Give software requirement documbnt"(IEEE atandard).Explain requirement validation. : .r-'' ll

:,, : t''

"'

Explain structured methods.Explain risk management.

,],

Explain system organization.Give state,diagram for weather station and explain design evaluation., ,:

,

",,,, ""

Explain extreme programming.Give Lehman's laws.

Explain clean room software development.Explain component testing.

a. Give factors governing staff selection.b. Name factors affecting software engineering productivity

(10 Marks)and cost estimation techniques.

(10 Marks)

***,f*

Page 2: 5th semester Computer Science and Information Science Engg (2013 December) Question Papers

USN 06css2

Fifth Semester B.E. Degree Examination, Dec.2013 /Jan.20l4System Software

Time: 3 hrs. Max. Marks:100Note: Answer FIVE full questions, selecting

at leost TWO questions from each part.

PART _ AI a. Bring out the differences between application software and system software. (04 Marks)

b. Write programs in both SIC and SIC/XE to copy a character string 'system Software" to

()ooo.

()

o!3e

-b0 I

Eco.r!

.= .n

io0Y()aZeO=tso2

a:!oi)

i\ooi

f,L

/N

-o(n3di'CaOE

:qtro.orv(.) j

o=

aLENC:9-,̂=!0"co0

,>:oVL(f-

(r<-i c{

oo'7

o

another string.c. Explain the following with reference to SIC / XE machine architecture:

i) Instruction fbrmats.ii) Addressing mode.iii.l Data lormats.iv ) Register organization.

(06 Marks)

2 a. Explain the different data structures used in two pass assembler. Mention clearly theirlunctions in Pass I and Pass 2. (06 Marks)

b. What is the need of pass 2 assembler? Reason out with a simple example. (04 Marks)c. Generate the object code and complete object program for the following SIC/XE program.

(10 Marks)

(10 Marks)

SUM START O

FIRST LDX #O

LDA #O+LDB #TABLE2BASE TABLE2

LOOP ADD TABLE, XADD TABLE2, XTIX COL]NTJLT LOOP

+STA TOTALRSUB

COLNT RESW ITABLE RESW 2OOO

TABLE RESW 2OOO

TOTAL RESW IEND FIRST

With suitable example, explain the use of LTORG assembler directive. (04 Marks)Differentiate between program blocks and control sections. Explain how control sections areprocessed. (08 Marks)Discuss how forward references are handled by multi-pass assembler. Show step by stepprocedure to evaluate the following statements. Show the symbol table after each scan.1. NUMB EQU MAXLEN/22, MAXLEN EQU BEND-BUF3. PREVB EQU BUF-I4. BUF RESB 40965. BEND EQU *

OPCODESLDX -04LDA -OO

LDB -68ADD -18TIX -2CJLT -38STA -OCRSUB -4C

3a.b.

c.

Assume the value for location counter as 1034 (H) at line number 4. (08 Marks)

Page 3: 5th semester Computer Science and Information Science Engg (2013 December) Question Papers

06css2

4 a. Explain with an algorithm the working of an absolute loader. (06 Marks)b. Distinguish between linking loader and linkage editor. (04 Marks)c. What are the major data structures required for linkage loader? Write and explain the

algorithm for pass 1 of linking loader. (10 Marks)

PART _ B5 a. What is an interactive editor? List the four tasks performed by document linking process in

an interactive system. (04 Marks)b. Explain briefly structure of a typical editor with the help of a block diagram. (t0 Marks)c. Discuss briefly the following debugging functions:

i) Break points.ii) Tracing.iii) Trace hack.

6 a. Explain with an example the various data structures required forprocessor.SUM MACRO &ID

LDA X&ID_+IADD X&tD-+2STA X&lD-+5MEND

Expand the following macro invocation statement using the above given macro:i) SUM BEETA ii) SUM A 104 Marks)Explain the advantages and disadvantages of general purpose macro processors. (08 Marks)

Explain with an example the structure of lex program.Define regular expression. Give regular expression for the following:

c.

(06 Marks)

the design of a macro(08 Marks)

(08 Marks)

(04 Marks)(08 Marks)

[3" using the

(10 Marks)expression that uses

(10 Marks)

i). ii) * iii)" iv)$ v){} vi)?c. Write a lex program to count the vowels and consonarlts in a given string.

a. What is shift/reduee parsing? Explain the parsing for the string "tu"ed : 12 +following grammar.Statement.+- NAME : expressionExpression -+ NUMBER + NUMBER / NUMBER - NUMBER

b. Write a Yacc program to recognize the validity of an arithmetic*, -, * and l.

2 of2

Page 4: 5th semester Computer Science and Information Science Engg (2013 December) Question Papers

USN

c.

4a.b.,c.

06css3

Max. Marks:10O

(08 Marks)

(06 Marks)(06 Marks)

Fifth Semester B.E. Degree Examination, Dec. 20l3lJan.2Ol4Operating Systems

Time: 3 hrs.

.:

3a.

b.

Note: Answer FIVEfull questions, selectingatleast Tl4/O questions from each part.

5a.b.

doo!0.

C)

o!

()x

6v7n;,troo.=&

go()i-O

o!

a=

oO

boi

,6

5o'iaor:

o. 5.otuo..

iiii, l.E

!o .=>- (Fooocb0o=o. ;jE>^OVLo

o<+ a.l

d)

'7

aa

) PART-A

I a. Explain the storage device hierarchy, with a neat diagram.b. Explairtrthe following in brief :

i) Real time embedded system :

2 a. Explain the implementation of producer - consum€, pro".rr., using bounded buffer inshared memory systems. (08 Marks)

ii) Multimediasystems.c. Write the system call sequence to copy a file fiom source to destination.

b. Explain the different multithreading models. with neat sketches.c. Consider the lollowins set ofo

Process Arival tinre (ms) Burst time (ms)

Pr 0 8

Pz 4

P: 2 9

Pr -) 5

"li,i,,i

Draw Gantt charts and calculate average waiting time and averagenon-preemptive SJF and preemptive SJF scheduling algorithms.

Explain the critical section problem. list and explain the requirements to be met by a solutionto critical section problem. (06 Marks)Write and explain with respect to synchronization hardwarei) The definition of TestAndSet( ) instructionii) Mutual - exclusion implementation with TestAndSet( ).Explain the monitor solution to dining - philosopher problem.

Explain the resource allocation graph with an example.Explain the Banker's algorithm for deadlock avoidance.Explain the following methods to recover liom deadlock0 Process terminationii) Resourcepreemption.

PART _ B

Draw and explain the multistep processing of a user program.

(06 Marks)

(06 Marks)(08 Marks)

(04 Marks)(10 Marks)

:"(06 Marks)

(08 Marks)In the paging scheme with TLB, it takes 20 ns to search the TLB and 100 ns to accessmemory. Find the effective access time and percentage slowdown in memory access time ifi) Hit ratio is 80%ii) Hit ratio is 98o/o. (04 Marks)

c. Prove that Belady's anomaly exists for the following reference string using FIFO algorithmwhen numbers offrames used are 3 and 4. 1,2, 3, 4, I,2 5. 1.2, 3. 4. 5. (08 Marks)

Page 5: 5th semester Computer Science and Information Science Engg (2013 December) Question Papers

6

",'-,,'a:.,,,,:a'J

06cs53

a. List the common file types with their usual extension and function. (08 Marks)b. Explain the typical file - control block, with a neat sketch. (06 Marks)c. Explain any two file allocation methods, in brief. (06 Marks)

a. With a neat sketch, explain the structure of moving - head disk mechanism. foA,eifiir.rlb. Suppose that a disk has 50 cylinders named 0 to 49. The read/ write head is currently serving

,t,,,, &t cylinder 15. The queue of pending requests are in order , , :

1:''"4, 40, 11,35,7, 74 ,,, '"'.,

'"

ShO,w the graphical representation and calculate average head movement;using C - SCANand'0- Look scheduling algorithms. r''":,,,, (0s Marks)

c. Explai-the following operations in access matrix with an example for each.i) Copyii) Transfef ' :

,,,,...,,,''.'..,... ,;""

iii) Limited.opy:,f. ..., ,,.'

.,,..

.. ,;..........,.

,a. Explain the components.pf Linux system, with a neat d{agtam.b. Explain the following irtiili reference to process management in Linux

i) Process identity :1"i.,

ii) Process context. '" '",,i .,,r" ,,, .

(06 Marks)

(06 Marks)

(08 Marks)prograns in Linux. (06 Marks)

,,::,,,

c. With a neat diagram, explain the rnemory,layotif'for ELF

'lllllllllll'r"" 'ii"r'ir!*i* * * *

,,,,,....u.,... ',

1,' ',,.-'i;"rr '

,,rtl""li

'i,.,,lil. .

,

""']." lllr

.''

Page 6: 5th semester Computer Science and Information Science Engg (2013 December) Question Papers

USN 06css4

Fifth Semester B.E. Degree Examination, Dec.2013 / Jan.2014Database Management Systems

Time: 3 hrs. Max. Marks:100

Note: Answer any FIVE full questions, selecting atleast TWO question from eoch part.

PART _ A

la.b.c.

a.

b.

3a.b.

(.)oo!

d

6

o()!

EP

j

boltroo

g()

-O

a2

a=

oO

bQa

>(i

'(, cO

_?o'iaOj:

:q

o.j

o=toa(;:C'-!o

=,:bo-.OOo=*oF>o

(r<- a.l

(.)

Z

oaE

Explain Tluee - level schema architecture, with a neat diagram. (08 Marks)Define Data model. Briefly explain Object based and Record based data models. (08 Marks)What are the functions of Database administrator (DBA). (04 Marks)

Define the following terms, with an example for each :

i) Mapping cardinalities ii) Strong entity iii) Degree of a relation iv) Ternaryrelationship v) Foreign key. (10 Marks)Design E * R diagram for keeping track of information about COMPANY database takinginto account at least four entities. (10 Marks)

Explain Binary relational algebra operations, with example.Consider the following relations and write relational algebra expressionsSUPPLIER (S-id, S-name, S - address)PARTS (P-id, P - name, colour)CATALOG (S-id, P-id, cost)i) Retrieve the name of all the suppliers who supply yellow parts.ii) Retrieve the name of the suppliers. who supply both Blue and Blackiii) Retrieve the name of the suppliers who supply all parts.

5a.b.

C.

a. With respect to SQL, explain with example : i) The DROP command ii) The ALTERcommand. (08 Marks)Consider the following tables, write the SQL statements for the following queries:CATALOG (book-id, title, au-id, p-id, Catg-id)AUTHOR (au-id, name, city, country)PUBLISHER (p-id, name, city, country)CATEGORY ( cat-id. descript ion)MEMBER (m-id, name, address, city, state)ORDER - SUMMARY (O-no, m-id, o-date, amount)ORDER - DETAILS (O-no, book-id, quantity)i) Display details of all the members who have placed an order for the book 'CODING'.ii) Display the name of all the books for which an order has been placed.iii) Display the name of all the authors who have more than 2 books in catalog. (12 Marks)

PART _ B

With example, explain aggregate functions in SQL. (10 Marks)Explain INSERT, DELETE and UPDATE statements in SQL with example. (06 Marks)What is a VIEW? What are the advantages of view? (04 Marks)

ourt/,.V, )/5 5; 1,,1r;:r.l--il- -1+2 Mfrks)

Page 7: 5th semester Computer Science and Information Science Engg (2013 December) Question Papers

06css4

6 a. Explain Informal design guidelines for relation schemas. (0E Marks)b. What is normalization? Explain the First, the Second and the Third normal forms, with

example. ,r, *u*,

7 a. Explain Multivalued dependencies and Fourth Normal form. (tO Marxs)b. Explain Join dependencies and Fifth Normal form. (10 Marks)

8 a. p,xplain the ACID properties of transaction. (08 Marks)b. S,xplain: ,;:,,,, ,,:

i) erash recwery ii) Serializability iii) Deadlock. .,"' , ,,. (12 Marks)

'.1,, , ,,,."'i" ,

Page 8: 5th semester Computer Science and Information Science Engg (2013 December) Question Papers

USN 10csss

Fifth Semester B.E. Degree Examination, Dec. 2OL3lJan.2Ol4Gomputer Networks - I

Time: 3 hrs. Max. Marks:100Note: Answer FIVE full questions, selecting

atleast Tl4/O questions from each part.

PART _ A

1 a. What is data communication? List and explain the five components of data communicationsystem, (06 Marks)Discuss the ISO-OSI layered model, bringing out the functionalities of each layer. (10 Marks)Differentiatg between :

i) ARP and RARPii) UDP and TeP-. (04 Marks)

(08 Marks)(06 Marks)(06 Marks)

3 a. What is FDM? Briefly explain its multiplexing and demultiplexing process. (06 Marks)b. Four sources create 250 characters per second. The frame contain one character from each

doo

(s

4)

(.)

Ey

dU

oll I

EOO

goOE:-o

=!

C) Y,:

a:

oO

o0i

-6

'iaor=

sao'i

aZA,i!oo.r>':ao-co06=*otr>Xov!o-

\J<-i 6iooZ

Po

b.c.

2 a. Write a descriptive note on three causes of transmission impairment.b. Explain the transmission modes?c. Explain delta modulation?

c.

4a.b.

c.

source and one extra bit for synchroaiZation. Find :

il The data rate oIeach sourceii) Duration of each character in each souice

iv) Duration of output framev) Frame size in bitsvi) Data rate of link.What is time division multiplexing? Explain howdisadvantages of synchronous TDM.

Describe different types of enors.Explain errot detection and error correction with respect to block coding.Find the codeword, using CRC given data word "1001" and generator "1011"

PART _ B

a. Explain briefly, with neat figure stop and wait ARQ and Go Back N ARQ.b. Explain the liame format and transitional phases of point to point protocol.

a. Explain:i) csMAii) csMA/cD.

b. Describe 802.3 Mac frame

a. ExplainIEEE 802.11 architecture.b. Bring out the differences between repeaters, bridges, routers and gateways.

a. Explain with respect to IPV4, classful addressing and classless addressing.b. Explain in detail IPV6 packet format.

(08 Marks)

(03 Marks)(08 Marks)(09 Marks)

(12 Marks)(08 Marks)

l

(12 Marks)(08 Marks)

(10 Marks)(10 Marks)

(10 Marks)(t0 Marks)

. -. I Co;i"',,,:.*i I"\'.uk Tou"'"tt"'j,"''1\,p\ _/.:?,'.r

" )____-/-d,)'\dP ruqc4--' (06 Marks)statistical T-DM- overcomes the

Page 9: 5th semester Computer Science and Information Science Engg (2013 December) Question Papers

06css6

4 a. Define CFG. Obtain CFG for the following :

i) ;:1anb2nln>0)

lll::{unbn'I,,>3} * :::

, iii) For regular expression (a + b) . (07 Marks),, b. ConsiderthegrammarGwithfollowingproductionsE -++EE l*EE l-EE lx ly

Find LMD, RMD and write parse tree for the string + * - xyxy. (06 Marks)c. What is ambiguous grammar? Show that the following grammar is ambiguous on the string

ittibtaea.S;iCtSliCtSeSlaC -+ brr (07 Marks)

.,::ttt...

,'t'.'....,. PART-B l

5 a. Describe the languages accepted by PDA. (04 Marks)b. Construct aPDAthatacceptsthefollowing: L: {wlw eia+b)* andNu(w):N6(w)},write

the instantaneous description for the string abba. (10 Marks)c' Convert the following CFG to PDA that accept the same language by empty stack.

S -+ aABC, A -+ aBla, B -+ bAlb, C -+ a. (06 Marks)

6 a. What are useless symbols? Eliminate useless symbols from the following grammar :

S -+ AB I CA, A -) a, B -+ BC I AB, C + aBlb. (07 Marks)b. What are unit production? Eliminate unit productions from the following grammar :

S -+ AalB, B -+ Albb, A -+ al bcfB. (05 Marks)c. What is CNF? Convert the lollowing grammai into CNF

S -+ aAD, A -+ aBlbAB, B -+ b, D + d. (08 Marks):::'

.

7 a. Explain with diagram, the working of a Turing machine and multitape Turing machine.

b. Design a Turing machine that accepts the language. L: {anbl I n > 1}. Also write thetransition diagram and instantaneous description for the string aab6. ,, (12 Marks)

8 Write short notes on the following : '

,

a. Multi tape Turing M/Cb. l-latting probtem of mAc. Recursive languaged. Post's correspondence problem. (20 Marks)