TRB-CS-VIP ONLINE COACHING CENTER (QUIZ-5)OPERATING SYSTEM

Operating System

Quiz

 

1. The part of machine level instruction, which tells the central processor what has to be done, is
   1.   Operation code
   2.   Address
   3.   Locator
   4.   Flip-Flop
2. Which of the following refers to the associative memory?
   1.   the address of the data is generated by the CPU
   2.   the address of the data is supplied by the users
   3.   there is no need for an address i.e. the data is used as an address
   4.   the data are accessed sequentially
3. To avoid the race condition, the number of processes that may be simultaneously inside their critical section is
   1.   8
   2.   1
   3.   16
   4.   0
4. A system program that combines the separately compiled modules of a program into a form suitable for execution
   1.   assembler
   2.   linking loader
   3.   cross compiler
   4.   load and go
5. 5 . program in High level language kept on disk
   1.   contents of main memory
   2.   a program in execution
   3.   a job in secondary memory
   4.   None of the above
6. Addressing structure
   
   1.   defines the fundamental method of determining effective operand addresses
   2.   are variations in the use of fundamental addressing structures, or some associated actions which are related to addressing
   3.   performs indicated operations on two fast registers of the machine and leave the result in one of the registers.
   4.   all of the above
7. The Memory Buffer Register (MBR)
   1.   is a hardware memory device which denotes the location of the current instruction being executed.
   2.   is a group of electrical circuits (hardware), that performs the intent of instructions fetched from memory
   3.   contains the address of the memory location that is to be read from or stored into.
   4.   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".
8. The strategy of allowing processes that are logically runnable to be temporarily suspended is called
   1.   preemptive scheduling
   2.   non preemptive scheduling
   3.   shortest job first
   4.   first come first served
9. The Storage-to-Storage instructions
   1.   have both their operands in the main store.
   2.   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.
   3.   which perform indicated operations on two fast registers of the machine and have the result in one of the registers
   4.   all of the above
10. The LRU algorithm
    
    1.   pages out pages that have been used recently
    2.   pages out pages that have not been used recently
    3.   pages out pages that have been least used recently
    4.   pages out the first page in a given area
11. Which of the following systems software does the job of merging the records from two files into one?
    1.   Security software
    2.   Utility program
    3.   Networking software
    4.   Documentation system
12. 12 . Fork is
    1.   the dispatching of a task
    2.   the creation of a new job
    3.   the creation of a new process
    4.   increasing the priority of a task
13. Thrashing
    1.   is a natural consequence of virtual memory systems
    2.   can always be avoided by swapping
    3.   always occurs on large computers
    4.   can be caused by poor paging algorithms
14. Supervisor state is
    1.   never used
    2.   entered by programs when they enter the processor
    3.   required to perform any I/O
    4.   only allowed to the operating system
15. Which of the following instruction steps, would be written within the diamond-shaped box, of a flowchart?
    1.   S = B - C
    2.   IS A<10
    3.   PRINT A
    4.   DATA X,4Z
16. Which of the following statements is false?
    1.   the technique of storage compaction involves moving all occupied areas of storage to one end or other of main storage
    2.   compaction does not involve relocation of programs
    3.   compaction is also know as garbage collection
    4.   the system must stop everything while it performs the compaction
17. Which of the following functions is(are) performed by the loader
    1.   allocate space in memory for the programs and resolve symbolic references between object decks
    2.   adjust all address dependent locations, such as address constants, to correspond to the allocated space.
    3.   physically place the machine instructions and data into memory.
    4.   All of the above
18. User-Friendly Systems are:
    1.   required for object-oriented programming
    2.   easy to develop
    3.   common among traditional mainframe operating systems
    4.   becoming more common
19. Which of the following addressing modes, facilitates access to an operand whose location is defined relative to the beginning of the data structure in which it appears?
    1.   ascending
    2.   sorting
    3.   index
    4.   indirect
20. While running DOS on a PC, which command would be used to duplicate the entire diskette?
    1.   COPY
    2.   DISKCOPY
    3.   CHKDSK
    4.   TYPE
21. 
    21 . Memory
    1.   is a device that performs a sequence of operations specified by instructions in memory.
    2.   is the device where information is stored
    3.   is a sequence of instructions
    4.   s typically characterized by interactive processing and time-slicing of the CPU's time to allow quick response to each user.
22. Which of the following rules out the use of GO TO?
    1.   Flowchart
    2.   HIPO-DIAGRAMS
    3.   Nassi-Shneiderman diagram
    4.   All of the above
23. A system program that sets up an executable program in main memory ready for execution is
    
    1.   assembler
    2.   linker
    3.   loader
    4.   compiler
24. Which of the following are loaded into main memory when the computer is booted?
    1.   internal command instructions
    2.   external command instructions
    3.   utility programs
    4.   word processing instructions
25. The FIFO algorithm
    1.   executes first the job that last entered the queue
    2.   executes first the job that first entered the queue
    3.   execute first the job that has been in the queue the longest
    4.   executes first the job with the least processor needs