Академический Документы
Профессиональный Документы
Культура Документы
e: (S
~?
...
'
]::. T 1-~'1~...t...~.
PH MarchExam(4) 560
Con.3917-12.
,~\
,. .. c.~()~J ~~
(3Hours)
. ...:D'" ~ ~ 'J.
'J ~ 111.-
GN-7043
[ Total Marks: 100
5
5
5
5
1.
(a)
(b)
(c)
(d)
2.
(a) What is meant by virtual reality? Explain type of virtual reality system.
(b) Explain Cohen-Sutherland line clipping Algorithm with example.
3.
(a) Explain boundary fill and flood fill algorithm using and connect Approach compare 10
them 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 10
DDA Algo where A(O, 0) and B(4, 6).
(b) Explain in detail Sun Blade 1000 Architecture.
"
10
5.
6.
(a) Explain virtual programing with reference to Java 3D. Also describe motion control 10
methods.
(b) Explain line clipping, text clipping and point clipping.
10
10
10
10
10
20"
r,'
IE/#'f!.~
- f'
I r7 /
L, h
IZ- ~~
~ 1'10
- ~ tr-
~/o~""'.
GN-8210
Con. 4415-12.
(3 Hours)
5
5
5
10
10
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'
of 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.
10
10
10
10
..
10
20
1e
II
- / /Zj
/ s~
-'l
Con. 455'8-12.
cS <Pb :--
-.
(3 Hours)
N.B.
MPf6
L h.
(
/ fJ-f '2o)/J-
n;ri'GN-860C!ff;.
LOff-& [Total Marks: 100
?I ~olve
05
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.
10
05
of
05
08
Q.3 A) Explain control charts for variable data and attribute data.
05.
07
025
(320
016
10
12
1.5 X 45
1
1
-t-_._-20
..
i-:
25
System.
08
05
05
05
05
[ TURN OVER
or
~6/12-
Con. 4558-GN-8600-12.
10
plays in:
Stock environment.
10
on:
Q.7 A) Draw neat sketch & Explain the following lathe operations:
i) Plain Turning
H)Facing
iii) Drilling
iv) Knurllng.
industry.
of
10
1T! Ll/Sfi'l
~
(
721,'h,II-12-o)JP
Con.4739-12.
:b.
/p--/ cS~,'roMV/
L6'P'j r-
(REVISEDCOURSE)
rc;n
eJ
(3 Hours)
N.S.
(1)
Question No.1 is
P+j ~D)~
:Pr>
~0
GN-9372
([ /0
compulsory.
(2) Attempt any four questions out of the remaining six questions.
(a)
(b)
(c)
(d)
2.
(a) Contrast action state Vs. activity state. How are forking and joining used in activity 10
diagram? Illustrate with an example.
(b) Sketch the use case diagram for modeling a hospital information system aimed 10
at collecting and storing complete information pertaining to the patients treatment
history 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?
Define semantic equivalence between two kinds of interaction diagrams.
(b) Construct the state diagram and interaction diagram for Jhe online Reservation
System.
.
10
(a) Engineering Admission procedure is as follows :DTE adverties the date of CET Entrance examinations
Students 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.
10
4.
20
1.
10'
DTE displays allotment list in the web site and intimation to all colleges.
Students should visit the alloted colleges and complete the admission
procedure.
10
5.
10
10
6.
10
10
,.
(b) How deployment diagrams are useful in modeling a fully distributed system?
7.
20
6/; /L-
Te
fY? cvp
[2-evv
T se-m.-:SZ:-
~ ~("'-
U (gI5!Z-CJI2-
~:
Con. 3766-12.
--OS
GN-7049
FOOD ])
(3 Hours)
(10)
Allocation
B
C
A
0
,0
I
I
0
-0
I
3
5
0
6
3
1
0
0
D
2
0
4
2"
Max
A
0
I
2
0
0
(10)
B
0'
7
3
6
6
C
I
S
5
5
5
D
2
0
6
.2
6
Available
A B C
1
S 2
D
0
'
~-
tracks:
(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 the
Gantt chart and determine the average waiting time and average turnaround
time for FCFS, SJF(preemptive), SJF(nonpreemptive) and round robin
(quantum =L.)scneaullng algonmm.
Process
Arrival Time
Burst Time
PI
0
4
P2
2
5
P3
4
6
P4
5
2
P5
6
1
(10)
(10)
--
-- --------
-"
-"
[TURN OVER
-- -
----
(6
Con. 3766-GN-7049-12.
J=-T-
~v
-=-
9-u.Jo:--e s r;c-~
r-
r'1~
W1l-
l&ls-Io
Q4.a) On a simple paging system with 224bytes of physical memory 256 pages
of 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 page
frames.
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 page
replacement algorithm.
.
(10)
"
(10)
(10)
(10)
(10)
(10)
.16cm and inner of6cm and inner track space is 0.2mm:There are 32 sectors in
each track. If disk address for reading a byte or sector on any surface track of
disk is 27bits. What is sector size in bytes if disk rotates at 3600rpm. What is
effective data transfer rates in bytes/see?
7. Write short notes on the following:i)Monitor
ii)Distributed O.S.
iii)Network O.S.
iv)Symbian O.S:
lL
(20)