Question 1
With Round-Robin CPU scheduling in a time shared system
using very large time slices (quantas) degenerates into FirstCome First served (FCFS) algorithm.
using extremely small time slices improves performance
using very small time slices degenerates into Last-In First-Out (LIFO) algorithm.
using medium sized times slices leads to shortest Request time First (SRTF) algorithm
Question 2
Which of the following need not necessarily be saved on a context switch between processes?
General purpose registers
Translation look-aside buffer
Program counter
All of the above
Question 3
What is the name of the operating system that reads and reacts in terms of operating system?
Batch system
Quick response time
real time system
Time sharing system
Question 4
Which of the following need not necessarily be saved on a Context Switch between processes?
General purpose registers
Translation look-aside buffer
Program counter
Stack pointer
Question 5
The performance of Round Robin algorithm depends heavily on
size of the process
the I/O bursts of the process
the CPU bursts of the process
the size of the time quantum
Question 6
Fork is
the creation of a new job
the dispatching of a task
increasing the priority of a task
the creation of a new process
Question 7
Four jobs to be executed on a single processor system arrive at time 0 in the order A, B, C, D . Their burst CPU time requirements are 4, 1, 8, 1 time units respectively. The completion time of A under round robin scheduling with time slice of one time unit is
10
4
8
9
Question 8
Which of the following transmission media is not readily suitable to CSMA operation?
Radio
Optical fibers
Coaxial cable
Twisted pair
Question 9
In Ethernet, the source address field in the MAC frame is the _______ address.
original sender's physical
previous station's physical
next destination's physical
original sender's service port
Question 10
Which Project 802 standard provides for a collision-free protocol?
802.2
802.3
802.5
802.6
There are 80 questions to complete.