5th & 6th Sem Question Paper of BSC Computer Science (ASSAM UNIVERSITY)
5th & 6th Sem Question Paper of BSC Computer Science (ASSAM UNIVERSITY)
Time : 3 hours
The figures in the margin indicate full marks for the questions
(Answer any five questions, taking one from each unit)
UNIT-I
(i) Inheritance
(ii) Polymorphism
(iii) Encapsulation
(b) What are the features of Java programming?
Explain.
".. ( Java is aplatform independent language. Why?
Give your comments. 3
(Turn Over )
(2)
(
(3)
ii) System out println ("Hello Java"): (c) Give the differences between throw and
Write a Java program to implement? 2D-Matrix throws. 3
(d 4
Multiplication. " Explain the following exception handling5+5+4=14
methods
UNIT-II with a suitable program.
Try and catch
Write a program to show that inheritance,
polymorphism and encapsulation can work iij Throw
together and also explain the flow of
execuation of program. Hii) Throws
5 UNIT-IV
b) Explain the following statements
Box b, = new Box ( ); 7. Write a Java Program to implement event handling
on check box, button, and radio button.
Box b, = bji 5+5+4=14
4. (a) What do you mean by type casting? Explain 8. Write a Java Program to implement event handling
with a suitable code. 2+2=4 on list, choice and text field. 5+5+4=14
Time: 3 hours
The figures in the margin indicate full marks for the questions
(Answer any five questions, taking one from each unit)
UNIT- I
(w.T)
e Calculate the witing time for process P,P2,P3,P4 and
P5 applying FCS and SJFpreempive) algorithm for the
following data (Non 2X3=6
Process Arrival Time Burst Time
P1 4
P2 1 2 3
P3 2 5
P4 3 4 5
2022/0DD/18/24/ MCSC-504/338 P5 5 3 2
(Turn Over )
(2) (3)
A) Preemptive scheduling and non-preemptive (c) Calculate the page fault occur by applying LRU page
scheduling. replacement policy (3 frames) and optimal replacement
ii) I/Obound process and CPU bound process. policy (4 frames) on the following page reference string
1, 2, 3, 4, 2, 1, 5, 6, 2, 1, 2, 3, 7,6, 3, 2, 1, 2,3, 6
wI) 2x3=6
(c) Calculate the waiíng time for process P1,P2, P3, P4 and
P5 applying SJF (non-preemptive), Priority(preemptive) UNIT-III
and Round Robin (Time slice= 1) algorithm for the
4+4-9
following data
Process Arrival Time Burst Time 5. (a) What is a cylinder in magnetic disk? What is the
difference between constant linear velocity and constant
P1 5 5
angular velocity in disk architecture? 1+3=4
P2 4
P3 8 3 (b) What is interrupt? Distinguish between maskable and
1+2=3
P4 2 1 non-maskable interrupt.
P5 1 2 (c) Explain the concept of direct memory access (DMA) in
detail? 7
(Note: smaller priority value signifies higher priority)
2X3=6
" . a Discuss the role of interrupt handler when a process
UNIT - II makes a system call to communicate with a device? 4
COMPUTER SCIENCE
A. Mention the different file attributes and types. 2+2-4
5th Semester
Explain the best fit, first fit and worst fit algorithms?5
Course No. : MCSC-502
(o Explain the acyclic graph directory structurewith the
help of diagram. 5 (Modeling and Simulation)
8. (a) Explain the file system architecture. 5 Full Marks: 70
(b) What do you mean by garbage collection in graph Pass Marks : 28
directory structure? 2
Time : 3 hours
(c) Explain differernt types of Indexed file organization. 5
(d) What is file mounting? 2 The figures in the margin indicate full marks for the questions
(Answer any five questions, taking one from each unit)
UNIT - V
UNIT-I
9. (a) What is producer-consumer problem? Explain the
solution of producer-consumer problem with the help 1. (a) Define simulation. Write the advantages and
of bounded buffer. disadvantages of simulation. 1+4=5
1+5=6
(b) What are the necessary conditions for the (b) Distinguish between the following : 3x2=6
occurrence of
deadlock? 2 (i) Systems and Systems environment
(c) Explain the banker's algorithm to avoid the (ii) Discrete and continuous system
of deadlock.
occurrences
6
(c) It is important to have a model for doing
What is resource allocation graph? Describe a simulation. Justify your answer. 3
resource
allocation graph with a cycle but no deadlock. 1+3=4
(2) What are the various types of model available
( What are semaphores? Explain how it can be used to for simulation. Discuss each of them briefly.
implement mutual exclusion. 3+4=7 6
( State the solutions of Dining Philosophers problem. 3 6 Write the steps involved in a simulation study.
Also draw the flow chart to guide the model
builder for simulation study.
2022/0DD/ 18/24/MCSC-503/329 (Turn Over )
(2) (3)
UNIT-II UNIT-III
Write and explain the steps involved in time 5. (a) What do you understand by queueing model?
3. (a) simulation
advance algorithm for calculating Describe the components of a quering systems.7
time.
(b)
Consider the function (b) Explain the queueing notations used for
modeling and simulation a queue problem.
f(x) = - , 1< x< 3 7
0, otherwise
A grocery store has only one checkout counter,
which is being used as a probability density customer arrives at this checkout counter at
function for a continuous random variable X'. random times that are from 1 to 8 minute apart
each possible value of inter arrival time (IAT) has
(i) Find the value of k the same probability of occurance, the service time
vary from 1 to 6 minutes with the probability as
(ii) Find p (x < 2.5) below:
yA. tá) Describe how spread sheet is helpful for The problem is to analyz the system by simulating
modeling and simulation of a real world the arrival of service of 10 customers. 14
problem. 5
properties of Cummulative Random digit for IAT = 64, 112, 678, 289, 871, 583,
5 Write the
139, 423, 39
distribution function for a random variable X.
3 Random digit for service time = 84, 18, 87, 81, 6,
91, 79, 9, 64, 38
se Define descrete random variable with 4 5
suitable example. ST 1 2 3
The life of a device used to inspect cracks Probability ·10 -20 30 -25 10 -05
in aircraft wings is given by X. The cdf for the
device is given by Calculate
) Total IAT
F(x) = e-t/2 dt = 1-ex/2 (i) Total service time
(iji) Total waiting time in the queue
Calculate the probability less than 2 years (iv) Total idle time
and probability between 2 and 3 years. 6
system
(y) Total time customer spend in the
(Turn Over )
(4)
2022/0DD/18/24/MCSC-501/334
(vi) Average waiting time UG/PG ODD SEMESTER EXAMINATION, 2022
UNIT-IV
COMPUTER SCIENCE
A a) What is a random number? What is the 5th Semester
difference between a pseudo-random number
and a truly random number?
Course No.: MCSC-501
Explain different steps in the development of (Internet Technology)
a useful model of input data. 4
Full Marks : 70
.(GY Use the linear congruential method of to
generate a sequence of 5 four-digit random Pass Marks : 28
integers. 5
8. Time : 3 hours
(a) Explain the following continuous distributions:
(i) Uniform distribution 7 The fiqures in the margin indicate full marks for the questions
(ii) Exponential distribution (Answer any five questions, taking one from each unit)
(b) Discuss the following 7
UNIT
(i) Linear Congruential method
Discuss the development of internet in India.
(ii) Chi-square goodness of fit test 6
UNIT-V b) What is cyber crime? Discuss four cyber
crimes in detail. 8
t¥) Explain the types of simulation with respect
to output analysis. Give examples. 2. (a) How internet traffic analysis is done by Wire
Shark?
Write short note on absolute measures of
performance and their estimation. 6 (b) What are the different security aspects of
internet. 6
10. (a) Explain output analysis for steady-state
simulation. 5 UNIT-II
(b) What is the difference between validation 3. (a) What are the different step which are taken
and verification in the simulation? Explain. 9 care during the building a corporate websites?
7
*022IODD/18 /24/MCSC-502/339
(Turn Over )
(2) (3)
Time:3 hours
The figures in the margin indicate full marks for the questions
(Turn Qver
(2) 2022/EVENI18/24/MCS-602/135
b) What are the various stages of feasibility study? UG (CBCS) EVEN SEMESTER EXAMINATION, 2022
Name and describe them. 12
COMPUTER ScIENCE
i 1.8446744e+ 19Colors (or Write the main steps of DDA circle drawing
ii. 16,777,2 1 1 Colors
algorithm. 3
(d) Write down the basic four conditions in ellipse
iii. 16,767,2 16 Colors
generation algorithm. 3
iv. 16,777,2 16 Colors
(x,y)=(10,15)
(E) Conversion of Cartesian coordinates Unit-II
into polar coordinates gives: 5. (a) What do you
understand by geometrical
i. (r,©)= (18.02, 56.30) transformation? Give example. 5
ii. (r,0)= (65.03, 51.34) (b) Translate along y-axis upto 4 points of an
object
defined by coordinates A (0, 0), B (1, 0), C (1, 1),
ii. (r,0)= (61.03, 50.34) D (0, 1). 5
iv. (r,0)= (64.03, 51.03) (c) Prove that two successive
explain. 4 translations in the same
(b) Draw the RGB colour model and direction is the sum of the two translations
3
(c) Define hue, saturation and lightness. together. 4
card. 2
(d) Write the properties of NVDIA graphics 6. (a) What do you understand by the homogeneous
Unit-II coordinatessystem? 2
4 (b) A triangle A(0,0), B(5,1), C(3,4) is scaled using
3. (a) Write the DDA line drawing algorithm.
SX=2and sy =2 about origin. Find the new vertices
(b) If the sum of all winding numbers is initially of the triangle.
negative but after re-structure of the polygon it
2 (c) Write down the steps of 2D viewing
becomes 0. Put your remarks on it. pipeline. 2
intermediate (d) Find the reflection of apoint A(5,9) about the line
(c) Use polynomial method to find out the y=x+5.
3
points of the line from (0,0) to (10,8). 2
3 (e) Consider two lines from Pl(-2,2) to P2(8,7) and
(d) Explain conic-section generation.
P3(2,2) to P4(4,4) which is to be clipped in aclipping
(e) Define antialiasing with a diagram. window P(0,0), Q(6,0), R(6,4), S(0,4) using Cohen
Sutherland lineclipping algorithmn. Find out the
4 (aYTrace the line from (2,2) to (5,5) using DDA portion of lines whichwill be clipped. 4
5
algorithm.
(b) Find the nearest point of A if the line is from A
(1,1) to B(8,5) using Bres line algorithm. 3
(Turn Over)
X0. 8.
(6) á)(bAnimation (a) Write(c) (b) (a) ( (a)
demonstrate
properties?
phones?
mobile What
usingprogramming. prepared
it. Writeactivity? it important How
leftWrite rolein viewing.points
Write 2D 3D What Write
Explain
navigations.
by right
and viewing
is basic explaining an do short the onis short
stop example the 3D basic
at properties the
How principles without
navigation note notes viewing
pipeline
home differences 3D
motion
to Write Unit-V on Unit-IV (6)
how interactive
animation
program? on:
transformations
start a code C 3D
to
computer of pipeline?and (i)
animation? of perspective
shear
an
mouse see a to keys between Spline
stop demonstrate
down,up, explain.
example thaumatrope the in with Draw
motion usage is keyboard Curve
motion
possible"- 3D
diagrams.
projections. Write the with
What
Cin viewing (i)
animation 2+3+2=7 diagram details.
code
graphics picture can any Fractals
are Justify play
its and two
6 to 6 be 8 an 4 3 5
of 9
3. 2. lr UG
The
a) b) a) b) a) (CBCS)
figures
ler.
pass Write fewer What Explain architecture.
Draw
DifferentiateWhat
of multiple
ssembly in
the the EVEN
or are do
(Answer the Course
specialized
function the COMPUTER
SCIENCE
register flow margin Software
(System )
anguage the machine you Pass SEMESTER
ADD176 2, between Time: Full7O
hours 3 Marks: Semester
6th
chart No.
advantages mean any indicate
Marks
of scheme
five :
an for MCSCC
are registers? structure full 2022/EVENI18/24/MCS-603/136
assembler. the SIC questions)
by : EXAMINATION,
required marks 28
over ADD &
system -
of 603
of SIC/XE for
to
machines the IBMinstruction.
What the
builda IBM software? questions
( 360/370. machine
+5=7features
360's 2022
two with
6 7 7
5/ 4.
conditional
Explain b) a) b) b)
o
answer. the and Explain
example. macro What Draw without Can must Why
assembler. l
you program write
the bethe TEMP FIVE FOUR ABC
isthe is
different using evaluated the
flow write operand the
function of role
Consider
intermediate
chartof "USING" an pass-1 of (2)
from assembly field
in END DS DC DC ST A USINGSTART LC
of pass-1.
expansion
macro
with a apass-1instruction. the
&(location
of
subprogram.macro the pass-2.program
steps
assembler. language EQU.
processor? 1FF5' F FOUR 1,
TEMP 1, FIVE 1, *15 counter)
passof
4' assembling in
Justify given
pseudo-op
program
3+4=7 below,
How your
6 5 4 4
8. 7.
c) Explainthe b) a) c) a)
b) ð) a)
pass
Define Define loaders.What Absoluteconstants.
i ) address
relocatable
relocatable
GoComplex i ) Simple i) Give inDefine
the definition. andWrite basic integrated
processor.
Define macroWrite
an
functions
relocation exampleabsolute draw
datastructure
relocation. loader. is absolute the the
the nested
algorithm
direct-linking the advantages
Write principle
workingof forloading.thata
formation loaderflow-chart macro
Explain each
the loader of used (3)
functions of with pass-1 with
loader the should in &
tohow example. example.
of pass-1
following disadvantages
the macro
assembler example.
with of accomplished pass-1
linker. compile-and
loader. macro.
rn ( What definition Write
types macro
er
can are
3 8 3 3 5 9 5the
) of 3 of
10. 9
b) a) b) a)
Corresponding
expression
following Writefeatures.Construct
List Consider Write
Define
and
algorithm E’ ’E the
compiler.
explain the
the E
algorithm
a +
grammer
DFA. SLR E/E
(a the (4)
/ Write
tomachine
b)* Draw parsing *E/id for
136 convert
ab syntax the
NFA dependent table. phases
an analysis
for
the NFA of
compiler comnpiler.
regular to phase.
the
6 5 9
1. UG
) The
a)
) figures (CBCS)
level
indexiv) iii) i) Write thanWhenExplain.
keys?
indices between Is With
B it
Technology
B* RAID
possible in
- - a a is suitable EVEN
Trees sparse on (Answer
any the Course
Trees brief it a COMPUTER
SCIENCE
preferable the primary margin
note hours
Marks:28
Time:3 Pass Full SEMESTER
Semester
No.
6th
index? same in example
indicate ADBMS )
(
general Marks
on index :
questions) five MCSCC
he
tExplain. to relation
full 2022/EVEN/18/24/MCS-604/137
use :
following: to describe
and marks 7O EXAMINATION,
a have
for -
dense a 604
different secondary for
two the the
index
clustering difference questions
3x4=12
rather search
index. 2022
4 4
6. 4. 3.
7. 5
a) b) locking a) b) With
b) a) b) a) b)
programming
language.
What oriented
ExplainWhat with recovery. cascading
disadvantages
Explain What optimization
occur? At
environment
What
lain. of Explainexample.
examples.
State Discuss suitable
a technique what
trarnsaction one
and is is is
are structured meant
explain Array table
programming th e
persistentexample the example point
data What roll
with technique
and
inheritance?
deferred
of during (2)
server
back. by for
aching the r this concurency explain
a fotypes are transaction
neat
functions Multiset programming each. technique. Give
system the query
persistent
language to for and update in
diagram.
and examples.
extending detail
inand types Explain inheritance advantages control. processing
page shared roll
technique the
the in
ping? language? an back two-phase
processes SQL with
memory 4+4=8 3+3=6
object in does
with SQL and and 14
10 8 6 an 6
4 of
10. 9. 8.
J) b) a)
b) a)
processing
for a
Explain What system.
relation
indatabase system. connection
Explain
Explaindatabase Explain AreWhat
a these
distributed
are are
different y a the
techniques for data the
achieveable? linear
structurenetworks
distributed mesh
distributed system?typesfragmentation speed-up
(3)
37 and for and
of of Explain.
Explain.
failures storage features parallel
distributed hyper and
database
system.
technique linear
that in systems.
of cube
distributed distributed
can scale-up?
query occur inter
for
10 4 7 7
a