,... e: (S ~»? ... '£ I ]::. T/ 1-~'1~...t- 'f- c...Or."'Kv~y F, J.f, '-~ 11.-;1PHMarchExam(4) 560 ...~. tr:::;) . ...:D'" ~

.~ 'J. J 'J ~ 111.-

Con.3917-12. ,~\ ,. .. c.~()~J ~~ GN-7043(3Hours) [ Total Marks: 100

N.S. (1) Question No.1 is compulsory.(2) Attempt any four questions from remaining six.

1. (a) What is meant by homogenous matrix representation?(b) Different applications of computer graphics.(c) Describe in brief physical modelling.(d) List various workstation based Architecture.

5555

2. (a) What is meant by virtual reality? Explain type of virtual reality system.(b) Explain Cohen-Sutherland line clipping Algorithm with example.

1010

3. (a) Explain boundary fill and flood fill algorithm using and connect Approach compare 10them for their performance.

(b) Explain graphical rendering pipeline. 10

4. (a) Write DDA line Drawing Algorithm. Calculate the pixel co-ordinate of line AB using 10DDA Algo where A(O,0) and B(4, 6).

(b) Explain in detail Sun Blade 1000 Architecture. " 10

5. (a) Explain scaling, rotation and translation with example.(b) Describe input and output device used for virtual reality.

1010

6. (a) Explain virtual programing with reference to Java 3D. Also describe motion control 10methods.

(b) Explain line clipping, text clipping and point clipping. 10

7. Write short notes on :-(a) Fractal in computer graphics.(b) Application of virtual reality in military and medicine(c) Computer Animation.(d) RGB and CMY colour model.

20"

r,' IE/#'f!.~ - f' I r 7 / IZ-~~ I ~ 1'10 c I ~ 'H.- '2-0-'L

~/o~""'.L, h - ~ tr-

Con. 4415-12. GN-8210

(3 Hours)

N.S. : (1) Question NO.1 is compulsory.(2) Attempt any four questions from remaining.(3) Each question carries equal maximummarks.

[ Total Marks: 100

1. (a) Discuss.the different types of stations defined by HDLC. How a communicationchannel in HDLC that is used by a station can be configured.

(b) Describe the characteristics of 3G system.(c) Compare different multiplexing techniques.(d) Compare SOMA, FDMA, TDMA and COMA.

5

555

2. (a) Explain classification of signalling techniques.(b) Explain 3G UMTS network.

1010

/' 3. (a) Explain traffic management in ATM. Also explain ATM traffic policing.(b) Classify different switching architectures. Discuss one of them.

, 10'

10

4:-(a) Describe in brief BPSK modulator and demodulator. Also calculate probability' 10of error.

(b) Explain Hanoff Algorithm. 10

5. (a) What are different types of traffic? Explain leaky bucket algo~ithrn in brief.(b) Explain different traffic, descriptors used in ATM.

1010

6. (a) Explain ISDN protocol stack in detail with neat sketches. 10(b) What do you mean by ancryption ? Explain symmetric key and asymmetric key 10

methods in detail.

\-.

7. Write short notes on any two :-(a) TMN(b) LLC Sublayer(c) Spreading codes and Scrambling process.

..20

----------

.'

I II / s~ --'l / /Zj cS <Pb :-- MPf6 / fJ-f '2o)/J-1e Con. 455'8-12. ~ -. I n;ri'GN-860C!ff;. or ~6/12-

(3 Hours) L( h. LOff-& [Total Marks:100 /°N.B. 1) Question No.1 is compt!-lsory.

?I~olve any fo~r a~estions from remainine: six questions.3) Draw neat sketches wh~rever required.4) Assume suitable data wherever necessary.

5) Figures to the right indicate full marks.

Q.l A) What are Products and Services? Explain with suitable examples..

B) Which machine tool 13 cclled,as "Univ~rs,u machine tool" and Why?Explain its construction and principal of working along with neat sketch.

q What are the different types of Plastics? State properties of Plastics.

Q.2A)Describe an importance of Mechanical working of Metals. How mechanical. 05properties are improved in Metals?

B) Explain with sketch construction. working & nature of operations ofanyone type of milling machine.

.C) Derme Quality and write its dimeJ;1sions.

Q.3 A) Explain control charts for variable data and attribute data.

B) What are the benefits of computer aided process plap.ning.

C) Derme TQM. Explain the basic concepts ofTQM.

Q.4 A) Prepare a CNC part programme for machining 6fworkpiece.

Part Name: Pin Material: Brass Raw Material Size: 4I25mm Bar Stock

1.5 X 45°

11

016

25

..B) Writ~ a short note on Group Techn.ology.

Q.5 A) Describe Operator-machine System.

B) What is the Role of Forecasting in facility capacity planning?

C) Differentiate between Product Layout & Process Layout.

D) Differentiate between open loop & closed loop control system.

[ TURN OVER

05

10

05

10

05

08

05.07

12

08

05

05

05

05

025 (320

-t-_._--

20 I 5 i-:

Con. 4558-GN-8600-12. 2

Q.6 A) What role does Demand management plays in:i) Make to Stock environment

ii) Assemble'to Stock environment.

. B) ,Write short notes on:

i) Master Production Schedule

10

10

ii) MRP.

Q.7 A) Draw neat sketch & Explain the following lathe operations:

i) Plain Turning H)Facing iii) Drilling iv) Knurllng.

B) Explain Robot co-ordin;ite systems. List any ten applications of

Robots 41 manufacturing industry.

10

10

1T!Ll/S€fi'l ~ /p--/ cS~,'roMV/ P+j ~D)~721,'h,II-12-o)JP ( :b. L6'P'j r- rc;n :Pr>~0 ([ /0 6/;/L-Con.4739-12. (REVISEDCOURSE) eJ GN-9372

(3 Hours) [Total Marks: 100

N.S. (1) Question No.1 is compulsory.(2) Attempt any four questions out of the remaining six questions.

1. (a) How is recursion represented in a sequence diagram?(b) How is association modeled as a class?(c) How is generalization/specialization contrasted with more code reuse?(d) What are the aim and principles of modeling?

20

2. (a) Contrast action state Vs. activity state. How are forking and joining used in activity 10diagram? Illustrate with an example.

(b) Sketch the use case diagram for modeling a hospital information system aimed 10at collecting and storing complete information pertaining to the patients treatmenthistory and disease behavior where actors could be doctor, lab technician, patient,duty nurse, receptionist, visitors etc.

3. (a) What are interaction diagrams? What are their contents and common properties? 10 .

Define semantic equivalence between two kinds of interaction diagrams.(b) Construct the state diagram and interaction diagram for Jhe online Reservation 10'

System. .

4. (a) Engineering Admission procedure is as follows :-DTE adverties the date of CET Entrance examinationsStudents has to apply for entrance examinations

- Results announced by DTE- Students has to fill up the option form to select the college of his/her

choice.

- DTE displays allotment list in the web site and intimation to all colleges.- Students should visit the alloted colleges and complete the admission

procedure. .Draw the Activity Diagram for the above process.

(b) Draw the state transition diagram for Online Shopping Books.

10

,.10

5. (a) Explain object oriented metrics and testing.(b) Draw a sequence diagram for registering a new e-mail account.

1010

6. (a) Describe four phase of RUP in detail.

(b) How deployment diagrams are useful in modeling a fully distributed system?

1010

7. Write short notes on (any four) :-(a) CRC(b) Test Cases(c) Nested State Diagram(d) Architectural Frame Work(e) Multiplicity and Generalization.

20

SA 1st half 167Te 1 T se-m.-:SZ:- [2-evv fY? cvp ~ ~("'-

U (gI5!Z-CJI2-

GN-7049Con. 3766-12. ~: --OS FOOD ])

(3 Hours) [Total Marks: 100

N.B. 1) Question No.1 is compulsory. ,

2) Attempt any four questions out of remaining six questi?ns.

La)What are the main advantages for an operating system designer-ofusingvirtual machine architecture? what is the maiIJ.advantagefor a user.

(10)

b) Consider the following snapshot of the system. (10) ,

~-

Answer the following questions using_bapker,'salgorithm.i)Determine the total amount of resource of each type.ii) What is the content of need matrix?iii)Determin~ if the system is in safe state using safety algorithm.iv)if a request from process pI arrives for '(0,4,2,0) can the request be

granted immediately. '

2.a) On a diskwith 1000 cylinders, numbers 0 to 999, compute the number oftracks the disk arm must move to satisfy all the requests in the disk queue.Assume that the last request serviced was at track 345 and head is movingtowards trackO. The queue in FIFO order contains requests fo.r~e followingtracks: -

123,874,692,475,105,376. Perform the computation for following diskScheduling algorithms. '

i)FIFO ii)SSTF, iii)SCAN

(10)

b) What is RTOS? Give the classification of RTOS and comparison of any two'RTOS. -

(10)

3.a) Consider the following snapshot of the process to be executed. Draw theGantt chart and determine the average waiting time and average turnaroundtime for FCFS, SJF(preemptive), SJF(nonpreemptive) and round robin(quantum

(10)

=L.)scneaullng algonmm.Process Arrival Time Burst Time

PI 0 4P2 2 5P3 4 6P4 5 2P5 6 1

, -- -- --------

(10)- -" -" -- - ----

[TURN OVER

b) Describe Inode and FAT structure.

Process Allocation Max AvailableA B C D A B C D A B C D

PO 0 ,0 I 2 0 0' I 2 1 S 2 0PI I 0 -0 0 I 7 S 0P2 I 3 5 4 2 3 5 6 '

P3 0 6 3 2" 0 6 5 .2P4 0 0 1 4 0 6 5 6

(6 J=-T- ~v -=- r-SA 1sthalf 168 - ~Con. 3766-GN-7049-12. 9-u.Jo:--e s r;c-~

r'1~ ~ W1l-

l&ls-Io lL

Q4.a) On a simple paging system with 224bytes of physical memory 256 pagesof logical address space and page size of 210bytes.i) Determine the no of bits in physical address. Specify the page frame?ii) How many entries are present in page-table?iii) How many bits are in logical address space?

b) Suggest an implementation of binary semaphores that avoids busy waiting.Q5.a)What is a kernel? Describe briefly the approaches of designing kernel.

b)Consider the following page traces in a demand paging system with 3 pageframes.2,3,1,1,2,3,4,6,2,3,4,3,1,2,3.Determine the number of page faults and hit ratio using FIFO and.LRU pagereplacement algorithm. .

6.a)Describeprogrammed10 andDMA. . .

. b) Considera disk having8 surfaces.Each surfaceshavingan outerdiameterof.16cm and inner of6cm and inner track space is 0.2mm:There are 32 sectors ineach track. If disk address for reading a byte or sector on any surface track ofdisk is 27bits. What is sector size in bytes if disk rotates at 3600rpm. What iseffective data transfer rates in bytes/see?

7. Write short notes on the following:-i)Monitorii)Distributed O.S.iii)Network O.S.iv)Symbian O.S:

(10)

"(10)(10)(10)

(10)(10)

(20)