Computer Science and Information Science 6th semester (2012-December) Question Papers

I

USN 06AL61

(08 Marks)(04 Marks)

(06 Marks)


(08 Marks)(08 Marks)(04 Marks)





ci(,)

oCo!

oo!

oX

6e!col=oa

.= Gl6S

9di,o=-O=ts

a:

oo)

o0ccg(3

>cl

!(!

-oOE

:9o!w(.) j

o=t- ti

!o)Ev,^:bo'aooiu=so

=oVL

tr<-NO

Z

o

la.

b.

2a.b.

c.

3a.

b.

4a.b.

c.

5a.b.

c.

Explain major principles to be followed to develop sound and efficient organuationalstructure. (08 Marks)What is span of management / span of control? What is significance of number of relations

a.

b.

c.

a.

b.

c.

Sixth Semester B.E. Degree Examination, December 2Ol2Management and Entrepreneurship

Time: 3 hrs. Max. Marks:100

Note: Answer any FIVEfull questions, selecting atleast Tl,l/O questionsfrom each part.

PART. AWhat is Management? Considering management as operational process, explain its varioussub - processes. (08 Marks)Explain required change in skill - mix of a manager, with respect to his level in anorganization.What are the features of Bureaucratic administration?

Dehne planning. Compare strategic planning with tactical planning.

What are different environments of decision making?

between manager and subordinates in span of control?c. What are different advantages of decentrahzation?

What is leadership? What are the major functions of a leader?$Explain Maslow's Need - Hierarchy theory.Explain the purpose of control system.

PART - BWhat are the major characteristics of an entrepreneurship?Give the classification of entrepreneurs based on functional characteristics.What are internal and external barriers of entrepreneurship?

a. Explain using flowchart, formalities for setting up small scale industry (SSI) unit.b. Give the classification of different state level agencies for the promotion of SSI.

Explain objectives and functions of infrastructure agency KIADB.What is TECSOK? Explain services offered by TECSOK.Write a note on single window load scheme of KSFC.

What are the criteria for selecting a project?Compare PERT and CPM project scheduling techniques.What is project appraisal? Give main stages of project appraisal.

What is rational decision? Explain steps involved in the process of rational decision making.(08 Marks)(06 Marks)

vl

/ USN

d)oo

o.(!

(!

oL

ux

t-

_a

=6,r!

Y()o=-o=!o>a2

a=

oc)

.G

!;L

a=

^Xo..(J -.:

a=A,i€ELO

>. (H

i50o=o. hitr>=o5L

lr<- c.l

(J

oz

a

Sixth Semester B.E. Degree Examinationo December 2Ol2Unix System Programming

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

at leust TWO questions from each part.

PART _ AI a. Explain the different functions used to query system-wide limits. Write a C program to

demonstrate how to use the functions to query the limits. (10 Marks)

b. What is an API? List the functions which are performed by the Unix system APIs. Alsoexplain why calling an API is more time-consuming than calling a user defined functions.

c. Differentiate between ANSIC and C++.

a. Explain the different types of Unix or POSIX files. Also explain



Marks)

(10 Marks)

06cs62

these files.

(10 Marks)

(05 Marks)

(10 Marks)

b. Discuss the file and record locking in unix system. Explain the fc locking.(10 Marks)

4 a. What are the different ways of process termination? Differentiate between exit and -exitfunctions. (06 Marks)

b. Write a C program to echo all its command-line arguments to standard output. (04 Marks)c. Explain the setjmp and longjmp functions with its prototypes. Illustrate the use of setjmp

and longjmp function, with a example program. (10 Marks)

PART _ B5 a. Explain how vfork function is different than fork function. Also, write a program to

demonstrate both fork and vfork functions. (10 Marks)

b. Explain process groups and sessions. Discuss their relationship, with controlling terminal.(10 Marks)

b. Differentiate between C stream pointers and file descriptors.c. Differentiate between hard link and symbolic links.

a. Explain the following file APIs with their prototypes:i) write ii) lseek iii) link iv) stat

6 a. Explain the following APIs related to signals with their prototypes:i) Sigprocmask ii) Sigaction iii) Sigsetjmp iv) kill.

8 a. Explain the following socket programming functions with their prototypes:i) socket ii) connect iii) listen iv) accept.

b. What are Daemon processes? Explain the Daemon characteristics and coding rules.(10 Marks)

7 a. What are pipes? List the two limitations of pipes. Explain how to create a pipe. Write aprogram to send data from parent to child over a pipe. (10 Marks)

b. Explain how client and server will communicate using FIFOs. (05 Marks)c. Explain the following functions related to message queues:

i) msgget ii) msgsnd

b. Explain the different functions which will be used for exchanging data on sockets. (10 Marks)

{<**{<*

USN 06cs63

Sixth Semester B.E. Degree Examination, Decemb er 2Ol2Gompiler Design

Time: 3 hrs. Max. Marks:100Note: Answer FIVEfull questions choosing

atleast TI,I/O questions from each part.

PART _ AI a. How to handle reserved words and identifiers during recognition of tokens? Explain.


parsing. Is it(04 Marks)

c.

d.

ooo

(Jdo

(JX

-!, 26v

6oo ll

troo.= ..1

g[i-c 0)

o>o2

,;*oO60

io=Er>66-

-?oOE

^Xo.woFi.

0=AE!ox.Y>(rboocooo=gotr>Xo5!

\J<-Nooz

a

b. Discuss three types of software productivity tools.c. Enlist algebraic laws for regular expression.

2 a. Consider the production given below :

S-+CCICSCProf. James wanted to parse input string CCCCCC, using recursive descentpossible to do that? Justify your answer.

b. Remove left recursion from the grammar given below :

S-+(M)laM-+M;SlS.

Enlist the conditions to test whether a given grammar is LL(1).Construct predictive parsing table for the following grammar

S-+aABbA-+AcleB-+dle.

Write an algorithm for computation of CLOSURE of LR(0).rConstruct in(O) parsing table for the following g.u*ur' ' \

S-+AcA-+ABleB-+aB1b.

4a.

b.

Consider the grammar A -> (A) | a. Construct the DFA of sets of LR(0) items. Show theparsing actions for the input string ((a)). Clearly show states and symbols on the stack.

(08 Marks)

ConsiderS-+idlV::EV-+idE-+Vln

Construct canonical LR(1) parsing table.write a YACC specification for desk calculator with error recovery.

PART _ B

Write semantic rules to compute 5 * 6, using a grammar suitable for top down parsing.(07 Marks)

Give syntax directed definition for simple type declaration. Construct dependency graph forthe declaration, int idr, idz. (08 Marks)


(09 Marks)

(02 Marks)

(10 Marks)


5a.

b.

//&.&v/Eiv,iz

c- \l/r.ife ST)T) f^. .,,l"ilo oraramanl

USN 06cs63

Sixth Semester B.E. Degree Examination, Decemb er 2Ol2Gompiler Design

Time: 3 hrs. Max. Marks:100Note: Answer FIVEfull questions choosing

atleast TI,I/O questions from each part.

PART _ AI a. How to handle reserved words and identifiers during recognition of tokens? Explain.


parsing. Is it(04 Marks)

c.

d.

ooo!

E

odoL

*aoo*,

-!, 2

6e-.o

Iol)Eoo

.= ..i

E#otr_c()

o2

;IoO

Er-v>66--o(0

OE

o- 6.

oJ

o=

o lrINi!Ox.Y>(rboocooaJ=o- :\

=o5L

\J<-NOo

(!L

a

b. Discuss three types of software productivity tools.c. Enlist algebraic laws for regular expression.

2 a. Consider the production given below :

S-+CCICSCProf. James wanted to parse input string CCCCCC, using recursive descentpossible to do that? Justify your answer.

b. Remove left recursion from the grammar given below :

S-+(M)laM-+M;SlS.

Enlist the conditions to test whether a given gralnmar is LL(1).Construct predictive parsing table for the following grammar

S-+aABbA-+AcleB+dle.

Write an algorithm for computation of CLOSURE of LR(0).Construct LR(0) parsing table for the following grammar

S-+AcA-+ABleB-+aB1b.

4a.

b.

Consider the grammar A -> (A) | a. Construct the DFA of sets of LR(O) items. Show theparsing actions for the input string ((a)). Clearly show states and symbols on the stack.

(08 Marks)

ConsiderS-+idlV::EV+idE+Vln

Construct canonical LR(1) parsing table.write a YACC specification for desk calculator with error recovery.

PART _ B

Write semantic rules to compute 5 * 6, using a grammar suitable for top down parsing.(07 Marks)

Give syntax directed definition for simple type declaration. Construct dependency graph forthe declaration, int idr, idz. (08 Marks)


(09 Marks)

(02 Marks)

(10 Marks)


5a.

b.

c- \l/r"ifa ST-)T) f^, .,,l"ilo orora'-anl

a. Describe syntax directed definition for flow of control statements.

b. Generate three address code for Boolean operations.

a. Write intermediate code for the following :

a: (b [i]).b. Explain the procedures to maintain display, with an example.

c. Discuss the performance metrics to be considered while designing a garbage

06cs63



collector.(08 Marks)

8 a. Write machine code equivalent for the following :

'ifx<ygotoL'b. Write an algorithm for partitioning three address instructions into

intermediate code to set a 10 x 10 matrix to an identify matrix.convert this code into basic blocks.

c. Discuss the different issues in the desigri of the function getReg(I).

(04 Marks)basic blocks. ConsiderApply an algorithm to


'l.{<*r<*

2 of2

/USN

Time: 3 hrs.Note: Answer FIVEfull questions, selecting

atleost TWO questions from each part.

PART - A

I a. How the compression algorithm can be evaluated? Explain.b. Derive the expression for average information.c. What is a model? Explain Markov model.

of the code iii) Redundancy.b. Write a note on static dictionary and diagram coding.c. Write the CALIC algorithm.

O6C5/15663

Max. Marks:100



(04 Marks)

Sixth Semester B.E. Degree Examination, December 2Ol2Data Gompression

c.

c.

(]ooLg

(.)

()

3e

de*ao

'

=oo. = a.l

Yootr-O

o>*,a

d=

oO

OEbotr

,6

Ed

-4aOE

o- 6.Eg

,i .9.@=toarE

!o)E

>'kbo-iooo=o- :\

=oVLo

(r<-c\looz

oa

2 a. Explain Huffman coding algorithm. For an alphabet A: {u,, d2,a.3, a4, as) with probabilitiesP(ar): P(ar): 0.2,P(a2):0.4 and P(a+): P(as):0.1 compute i) Entropy ii) Average length

3 a. For two random variables x and y, show that H(x/y) < H(x) with equality if x is independentof y. [Hind : E[og ((x))] < log {E[(x)]] (Jensen's inequality) (05 Marks)Find the auto correlation function in terms of the model coeflcients and o2p for an ARCDprocess. (05 Marks)Explain the two main approaches to adapting the quantizer parameters. (10 Marks)

4 a. Explain the procedure for vector quantization. (06 Marks)b. Explain the splitting technique for initializing the LBG algorithm. Training set vectors are

given in Table Q4b(i) and initial set of output points in Table Q4(bxii). (10 Marks)

Heisht 45 75 45 80

Weieht 50 tt7 1t7 1gu-Table Q4(ii)

ion in DPCM. ,ffi a

6a.b.

c.

c. Explain adaptive quantization in DPCM.

PART _ B

a. Explain the two properties of a linear system.

Given the following input - output relationship yn : 0.6yn-timpulse response {h,}.Write the algorithm that uses estimates of the variance isexplain the zigzag scanning pattern for an 8 x 8 transform.

Explain the basic subband coding algorithm.Write a note on application to speech coding G.722.Write a note on application to audio codins MPEG audio.

(04 Marks)

0.2xn-1. Find the(06 Marks)

a recursive algorithm and also(10 Marks)

(I0 Marks)(05 Marks)(05 Marks)

Heisht 72 65 s9 64 65 57 72 44 '62 60 56 70Weieht 180 t20 119 150 162 88 t75 41 tt4 110 91 172

Table Q4b(i)

cE{€T$ae't-LlBffiecv

8 a. With block diagram, explain ITUb. Explain the packet video.

O6C5/15663

a. Prove that V;+r : Vr @Wr@ Wr*r @. . . . . Owj. (10 Marks)b. For the seven - level decomposition shown below in Fig. 7(b), obtain the bitstream

generated by the EZW coder ii) Decode the bitstream generated in the previous step. Verifythat you get the original coeffrcient values.

26 6 13 10

64-7 7

4-411L-L

4-3-20

- T recommendation H.261.

(10 Marks)


rf{<*{.{<

/USN

06IS63

Max. Marks:100

sixth semester B.E. Degree Examination, December 2o12

File Structures

doooE

4)

o

E9bo-

69_-o

ooltroa.= c.l

!: OOgootraO

o>8sd=

oO-!(!-O

-o>!,G

E(d3(JLOoe

^Xo'v

r".96:att

9O

>,9bo-c 01)

o=o.Utr>=ou!\J<- c'i

oozf

a

Time: 3 hrs.

1a.b.

c.

2a.b.

c.

Note: Answer FIVE full questions, selectingat lesst TWO questions from each part-

PART _ A

Differentiate between physical file and logical file systems. (02 Marks)

Given, a class of car *ith dutu members CAR {string model, string EngNo, string RegNo}

and number functions ReadCar Info ( ) and Display Car Info ( );write a C++ program for D

creating a file and writing 'n' records into it; ii) display all car records from the file.(08 Marks)

Explain strengths and weaknesses of CD-ROM. (10 Marks)

Explain with example the different ways of structuring i) fields; ii) records. (10 Marks)

nxphin how record blocking improves the performance of sequential search. (05 Marks)

List the LINIX tools for sequential processing with example explain their working. (05 Marks)

a. Define internal and external fragmentation compare the 3 placement strategies. (05 Marks)

b. What is an Index? Explain the operations required to maintain an indexed file. (10 Marks)

c. Explain in brief the 2 solutions for improving the secondary index structure. (05 Marks)

a. Briefly explain the different methods used to sort files on a type. (10 Marks)

b. Write the suitable assumptions and essential components of consequential processing model.(10 Marks)

PART _ B

5 a. Forthe givensequence "T C S D AM P I B WN GU", sho*how B-tree oforder4, is

constructed stepwise. (10 Marks)

b. What are the pioperties of B-tree? Explain the process of tree searching procedure'(10 Marks)

6 a. Explain the issues in maintenance of simple prefix B*

b. Explain the internal structure of index set blocks'

7 a. Brief, how hashing differs from indexing.b. Explain the simple hasing algorithm.c. What is packing density? And why it is needed.

Write short notes on:a. Key sorting.b. Data compression.c. Dynamic hashing.d. AVL trees.

trees. (10 Marks)(10 Marks)


(20 Marks)

USN

'2a.

b.

4a.b.

c.

Time: 3 hrs.

la.

b.

06cs64

Max. Marks:100

Sixth Semester B.E. Degree Examination, December 2Ol2Gomputer Networks - ll

oi(.)

oCd!

0)

o

oX

-lilcoo.= a.l

U(JOE-cq

o>o2

o:

o()

cno

ootr

-o.6-o(t3oo;ioqO.tro-o'"

o=4LEGELO5 .:ioooco0o=sotr>=o5-lr<iN

ooZ

o

Note: Answer FIVEfull questions, selectingat least TWO questions from each part.

PART _ A

Explain and derive delays in datagram packet switching and compare it with message

switching. (10 Marks)

Consider the network given below in Fig.Q.1(b). Use Dijkstra's algorithm to find shortedpaths from source node 5 to all other destination nodes. Find the shortest path tree from node

5 to other nodes. (10 Marks)

Fig.Q.1(b)

Explain Fair queuing and weighted fair queuing mechanism of traffic management at the

packet level. (lo Marks)

A host in on organization has on IP address 150.32.64.34 and subnet mask255.255.240.0.What is the address of the subnet? What is the range of IP addresses that a host can have onthis subnet? (10 Marks)

Explain IPv6 basic header format. (10 Marks)

Explain OSPF cofltmon header fields and also OSPF hello packet format. (10 Marks)

Explain BISDN reference model. (06 Marks)

Explain ATM cell header format. (07 Marks)

Briefly explain various QoS parameter and traffic descriptors with respect to ATMnetworks. (07 Marks)

I of2

5a.b.

6a.b.c.

7a.b.

8a.b.c.

PART _ B

Write a note on structure of management information.Apply RSA and do the following:i) Suppose P: 5, q: 1 1 find e and d.

ii) Encrlpt the following to get the cipher texts Pr : 18, P2 : 19 and P: : 1.

iii) Decrypt the cirphertaxts obtained above.

Explain VPN and its types based on tunneling.Explain the various types of resource allocation schemes.

Write a note on overlay networks.

Explain the session initiation protocol.Explain Shannon's coding theorem in detail.

Write a note on the tlpes of attacks in Ad-hoc networks.Differentiate between intracluster and intracluster protocols for WSN.Write a short note on Zigbec technology.

06cs64

(08 Marks)

(12 Marks)




*d(,t(**

2 of2

Il

l USN

Sixth Semester B.E. Degree Examination, December 2Ol2

lnformation Systems

Time: 3 hrs.

Note: Answer FIVEfull questions, selectingat lesst TWO questions from euch part.

PART _ AI a. Define information system and information technology.

b. Describe in detail the information framework for business professionals.c. What are the components of information s,ystems?

06IS6s

Max. Marks:100



4a.b.

()oo0..=

()

o

oX

6e

-oo ll

troo.=N

gilotr=o

3sa:

oo)(00

b0c(!6

>cl-od-?oo{:

o-A!g

oj

a--

6,i,C.F

LO

O.=>,!bo"trboo=90tr>:oVLI

U<--.; ..iooZ

P

2 a. List and describe the five basic competitive strategies with a neat diagram. (t0 Marks)b. What is an agile company? Explain the basic business strategies used in agile company.

(10 Marks)

3 a. Define e-business. Explain with a neat sketch, the transaction processing cycle in detail.

b. Explain marketing information systems with an example.

Define CRM. With a neat diagram, explain the three phases "f

Cnffi$ft$;.(Io Marks)

-Ot :

What is ERP? Explain the benefits and challenges of ERP i*Y .-*uX,,(lp Marks)

i:{ "-x;F i: i;

pa p.r - rl \ -9\ r-r*

"/S','i={ "-X;is }li i'

PARr-B ru\]__ /$'5a.

b.

6a.b.

7a.b.

8a.

b.

What is e-commerce? Explain the scope and the categories of e-corNr@@&.7n example.(10 Marks)

List and explain different e-commerce success factors. (10 Marks)

Define MIS. Explain the four major reporting alternatives provided by the MIS. (10 Marks)List the major domain areas of AI and its commercial applications. (10 Marks)

What is hacking? Explain the common hacking tactics to assault the companies. (t0Marks)Explain the goal of security management. List the important security defenses. (10 Marks)

Explain the major components of business/IT planning process and IT architecturelto lvtu"t.;

Write notes on:i) Global data access issueii) Internet access issue (10 Marks)

USN 06cs6s

Sixth semester B.E. Degree Examination, Decemb er 2ol2Gomputer Graphics and Visualization

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

at lesst TWO questions from each part.

PART _ A

I a. Briefly explain any six applications of computer graphics. (06 Marks)b. Explain the concept of pinhole camera with appropriate diagrams and equations. (08 Marks)c. Explain the pipeline architecture in computer graphics. (06 Marks)

2 a. Explain the different types of polygons in'openGl. (07 Marks)b' Write a program in OpenGL to display the following Fig.Q.2(b) on a raster display system.

Assume suitable coordinates for the vertices. (0g Marks)

ooo!o.

a

C)L

?a

-*11=ca

oxJ()tr-O

o2

6=

o()

o-E50a

a6

-aoo.=

o5-o.'o-i

u=to4 lr=

!o

^.=iqbo"iboo=qotr>Xoo-

U<-61(.)

oz

Loa

c.

3a.b.

c.

4a.b.

c.

Fig.Q.2(b)

What are two forms of text? Explain.

Explain the logical classification of I/O devices with examples.

(05 Marks)

(06 Marks)How are menus and submenus created in OpenGL? Illustrate with an example. (06 Marks)Using XOR mode of operation, how are erasable lines drawn in OpenGL. Write OpenGLcode and explain. (08 Marks)

what are the data structures required to define a cube? (06 Marks)Write the transformation matrices for 2D translation, rotation and scaling and explain.

what are vertex arrays? Explain how vertex arrays can be used to model a color .,r[11*"tut'(08 Marks)

PART _ B

5 a. Show that the following sequence commute:D A rotation and a uniform scaling.ii) Two rotations about the originNote: Assume 2D. /06 Mrrlrs\

b.

c.

06cs65

In two dimensions, we can specifu a line by the equation y : fltx + h. Find an affrnetransformation to reflect two dimensional points about this line. (06 Marks)Write an OpenGL program to rotate a triangle whose vertices are A(0, 0), B(0, 0), C(5, 10)about the reference point (5, 10) by 450. Use builtin OpenGL functions for transformations.

(08 Marks)

a. Derive the perspective projection matrix. (08 Marks)b. Explain glFrustum (..) API with syntax. (08 Marks)c. Bring out the differences between object-space algorithms and image space algorithms.

(04 Marks)

7a.b.

8a.b.

Explain the different types of light sources in graphics.Explain with code the approximation of a sphere by recursive subdivision.


Explain the Cohen-Sutherland line clipping algorithm. (10 Marks)Explain the Z-buffer algorithm for hidden surface removal. How do you enable the Z-bufferalgorithm in OpenGL? 110 Marks)

,i. ,< ,< ,t {<

a ^fa

Documents

Computer Science and Information Science 6th semester (2012-December) Question Papers