Computer Science Operating System Questions for Interview - Set 04 - ObjectiveBooks

Computer Science Operating System Questions for Interview - Set 04

Practice Test: Question Set - 04

1. Which of the following is not a characteristic of a daisy chaining priority control scheme?
    (A) Priority is programmable
    (B) It is relatively easy to add more devices to the chain
    (C) The failure of one device may affect other devices on the chain
    (D) The number of control lines is independent of the number of devices on the chain

2. In which addressing mode the effective address of the operand is the contents of a register specified in the instruction and after accessing the operand, the contents of this register is incremented to point to the next item in the list?
    (A) Index addressing
    (B) Indirect addressing
    (C) Auto increment
    (D) Auto decrement

3. Page-map table is
    (A) A data file
    (B) A directory
    (C) Used for address translation
    (D) All of the above

4. Under multiprogramming, turnaround time for short jobs is usually _______ and that for long jobs is slightly _______.
    (A) Lengthened; shortened
    (B) Shortened; lengthened
    (C) Shortened; shortened
    (D) Lengthened; lengthened

5. 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

6. A program that converts a high-level language program to a set of instructions that can run on a computer is called a
    (A) Compiler
    (B) Debugger
    (C) Editor
    (D) None of the above

7. Capacity planning
    (A) Requires detailed system performance information
    (B) Is independent of the operating system
    (C) Does not depend on the monitoring tools available
    (D) Is not needed in small installations

8. 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

9. The technique, for sharing the time of a computer among several jobs. Which switches jobs so rapidly such that each job appears to have the computer to itself:
    (A) Time sharing
    (B) Time out
    (C) Time domain
    (D) FIFO

10. A relationship between processes such that each has some part (critical section) which must not be executed while the critical section of another is being executed, is known as
    (A) Semaphore
    (B) Mutual exclusion
    (C) Multiprogramming
    (D) Multitasking

11. 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

12. Which of the following is a block device?
    (A) Mouse
    (B) Printer
    (C) Terminals
    (D) Disk

13. Which of the following is not an advantage of multiprogramming?
    (A) Increased throughput
    (B) Shorter response time
    (C) Decreased operating-system overhead
    (D) Ability to assign priorities to jobs

14. 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

15. Which of the following is not true about documentation?
    (A) Documentation, of a system, should be as clear and direct as possible
    (B) Documentation increases the maintenance time and cost
    (C) Documentation gives better understanding of the problem
    (D) All of the above

Show and hide multiple DIV using JavaScript View All Answers

 Next Tests:

    Blogger Comment
    Facebook Comment