1.
Four necessary conditions for
deadlocks to exist are: mutual exclusion, no- preemption, circular wait and
a.
Hold and wait
b.
Deadlock avoidance
c.
Race round condition
d.
Buffer overflow
2.
Round-robin scheduling
a.
Allows interactive tasks quicker
access to the processor
b.
Is quite complex to implement
c.
Gives each task the same
chance at the processor
d.
Allows processor-bound tasks more
time in the processor
3.
Block or Buffer caches are used
a.
To improve disk performance
b.
To handle interrupts
c.
To increase the capacity of main
memory
d.
To speed up main memory read
operation
4.
Part of a program where the shared
memory is accessed and which should be executed invisibly, is called
a.
Semaphores
b.
Directory
c.
Critical section
d.
Mutual exclusion
5.
The total time to prepare a disk
drive mechanism for a block of data to be read from it is
a.
Latency
b.
Latency plus transmission time
c.
Latency plus seek time
d.
Latency plus seek time plus
transmission time
6.
What scheduling algorithm allows
processes that are logical runnable to be temporarily suspended?
a.
Preemptive scheduling
b.
Non- Preemptive scheduling
c.
FIFO
d.
FCFS
7.
What problem is solved by
Dijkstra’s banker’s algorithm?
a.
Mutual exclusion
b.
Deadlock recovery
c.
Deadlock avoidance
d.
Cache coherence
8.
Special software to create a job
queue is called a
a.
Drive
b.
Spooler
c.
Interpreter
d.
Linkage editor
9.
Page stealing
a.
Is a sign of an efficient system
b.
Is taking page frames from
other working sets
c.
Should be the tuning goal
d.
Is taking larger disk spaces for
pages paged out.
10.
Page-map table is
a.
A data file
b.
A directory
c.
Used for address
translation
d.
All of the above
These are the past Computer Science Operating System MCQs for NTS test.
1. Process is
a. Program in High level language kept on disk
b. Contents of main memory
c. A program in execution
d. A job in secondary memory
2. Fork is
a. The dispatching of a task
b. The creation of a new job
c. The creation of a new process
d. Increasing the priority of a task
3. To avoid the race condition, the number of processes that may be simultaneously inside their critical section is
a. 8
b. 1
c. 16
d. 0
4. FIFO algorithm
a. Executes first the job that last entered the queue
b. Executes first the job that first entered the queue
c. Execute first the job that has been in the queue the longest
d. Executes first the job with the least processor needs
5. The principal of locality of reference justifies the use of
a. Reenterable
b. Non reusable
c. Virtual memory
d. Cache memory
6. A page fault
a. Is an error is a specific page
b. Occurs when a program accesses a page of memory
c. Is an access to a page not currently in memory
d. Is a reference to a page belonging to another program.
7. The SJF algorithm executes first the job
a. That last entered the queue
b. That first entered the queue.
c. That has been in the queue the longest.
d. With the least processor needs.
8. Paging
a. Is a method of memory allocation by which the program is subdivided into equal portions or pages and core is subdivided into equal portions or blocks.
b. Consists of those addresses that may be generated by a processor during execution of a computation.
c. Is a method of allocating processor time.
d. Allows multiple programs to reside in separate areas of core at the time.
9. Scheduling is
a. Allowing jobs to use the processor
b. Unrelated to performance consideration
c. Not required in uniprocessor systems
d. The same regard-less of the purpose of the system.
10. Semaphores
a. Synchronize critical resources to prevent deadlock
b. Synchronize critical resources to prevent contention
c. Are used to do I/O
d. Are used for memory management.