1. |Round robin scheduling is essentially the preemptive version of __________fsecond | | | |
|1) |FIFO |
|2) |Shortest job first |
|3) |Shortest remaining |
|4) |Longest time first |
| |Correct Answer: FIFO [hide] | |
| |Marks: 1 | |
| | | |
| | | |
|2. |A page fault occurs | | |
|1) |when the page is not in the memory |
|2) |when the page is in the memory |
|3) |when the process enters the blocked state |
|4) |when the process is in the ready state |
| |Correct Answer: when the page is not| |
| |in the memory [hide] | |
| |Marks: 1 | |
| | | |
| | | |
|3. |Which of the following will determine your choice of systems software for your computer ? | | |
|1) |Is the applications software you want to use compatible with it ? |
|2) |Is it expensive ? |
|3) |Is it compatible with your hardware ? |
|4) |Both 1 and 3 |
| |Correct Answer: Both 1 and 3 [hide] | |
| |Marks: 1 | |
| | | |
| | | |
|4. |Let S and Q be two semaphores initialized to 1, where P0 and P1 processes the following statements | | |
| |wait(S);wait(Q); ---; signal(S);signal(Q) and wait(Q); wait(S);---;signal(Q);signal(S); respectively. | | |
| |The above situation depicts a _________ . | | |
|1) |Semaphore |
|2) |Deadlock |
|3) |Signal |
|4) |Interrupt |
| |Correct Answer: Deadlock [hide] | |
| |Marks: 1 | |
| | | |
| | | |
|5. |What is a shell ? | | |
|1) |It is a hardware component |
|2) |It is a command interpreter |
|3) |It is a part in compiler |
|4) |It is a tool in CPU scheduling |
| |Correct Answer: It is a command interpreter [hide] |
| | |
| | |
|6. |Routine is not loaded until it is called. All routines are kept on disk in a relocatable load format. | | |
| |The main program is loaded into memory & is executed. This type of loading is called _________ | | |
|1) |Static loading |
|2) |Dynamic loading |
|3) |Dynamic linking |
|4) |Overlays |
| |Correct Answer: Dynamic linking [hide] | |
| |Marks: 1 | |
| | | |
| | | |
|7. |In the blocked state | | |
|1) |the processes waiting for I/O are found |
|2) |the process which is running is found |
|3) |the processes waiting for the processor are found |
|4) |none of the above |
| |Correct Answer: the processes | |
| |waiting for I/O are | |
| |found [hide] | |
| |Marks: 1 | |
| | | |
| | | |
|8. |What is the memory from 1K - 640K called ? | | |
|1) |Extended Memory |
|2) |Normal Memory |
|3) |Low Memory |
|4) |Conventional Memory |
| |Correct Answer: Conventional Memory [hide] | |
| |Marks: 1 | |
| | | |
| | | |
|9. |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. |
| |Correct Answer: An illusion of extremely large main memory [hide] | |
| |Marks: 1 | |
| | | |
| | | |
|10. |The process related to process control, file management, device management, information about system | | |
| |and communication that is requested by any higher level language can be performed by __________. | | |
|1) |Editors |
|2) |Compilers |
|3) |System Call |
|4) |Caching |
| |Correct Answer: System Call [hide] | |
| |Marks: 1 | |
| | | |
| | | |
|11. |If the Disk head is located initially at 32, find the number of disk moves required with FCFS if the disk queue | | |
| |of I/O blocks requests are 98,37,14,124,65,67. | | |
|1) |310 |
|2) |324 |
|3) |315 |
|4) |321 |
| |Correct Answer: 321 [hide] | |
| |Marks: 1 | |
| | | |
| | | |
|12. |Multiprogramming systems ________. | | |
|1) |Are easier to develop than single programming systems |
|2) |Execute each job faster |
|3) |Execute more jobs in the same time |
|4) |Are used only on large main frame computers |
| |Correct Answer: Execute more | |
| |jobs in the same time [hide]| |
| |Marks: 1 | |
| | | |
| | | |
|13. |Which is not the state of the process ? | | |
|1) |Blocked |
|2) |Running |
|3) |Ready |
|4) |Privileged |
| |Correct Answer: Privileged [hide] | |
| |Marks: 1 | |
| | | |
| | | |
|14. |The solution to Critical Section Problem is : Mutual Exclusion, Progress and Bounded Waiting. | | |
|1) |The statement is false |
|2) |The statement is true. |
|3) |The statement is contradictory. |
|4) |None of the above |
| |Correct Answer: The statement is true. [hide] | |
| |Marks: 1 | |
| | | |
| | | |
|15. |The problem of thrashing is effected scientifically by ________. | | |
|1) |Program structure |
|2) |Program size |
|3) |Primary storage size |
|4) |None of the above |
| |Correct Answer: Program structure [hide] |
| | |
| | |
|16. |The state of a process after it encounters an I/O instruction is __________. | | |
|1) |Ready |
|2) |Blocked/Waiting |
|3) |Idle |
|4) |Running |
| |Correct Answer: Blocked/Waiting [hide] | |
| |Marks: 1 | |
| | | |
| | | |
|17. |The number of processes completed per unit time is known as __________. | | |
|1) |Output |
|2) |Throughput |
|3) |Efficiency |
|4) |Capacity |
| |Correct Answer: Throughput [hide] | |
| |Marks: 1 | |
| | | |
| | | |
|18. |_________ is the situation in which a process is waiting on another process,which is also waiting on | | |
| |another process ... which is waiting on the first process. None of the processes involved in this | | |
| |circular wait are making progress. | | |
|1) |Deadlock |
|2) |Starvation |
|3) |Dormant |
|4) |None of the above |
| |Correct Answer: Deadlock [hide] | |
| |Marks: 1 | |
| | | |
| | | |
|19. |Which of the following file name extension suggests that the file is Backup copy of another file ? | | |
|1) |TXT |
|2) |COM |
|3) |BAS |
|4) |BAK |
| |Correct Answer: BAK [hide] | |
| |Marks: 1 | |
| | | |
| | | |
|20. |Which technique was introduced because a single job could not keep both the CPU and the I/O devices | | |
| |busy? | | |
|1) |Time-sharing |
|2) |SPOOLing |
|3) |Preemptive scheduling |
|4) |Multiprogramming |
| |Correct Answer: Multiprogramming [hide] |
| | |
| | |
|21. |A critical region | | |
|1) |is a piece of code which only one process executes at a time |
|2) |is a region prone to deadlock |
|3) |is a piece of code which only a finite number of processes execute |
|4) |is found only in Windows NT operation system |
| |Correct Answer: is a piece of code which only one process executes at a time [hide] | |
| |Marks: 1 | |
| | | |
| | | |
|22. |The mechanism that bring a page into memory only when it is needed is called _____________ | | |
|1) |Segmentation |
|2) |Fragmentation |
|3) |Demand Paging |
|4) |Page Replacement |
| |Correct Answer: Demand | |
| |Paging [hide] | |
| |Marks: 1 | |
| | | |
| | | |
|23. |PCB = | | |
|1) |Program Control Block |
|2) |Process Control Block |
|3) |Process Communication Block |
|4) |None of the above |
| |Correct Answer: Process Control Block [hide] | |
| |Marks: 1 | |
| | | |
| | | |
|24. |FIFO scheduling is ________. | | |
|1) |Preemptive Scheduling |
|2) |Non Preemptive Scheduling |
|3) |Deadline Scheduling |
|4) |Fair share scheduling |
| |Correct Answer: Non Preemptive Scheduling [hide] | |
| |Marks: 1 | |
| | | |
| | | |
|25. |Switching the CPU to another Process requires to save state of the old process and loading new process| | |
| |state is called as __________. | | |
|1) |Process Blocking |
|2) |Context Switch |
|3) |Time Sharing |
|4) |None of the above |
| |Correct Answer: Context Switch [hide] |
| | |
| | |
|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 |
| |Correct Answer: Tree directory structure [hide] | |
| |Marks: 1 | |
| | | |
| | | |
|27. |The Banker¿s algorithm is used | | |
|1) |to prevent deadlock in operating systems |
|2) |to detect deadlock in operating systems |
|3) |to rectify a deadlocked state |
|4) |none of the above |
| |Correct Answer: to prevent deadlock| |
| |in operating systems [hide] | |
| |Marks: 1 | |
| | | |
| | | |
|28. |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 |
| |Correct Answer: is a lightweight process where the context switching is low [hide] | |
| |Marks: 1 | |
| | | |
| | | |
|29. |______ is a high level abstraction over Semaphore. | | |
|1) |Shared memory |
|2) |Message passing |
|3) |Monitor |
|4) |Mutual exclusion |
| |Correct Answer: Monitor [hide] | |
| |Marks: 1 | |
| | | |
| | | |
|30. |A tree sturctured file directory system | | |
|1) |allows easy storage and retrieval of file names |
|2) |allows easy storage and retrieval of file names |
|3) |is not essential when we have millions of files |
|4) |none of the above |
| |Correct Answer: allows easy storage and retrieval of file names [hide] |
| | |
| | |
|1. |The part of machine level instruction, which tells the central processor what has to be done, is |
| |A. |
| |Operation code |
| | |
| |B. |
| |Address |
| | |
| |C. |
| |Locator |
| | |
| |D. |
| |Flip-Flop |
| | |
| |E. |
| |None of the above |
| | |
| |Answer & Explanation |
| |Answer: Option A |
| |Explanation: |
| |No answer description available for this question. Let us discuss. |
| |View Answer Workspace Report Discuss in Forum |
[pic]
|2. |Which of the following refers to the associative memory? |
| |A. |
| |the address of the data is generated by the CPU |
| | |
| |B. |
| |the address of the data is supplied by the users |
| | |
| |C. |
| |there is no need for an address i.e. the data is used as an address |
| | |
| |D. |
| |the data are accessed sequentially |
| | |
| |E. |
| |None of the above |
| | |
| |Answer & Explanation |
| |Answer: Option C |
|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 |
| | |
| |E. |
| |None of the above |
| | |
| |Answer & Explanation |
| |Answer: Option B |
| |Explanation: |
|4. |A system program that combines the separately compiled modules of a program into a form suitable for execution |
| |A. |
| |assembler |
| | |
| |B. |
| |linking loader |
| | |
| |C. |
| |cross compiler |
| | |
| |D. |
| |load and go |
| | |
| |E. |
| |None of the above |
| | |
| |Answer & Explanation |
| |Answer: Option B |
| |Explanation: |
|5. |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 |
| | |
| |E. |
| |None of the above |
| | |
| |Answer & Explanation |
| |Answer: Option C |
| |Explanation: |
|6. |Addressing structure |
| |A. |
| |defines the fundamental method of determining effective operand addresses |
| | |
| |B. |
| |are variations in the use of fundamental addressing structures, or some associated actions which are related to addressing. |
| | |
| |C. |
| |performs indicated operations on two fast registers of the machine and leave the result in one of the registers. |
| | |
| |D. |
| |all of the above |
| | |
| |E. |
| |None of the above |
| | |
| |Answer & Explanation |
| |Answer: Option A |
| |Explanation: |
|7. |The Memory Buffer Register (MBR) |
| |A. |
| |is a hardware memory device which denotes the location of the current instruction being executed. |
| | |
| |B. |
| |is a group of electrical circuits (hardware), that performs the intent of instructions fetched from memory. |
| | |
| |C. |
| |contains the address of the memory location that is to be read from or stored into. |
| | |
| |D. |
| |contains a copy of the designated memory location specified by the MAR after a "read" or the new contents of the memory |
| |prior to a "write". |
| | |
| |E. |
| |None of the above |
| | |
| |Answer & Explanation |
| |Answer: Option D |
|8. |The strategy of allowing processes that are logically runnable to be temporarily suspended is called |
| |A. |
| |preemptive scheduling |
| | |
| |B. |
| |non preemptive scheduling |
| | |
| |C. |
| |shortest job first |
| | |
| |D. |
| |first come first served |
| | |
| |E. |
| |None of the above |
| | |
| |Answer & Explanation |
| |Answer: Option A |
| |Explanation: |
|9. |The Storage-to-Storage instructions |
| |A. |
| |have both their operands in the main store. |
| | |
| |B. |
| |which perform an operation on a register operand and an operand which is located in the main store, generally leaving the |
| |result in the register, expect in the case of store operation when it is also written into the specified storage location. |
| | |
| |C. |
| |which perform indicated operations on two fast registers of the machine and have the result in one of the registers |
| | |
| |D. |
| |all of the above |
| | |
| |E. |
| |None of the above |
| | |
| |Answer & Explanation |
| |Answer: Option A |
| |Explanation: |
|10. |The LRU algorithm |
| |A. |
| |pages out pages that have been used recently |
| | |
| |B. |
| |pages out pages that have not been used recently |
| | |
| |C. |
| |pages out pages that have been least used recently |
| | |
| |D. |
| |pages out the first page in a given area |
| | |
| |E. |
| |None of the above |
| | |
| |Answer & Explanation |
| |Answer: Option C |
| |Explanation: |
|11. |Which of the following systems software does the job of merging the records from two files into one? |
| |A. |
| |Security software |
| | |
| |B. |
| |Utility program |
| | |
| |C. |
| |Networking software |
| | |
| |D. |
| |Documentation system |
| | |
| |E. |
| |None of the above |
| | |
| |Answer & Explanation |
| |Answer: Option B |
|12. |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 |
| | |
| |E. |
| |None of the above |
| | |
| |Answer & Explanation |
| |Answer: Option C |
|13. |Thrashing |
| |A. |
| |is a natural consequence of virtual memory systems |
| | |
| |B. |
| |can always be avoided by swapping |
| | |
| |C. |
| |always occurs on large computers |
| | |
| |D. |
| |can be caused by poor paging algorithms |
| | |
| |E. |
| |None of the above |
| | |
| |Answer & Explanation |
| |Answer: Option D |
| |Explanation: |
|14. |Supervisor state is |
| |A. |
| |never used |
| | |
| |B. |
| |entered by programs when they enter the processor |
| | |
| |C. |
| |required to perform any I/O |
| | |
| |D. |
| |only allowed to the operating system |
| | |
| |E. |
| |None of the above |
| | |
| |Answer & Explanation |
| |Answer: Option D |
| |Explanation: |
|15. |Which of the following instruction steps, would be written within the diamond-shaped box, of a flowchart? |
| |A. |
| |S = B - C |
| | |
| |B. |
| |IS A 