1 Inter process communication
2 Thrashing
3 Context Switch
4 None of the above
Right Ans ) 2
2) The Hardware mechanism that enables a device to notify the CPU is called __________.
1 Polling
2 Interrupt
3 System Call
4 None of the above
Right Ans ) 2
3) In the running state
1 only the process which has control of the processor is found
2 all the processes waiting for I/O to be completed are found
3 all the processes waiting for the processor are found
4 none of the above
Right Ans ) 1
4) Which of the following is crucial time while accessing data on the disk?
1 Seek time
2 Rotational time
3 Transmission time
4 Waiting time
Right Ans ) 1
5) Process State is a part of
1 Process Control block
2 Inode
3 File Allocation Table
4 None of the above
Right Ans ) 1
6) Who is called a supervisor of computer acitvity ?
1 CPU
2 Operating system
3 Control unit
4 Application Program
Right Ans ) 2
7) Virtual memory is __________.
1 An extremely large main memory
2 An extremely large secondary memory
3 An illusion of extremely large main memory
4 A type of memory used in super computers.
Right Ans ) 3
8) The kernel keeps track of the state of each task by using a data structure called __
1 Process control block
2 User control block
3 Memory control block
4 None of the above
Right Ans ) 1
9) Which of the following disk scheduling techniques has a drawback of starvation ?
1 SCAN
2 SSTF
3 FCFS
4 LIFO
Right Ans ) 2
10) A binary semaphore
1 has the values one or zero
2 is essential to binary computers
3 is used only for synchronisation
4 is used only for mutual exclusion
Right Ans ) 1
11) _________ page replacement alogorithm suffers from Belady's anamoly.
1 LRU
2 MRU
3 FIFO
4 LIFO
Right Ans ) 3
12) _________ is a high speed cache used to hold recently referenced page table entries a part of paged virtual memory
1 Translation Lookaside buffer
2 Inverse page table
3 Segmented page table
4 All the above
Right Ans ) 1
13) _________ does the job of allocating a process to the processor.
1 Long term scheduler
2 Short term scheduler
3 Medium term scheduler
4 Dispatcher
Right Ans ) 4
14) In interactive environments such as time-sharing systems, the primary requirement is to provide reasonably good response time and in general, to share system resources equitably. In such situations, the scheduling algorithm that is most popularly applied is ________.
1 Shortest Remaining Time Next (SRTN) Scheduling
2 Priority Based Preemptive Scheduling
3 Round Robin Scheduling
4 None of the above
Right Ans ) 3
15) In the multi-programming environment, the main memory consisting of _________ number of process.
1 Greater than 100
2 Only one
3 Greater than 50
4 More than one
Right Ans ) 4
16) In a multithreaded environment _______.
1 Each thread is allocated with new memory from main memory.
2 Main thread terminates after the termination of child threads.
3 Every process can have only one thread.
4 None of the above
Right Ans ) 2
17) Which of the following statement is not true?
1 Multiprogramming implies multitasking
2 Multi-user does not imply multiprocessing
3 Multitasking does not imply multiprocessing
4 Multithreading implies multi-user
Right Ans ) 4
18) In one of the deadlock prevention methods, impose a total ordering of all resource types, and require that each process requests resources in an increasing order of enumeration. This voilates the _______________ condition of deadlock
1 Mutual exclusion
2 Hold and Wait
3 Circular Wait
4 No Preemption
Right Ans ) 3
19) In the ___________ method of data transfer, the participation of the processor is eliminated during data transfer.
1 Buffering
2 Caching
3 Direct Memory Access
4 Indirect Memory Access
Right Ans ) 3
20) A thread is a __________ process .
1 Heavy Weight
2 Mutliprocess
3 Inter Thread
4 Light wieght
Right Ans ) 4
21) Data reside in file on disk under DOS environment, which of the following file name is invalid ?
1 OSCONCEPTS.doc
2 RAW
3 COMPAQ.BOOK
4 JUMPSTART.BOS
Right Ans ) 3
22) In Priority Scheduling a priority number (integer) is associated with each process. The CPU is allocated to the process with the highest priority (smallest integer = highest priority). The problem of, Starvation ? low priority processes may never execute, is resolved by __________.
1 Terminating the process.
2 Aging
3 Mutual Exclusion
4 Semaphore
Right Ans ) 2
23) CPU Scheduling is the basis of _________ operating system
1 Batch
2 Real time
3 Multiprogramming
4 Monoprogramming
Right Ans ) 3
24) A major problem with priority scheduling is _________.
1 Definite blocking
2 Starvation
3 Low priority
4 None of the above
Right Ans ) 2
25) ________ scheduler selects the jobs from the pool of jobs and loads into the ready queue.
1 Long term
2 Short term
3 Medium term
4 None of the above
Right Ans ) 1
26) Which directory implementation is used in most Operating System?
1 Single level directory structure
2 Two level directory structure
3 Tree directory structure
4 Acyclic directory structure
Right Ans ) 3
27) Saving the state of the old process and loading the saved state of the new process is called ________.
1 Context Switch
2 State
3 Multi programming
4 None of the above
Right Ans ) 1
28) The term " Operating System " means ________.
1 A set of programs which controls computer working
2 The way a computer operator works
3 Conversion of high-level language in to machine level language
4 The way a floppy disk drive operates
Right Ans ) 1
29) Resource locking ________.
1 Allows multiple tasks to simultaneously use resource
2 Forces only one task to use any resource at any time
3 Can easily cause a dead lock condition
4 Is not used for disk drives
Right Ans ) 2
30) A thread
1 is a lightweight process where the context switching is low
2 is a lightweight process where the context swithching is high
3 is used to speed up paging
4 none of the above
Right Ans ) 1
----> NEXT PART ---->
No comments:
Post a Comment