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

USN

Tinre,, 3 hrs.

5s.b.

c.

6a.b.

c.

10AL61

(08 Marks)

(02 Marks)

(10 Marks)

(06 Marks)

(08 Marks)

(06 Marks)

(10 Marks)

(10 Marks)

(06 Marks)

(08 Marks)

(06 Marks)

Sixth Semester B.E. Degree Examination, Dec.2013 lJan.20l4

Management and Entrepreneurship

Max.,::',

Marks:100:,:, . .)

oooL

o()

oXbo-

;n--tttroo.= .-.1cg$no0YOotr-O

-P

o>o2

;Io(.)60

boi

-4ooi=

:9

orvo'j

u=a, tENi!Ox.YY,,^:ao-C or.)

aJ=sotr>=oVLo-

U<*Noo'Z

Loo.

Note: Answer FIVEfull questions, selectingat least TWO questions from esch psrt.

PART - Aa. Define rnanagement. Explain the functions of management.

b. Explain management as profession.

c. State and explaia the principles of management.

a. Define planning. Explain the importance of planning.

b. Explain the steps in planning process.

c. Explain the steps in decision making. ::, ,,,,,,,

a. Explain the principles of organization.

b. Explain selection procedure of personnel.

a. Explain the steps in controlling.b. Explain the purpose of communication.

c. What are the requisites of extellent coordination?

PART _ BDe fi ne entrepreneurship. Explain the characterist ics o f entrepreneur.

Differentiale manager and entrepreneur.

U*raa,,rrrlous types of entrepreneur.

Define SSI. Explain objectives and scope of SSI.

Explain the role of SSI in economic development.

, 'Explain the steps for starting an SSI.

(08 Marks)

(04 Marks)

(08 Marks)

(10 Marks)

(05 Marks),(05 Marks)

(0sMq*s)(12 Marks)

::..:::

lf a. Explain zuADB and KCTU along with their objectives.:.! 4. r-.\Pr4ur 1\4-.1I-rD AllLl I\\2 I U ArUrrB WlLll Llltr[ UUJEULT

' 6. Write short notes on: i) SIDO, iD SIDBI, iii) DIC, iv) TECSOK.

8 3. Give the meaning of a project (02 Marks)

b. Explain the contents of project reporl. (08 Marks)

c. Explain PERT and CPM along with differences between them and their limitations.(10 Marks)

trIE

A.-^.*ae NlsP

USN

" "Time: 3 hrs.

" """"""'

:i I'

I a.'b.

06cs62

,tt,t

Max. Marks:100 ,,

(06 Marks)

2 Marks)Marks)

?(07 Marks)(07 Marks)

(06 Marks)

Sixth Semester B.E. Degree Examination, Dec.2013 lJan.20l4Unix System Programming

6

, "'"..

t."t', ,

8

d)ooLa

0)

()

Eqco-

69-.ouo ll

coo.= c.l

Y(Jo<FO

o>o2

gsoc)(n-o

50i.9(!-o6r

-? c.r

or=

a. 6,

o_,

a=toa lr=

!o .=>,hco0o=o, ;itr>o-U<-N()oZ

Po

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

PART _ AEyplain the major difference between ANSI C and K and R C? (04 Marks)

ili t.pnd explain all the POSX.1 defined constants for limits checking at compile time and

Rufltirne. :,, ,- (08 Marks)

c. Write a,,C/C++ program to print the POSIX-defined configuration options supported on anygiven systefh. (08 Marks)

2 a. With a neat diagram explain the Unix kernel support for files. (08 Marks)b. What are inodes in Unix? What are its significances? Explain'with examples. (06 Marks)c. Describe Hard links and symbolic links in Unix. Differentiato between them with examples.

3 a. Explain the following general file APIs:(i) fcnt( ) tii) lseek( ) , (iii):stat( )

b. Explain the device file APIs and FIFO file APls with examples

4 a. With a neat diagram, describe how a C-program is started and.

il l1r,,

b.

c.

With a neat sketch, explain the memory layoul of a C-program.Write aCIC++ program to illustrate the use ofseljmp( ) and longjmp( ) functions?

' .:.. PART _ B5a,WriteaClC++progrilto...uffirocess?Alsoexplainthesimilaritiesand

dissimilarities betweer the parent and child process? (07 Marks)b. Explain in detail the family of exec functions. (07 Marks)c. What is process accounting? Write aClC++ program to generate iiccounting data.

a.

b.

a. What are' signals? Write a CIC++ program to catch, ignore and accep[ the default actions ofthe si$nal? , ,,:: (06 Marks)

b. V/,,,hat is a signal mask of a process? Write a CIC++ program to check whether the SIGINT, signal is present in a signal mask and adds if it is not there? (06 Marks)

" c, Describe the Daemon characteristics and coding rules for the Daemon process? AlSo write aC/C++ program to initialize the daemon process. (08 Marks)

What are pipes? Write a CIC++ program to send data from parent to child over a pipe? ,

(10 Mark$) ::

What are FIFOs? With a neat diagram, explain the client server communicating FIFOs. : ,,,

(10 Marks)

Explain the socket system calls for both in the comection-oriented and connectionlessprotocols with neat diagrams for both the cases. (10 Marks)Write short notes on the following :

(i) Terminal login (ii) Job control(iii) wait( ) and waitpid( ) APIs (iv) Resource limit functions/APls (10 Marks)

*r,<16{<*

fot :E/tr/3i -,'*se

USN

b.

2a.b.

3a.b.

c.

4a.b.

06rs63

Time: 3 hrs.

Sixth Semester B.E. Degree Examination, Dec.2013 lJan.20l4File Structures

Max. Marks:100Note: Answer FIVEfull questions, selecting

at leust TWO questions from each part.

PART _ A

I a. Explain reading and writing operation in file processing. List all of them; Explain any two.

5a.b.

ooop.

()(!oL

oXb0-

=n-td)troo

.=N

ibOyoo<FO

*,a

d=

oc)

boi

a(!

-? c.r'Eaoi:

= :''lo-X

():oEal=

!o

>\ (kbootroOir=qo=>VLo

(r<:^

0.)

o-7

o

Discuss the differenoe between Unix tools for sequenti4l processing and direct access.(10 Marks)

].

Explain buffer management.

Explain the diffeient ways to manipulate buffers using classes.

(10 Marks)(10 Marks)

(10 Marks)

(10 Marks)(05 Marks)(05 Marks)


(05 Marks)the sequence


the sequence set(10 Marks)

,,,i (10 Marks)

(10 Marks)What is collision? Explain the process of collision resolution by progressive oveiflow.

(10 Marks)

Explain the limitation of biflary search and internal Sorting.Justiff the statement: "Indexes arb too large to hold in memory."What do you mean by index?

Explain obj ect-oriented model for implimenting c o -sequential processes.Explain K-way merging algorithm with example.

.. PART-B

List the difference between binary search trees and AVI. trees.Explain creation ,, of B-tree using an example forCSDTAMPIBWNGURKEHOLJYQZFXV. Order of the B,tiee is 4.

Explain virtual B-trees and LRU replacement.

Explain the block splitting and merging due to insertion and delotion in

yftt"tlaTpl.", .. n -* ' ti"

Explain the loading a simple prefix B* tree.

Define hashing explain a simple hashing algorithm.

c.

6a.

b.

la.::'b.

Ia.

b.

c.d.

Write short notes on :

SeekingExtendible hashingB+ treesBuddy Bucket. (20 Marks)

USN

cg$€T**,C-L8BR.,&f{Y

10cs64

Max. Marks:100


(12 Nlarks)

(06 Marks)


Sixth Semester B.E. Degree Examination, Dec.2013lJan.Z$l4Gomputer Networks - II

la.b.

c.

dooLa

oo!

oX

-&a

=ho*rE6.= a'.1

Yd)oEiFO

a=

oq)

dobotr

'iaor=

^X

oj

o=

AE,

!C)=E ,=Xaao --corJiD=o- :\:oo->.l/<- c'.1

()o'7

Time: 3 hrs.

2a.b.

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

, ,: PART-ADiffere,ntiate between connection oriented and connectionless services.Define routing and its goals.

Consider the network, in the following Fig.Q.1(c):

Fig.Q.l(c)i) Use the diJkstra"s algorithm to find the set of shortest path from node 4 to other nodes.ii) Find the set of associated routing table entries. (t2 Marks)

Explain the leaky bucket algorithm for policing the tralfic at flow control. (10 Marks)Explain fair queing at the packet level. Show the transmission sequences for field flow andpacket by packet system by considering the two logical buffers (buffer 1, buffer 2). Assumeeach has a single L-bit paCket to transmit at t : 0 and no sub-sequent packets arrive, assumeC : L bits/second: .1 packet/second. (10 Marks)

a. Write the advaniages and disadvantages of UDP. ' ', ' (06 Marks)b. What do you mean by tunneling? What are the needs to changes fiom IPV4 to IPV6? Write

the IPV6 basic header and describe its fields. (10 Marks)c. What is routing information protocol (RIPX What is the maximum width of a RIP

networks? (04 Marks)

With a neat diagram, explain the TCP state transition diagram. (08 Marks)Explain in detail, the operation of OSPF (open shortest path first) by considering on examplenetwork,

PART _ B5 a. Explain DNS message format with a neat diagram.

b. Apply RSA and do the following:i) Encrypt d:3, b : 11, x: 3 and m: 9.

ii) Find the correspondirg y.

iir) Decrypt the ciphertext.^--',

What is SNMP? List the PDUs of SNMPV2? Explarn SNMP PDU format.c.

I of2

6 a. List the benefits of creating VPN's. Explain VPN types.b. Explain need for overlay networks and P2P connection.

10cs64


t; _ 7 a. What is an MPLS network? Ekplain with diagram how the packets are forwarded usm&.._

.'*"..'. MPIS (08 Ma$'.,,,,,,,,,.,,::i b. Write a note on VOIP signaling. (04nlarka)

g. Discuss the differentiated services QOS approach. (08 Marks)

{ " -""r*8 d:=f"'List and explain the applications and features of adhoc networks. * ,]

'(oa Marks)b. ExptBln the structure of a typical sensor node. #\,J: (07 Marks)

c. Wri rt notes on Zigbee technology (05 Marks)*N'..r,,.-, ,*'.5o:.:.=.::. ,,,..,,:,,...

i.;1.*';' ,&," "t. t

= ,,=,,,,.,,,,, * {< * {< * ,4tp \,:.* jl j

{,' &

fl*"q'-!" **il

,.!

\.,r"j" r:.

;''=ij'

::r' 'i::'' *

- r "li .i''

i' ':'"''d& t

,,{wlfl 'xir !'

fa {h:':r

Jt :i::i.: ::::

"lu,,l,rnnl)r, ,i,

tt,,.f h

** . -,i1.\qJ

\dP19 ,"d -e*uli^*

'8, -*';+q,

:: ,: ..

-.j/ m-

a?&

u *d*-

a "$o-qP r&4t^."b

€wfftB{-*""""'

,Ia}' =:::, ,:::

it: 't:"'':::'

2 of2

USN 10rs65

Sixth Semester B.E. Degree Examination, Dec.2013/Jan.Z0l4Software Testing

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

at least TWO questions from each part.

.. PART _ AI '' a. What is software testing? Why it it * ir"portart in SDLC? (o5Marks)

b. Explain the triangle problem statement along with flow chart for traditional implementation.(07 Marks)

c. Explain the IEEE error and fault taxonomy and IEEE standard anomaly process. (08 Marks)

2 a. Justiff the usage of boundary value analysis with function of two variables and highlight thelimitations of boundary value analysis. (05 Marks)

b. Explain wbak normal and strong robust equivalence class testing with next date problem as

an example (05 Marks)c. Discuss the usage of decision table method to device test qases with example of commission

problem and triangle problem. (10 Marks)

3 a. Define DD-path. Draw DD-graph for triangle problem. (04 Marks)b. Justifr strongly connected graph is the number of linearly independent circuits in the graph

using cyclomatic complexity metric. (04 Marks)c. Define predicate node, du-paths and dc-paths. Give du-paths for stocks, locks, total locks,

sales and commission for commission sale problem. (12 Marks)

4 a. Explain the simple ATM application with the help of (i) Level 1 data flow diagram.(ii) Upper level finite state machine. (10 Marks)

b. Distinguish between top-down integration and bottom-up integration. (04 Marks)c. Explain call graph-based integration with the hetrp ol

(.)o(.)

La

oo

ox

6v

ooltroa

O:Yotr-O

o yj

d:

oO

50cc6(6

-6

-4oOE

=!Yo5.oj

o=

!o

>,qbo-a50o=o- l'iXo5e

lr<* c'l

()oZ

o

(ii) Neighborhood in!.ergration.

PART _ B5 a. Define the below terms:

(i) Threads (ii) MM-path 1iiil Data (iv) Actions

(06 Marks)

(v) Ports (10 Marks)

(10 Marks)


,," 1 (04 Marks)

(08 Ftarks)(04 Marks)(03 Marks)(05 Marks)

b. Explain single-processor static interaction and single-processor dypamic interaction.

6 a. Explain verification trade-off dimensions.b. Briefly discuss the dependability properties in process frameworkc. Wtry organizational factors are needed in process framework.

7 q. Define below terms with respect to fault based-testing:

D Original program ii) Program location.iii) Alternate expression iv) Alternate program. , -

c. List the Fault-based adequacy criterias.d. Explain hardware fault-based testing.

Write a short note on:

Quality and process.Test planning.Risk planning.Organizing documents.Test design specification document.

a.

b.

c.

d.

e.*rr*{<{<

i,.#

CF

(20 Marks)

USN 10cs63

Max. Marks:100

Sixth Semester B.E. Degree Examination, Dec. 20l3lJan.2014

D.,,,:'

tJ.

oooLo

(.)

(.)

ox

d9p,'trca

.:N(B+69!()E:-c o)

o=

;uo()

-6

6 .!l

ioQO-traoj

@=lioa tr=E.<LOz.Yv.uooECOo=o. :itr>Xoo-

U<:' -ooZ

o

Time:3 hrs.

,

c. What are the key problem$'withgrarnmar :

S-+cAd A-+abla.i

3 a. Given the gramrner :

A-+cleB-+dfe

- --:;=)'r:F

i) Compute FIRST and FOLLOW sets

ii) Construct the predictive parsing table

,, iii) Show the moves made by predictive parser on the input ; acdb.Explain with a neat diagram, the model of a table driven predictive parser.

S-+SS+lSS*la.

a. Given the grammar :

S-+CCC-+cCldD Obtain the sets of canonical collection of sets of valid LR(0) itemsii) Design SLR parsing table.

b. Write an algorithm used to compute LR (1) sets of items.c. Write a note on the parser Generator - Yacc.

What is handle pruning? Give a bottom - up parse for the input : vsv * v-t-t and grammar :

top down parse? Write a recursive descent parser for the

(08 Marks)


(05 Marks)


Gomplier Design

Note: Answer FIVE full questions, selectingutleast Tl,yO questions from each part.

PART _ A

I a. Explain the various phases of complier. Show the translations for an assignment statement.

Position: initial * rate + 60, clearly indicate the output of each phase. , (12 Marks)b. Write thq.regular definition for an unsigned number. Also write the transition diagram.

(06 Marks)

::,,

(02 Marks)

c. What is printed by the following C code?# define a (x + l)

irrtx:2; ',

void b( ) {int x :l; printf("oZd ln", a)'}void c( ){printfl'"%d ln", a); }

void main( ) {b( ) ; c( );}.

2 a. Describe an algorithm used for eliminating the Ieft recursion. Eliminate left recursion from

b. Show that the following grammar,is ambiguous :

E -+ E + E I E * E I (E) | id. Write an equivalent unambiguous grammar for the same.

1 of2

Construct the iarse tree and annotated parse tree for the input string : 1 1001 . (05 Marks)c. Give a SDT for desktop calculator and show its parser stack implementation. (10 Marks)

a. Translate the arithmetiC.expression : a + - (b + c) into dri;rr*r, triples and indirect triples.

b. Give a semantic action i;",,S - if (B) Sr etse sz. [3:ffifiic' Develop SDD to produce directed a cyclic grrpt for an expression. Show the steps forconstructing the directedacyclic graph forthe expression : a-t a* (b-c) + (b-c) * d.

PART _ B

a. Explain the concept of syntax - directed definition.b. The SDD to translate binary integer number into decimal is shown below

Productions Semantic rulesBN-+L BN.val: L. valL-+LrB L. va :2 xLl.val + B. valL+B L.va : B .val

B-+0 B. va :0B-+1 B. va :1

a. Discuss the issues in the design of a code generator.b. Write the tree address code and construct the basic blocks for

segment.sum: 0 ;for(i: 0; i <: 10 ; i ++;

sum: sum +a[i] ;

c. Give the code generation process for operations.

lti.,

a. Describe the general structure of an aCtivation record. Explain the purposethe activation record.

b. A C - code to compute Fiborthcci numbers recursively is shown below :

r0cs63

(05 Mark$,::"",.

',..

"::

.

(08 Marks)

of each field in(08 Marks)


int f(int n)

{intt.s:if(n <: 2) retum I ;

s:f(n-l);t: fln -2) ;

return (s,+ t); '),t, ,

Ifi) Draw the activation tree for the call : (5)it) W'hat is the largest number of activation records that ever appear together on the stack?

,,,,:, (06Marks)c, ' Explain the performance metrics to be considered while designing a garbage .oll..jg]._ _ . .' (06 Marks)

(10 Marks)the following program

,F*{<ik*

USN O6C5/15663

Max. Marks:"tr00

(08 Marks)

(04 Marks)with probabilities

(08 Marks)

Sixth Semester B.E. Degree Examination, Dec.2013 lJan.20l4Data Gompression

.:

Tirne:

b.

c.

oo(.)

!

0)

C)L

oX

6v

-oo I

ioa.=N

Y()oE-O=ts*.a

a=

oc)do

00a(!(g

>e/6

3a'Ea

48.trso(!oFl"

a=3oatEC'-!o5.e>'!bo'-EO!

o=sotr>o*

U<-.; 6i

oozP

3 hrs.

N "',"' :: ;:: ; ;i"' {::: ; : ;:';: : *

":::;'#f

,

' t"":

,--..;,,,,,,,,,,,,,, PART - A

Define the following terms with respect to data compressiorr: ,,,

D Compression i,atioii) Bit rateiii) Distortioniv) Fidelity and quality.Determine whether the following codes are uniquely decodable:i) {0.01. il }

iil {0.0r.11. l}.A source emits letters from an alpliabet A : {ut, d2, a,3, aq, as}P(ar): P(a:): 0.2,P(a2): 0.4 aqd P-(a+): P(a5):0.1.

ii) Find the Huffman code,forthis source.iii) Find the average lenglh of the code in (ii) and its redundancy.

2 a. A sequence a encoded using the LZW algorithm and the initial dictionary !-@gn=iqtal

- ..r-9.{}

lndex l 2 J 4

Entry a x r tltndexltlzl:l+l rv./ \*}\ffi iy'-**rq:,r".\,8

, -'l C,L''* -e'd I^<, -'l C,u'- - e'd I^<

\l.L ti;i'-ilr'- 1-"D ; rfhe output of the LZW encodes is the following sequence: \, }\ -' ,f g,,, 3,1,4,6,3,4,2,I,2,5,70. Decodethesequence. \u}1={-{l'

ii) Encode the decoded sequence using the same initial dictionary -il$e%-o Marks)b. Describe Run-length coding technique used is facsimile encoding. (I0 Marks)

3 a. Describe two popular measurers of distortion. (06 Marks)b. Explain the encoder and decoder mapping for a 8-level, 3-bit quantizer. (06 Marks)c. Explain backward adaptive quantuation with an example. (08 Marks)

4 a. Write LBG algorithm. (10 Marks)b. With a block diagram, describe basic differential encoding system. (10 Marks)

I of2

06CS/I5663

,:,":,,, ,,,

,,. t -

:..

a.

b.

PART _ B

Find the inverse Z-transform of the function F(z) =

Explain Discrete Walsh - Hadamard transform.

2za +1

223 -522 +42-1(10 Marke)

",1,i,r,llll ,

(10 Mtirks),i ,.,

,,,,

7 a. Describe EZW algoritfu r'Demonstrate various steps of EZW using seven-levelthe

a. |Given an infect sequence .::.,,,::

[t n=0Y ={"n lo n+oi) Find,,,fhe impulse response sequence {h,} if filter coefficients,,are : a0: 1.25, a1:0.5.i0 Find t :::irlpulse response sequence {h"} if filter coefficiertts 6re ao : 1 and br : 0.9.

(05 Marks)b. Explain MPEG lay*,] coding for audio coding. (10 Marks)

c. How basic subcodin$ Slgorithm reduces error rate comparod to DPCM? Explain. (05 Marks)

decomposition shown belowi ii,ut:'

.,,,,,,

ttt,,.,,,,-,,,.

b. Explain set partitioning is hierar.fri.uf ,,.., (SrlHT) algorithm.

8 a. Explain how video signals,are re-presented.b. What is rate control? Eiplain how change in rate is affected.c. Write a note on ITU-T recommendationH.263 standard. ""' "",,,,

:

l'""'"" '

i<'t*{<*

ttl

26 ....6:" ]'13

6

10

4,:,.7::'

""',4" ttt -4

r, 1L-L

4,

1-J

0(12 Marks)(08 Marks)


""t::

"tt"t'"""t' ":

,,."lli'';;

2 of2

USN

6a,'",.,

o'

ta.b.

8a.

-".tr f*ng,r,rt: ; '"'Ti'**on

Marks)

its vertices (6,

composite

06cs65


(06 Marks)(I0 Marks)(04 Marks)

(10 Marks)6) (10,6) (10, 10) and

n matrix for

oooo-

(.)

o

Eqbo*

de

-lol)ioo

.=N<d+HhoY()(.)i-O

a=

oc)=!cotr

!(n

'iaor=

o-atr0.oj

aE!o

5.vaa06J=EOtr>=oVLo

\J<:-(.)

oZ

foo.

Sixth Semester B.E. Degree Examination, Dec.2013 lJan.20l4Gomputer Graphics and Visualization

Time: 3 hrs.Notez Answer FIVEfull questions, selecting

at least TWO questionsfrom each part.

.. PART _ AI a. Briefly explain the applications of computer graphics.

b. Explair,,the process of image formation with pinhole camera as ,

expressiortfor angle of view.

2 a. Write an openGl. recursive program for 3D sierpinsky gasket with relevant comments.

Max. Marks:100

,,,,,,,,

"

gn,example. Derive the

. (12 Marks)

b. Explain the seven major groups of functions of a good API. '

3 a. Enlist the features of good interactive program.b. How pop-up menus are created using GLUT? Illustrate with an example.c. What is double buffering? Explain the advantages of double buffering.

....::i

4 a. What are vertex arrays? Show how vertex arrays can be used to represent a cube in openGl.

b. A square in a two dimensional system is specified by(6. l0). lmplement the following by its first fmding a

the sequence of transformation.i) Rotate the square by 45" about its vertex (6. 6)i, Scale the original square by a factor of 2 about its centre.

PART _ B5 a. obtain the matiix representation forffiilof u point about

b. Show ttrat tt" following three dimensional sequences are commute:i) A rotation and a uniform scaling.ii) Two rotations about the same axis.

3D space.(10 Marks)

(10 Marks)

Briefly explain the perspective and parallel views in openGl,. Give example. (10 Marks)What is mesh? With example explain how meshes are generated. (10 Marks)


Describe the phong lightening model. What are its advantages?Briefly explain the different tlpes of light sources supported by openGl.

Use Leang Barsky line clipping algorithm to clip a line from starting point (30, 15) andending point (65, 35) against the window having its lower left corner at (40,10) and upperright corner at (75,25). (10 Marks)

b. Use Bresenham's line algorithm to digitalize a line from point (0, 0) to point (6, 4) 1lo Marksy

USN

Time: 3 hrs.

3a.

b.c

4a.

b.

06rs65

Max. Marks:100


Sixth Semester B.E. Degree Examination, Dec. Z0l3/Jan.2Ol4lnformation Systems

do()

o.

E

C)

o!

ox

CgU

ol)coo.= c-l

-il)go)(Jtr-c c)

?a

6:

o(.)

o0i

,6-o6-ao'CaOE

o. 6.o(voFi

6,i,Loo'->- (ibo-i olJ

o=

tr>=oVLI

t<*i 6i

;z

oo,

1a.

b.

Note: Answer FIVEfull questions, selectingatleast TWO questiins from each pa;.

PART _ Af .l.f\t -ft

What is a system? explain five important components or functions of a system with anexample? (10 Marks)Classify the different types of information systems and briefly explain them. (10 Marks)

a. Explain the different competitive forces? Also explain cornpetitive strategies to encounterthe compet itive forces.

b. Define agility and agile company. Explain four basic strategies to implem.rJ':JilTilCompany. (10 Marks)

Illustrate with a neat diagram, the different stages of a transaction processing cycle andexplain them. (08 Marks)Briefly explain the components of targeted marketing. (08 Marks)State the ohjectives of computer integrated manufacturing. (04 Marks)

List the potential benefits of supply chain management. What are the causes of problems in

5a.b.

supply chain management?Explain the benefits of ERP and also the major causes of failure in ERP plqi

Explain fuzzy logic based system with an appropriate example.What is meant by "goal seeking analysis". Explain.

arise in global IT.c. Explain political and Geo - economic challenges.

PART - B ' f {' o*tt=" :}\1i 'l''^[ u1..r;,stt l{ ],

With a neat diagram, explain the essential E-commerce processes. 1\r')&\ Lt '';* -

d"*/1,State and explain some of the key factors for achieving success in e -

Describe the different components of an expert system, with a neat diagram. (08 Marks)

hrks)arks)

6a.b.

c.(06 Marks)

i06 Marks)


a. What is ergonomics? Explain. (04 Marks)b. Briefly explain variety of security measures that are a part of integrated security

management. (08 Marks)c. List and explain the principles of technology Ethics. (08 Marks)

8 a. Describe the major components of business/ IT planning. (06 Marks)b. Briefly explain strategies to be used to solve some of the systems development problems that

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

Education

Transcript of 6th semester Computer Science and Information Science Engg (2013 December) Question Papers