Operating System Multiple Q/A

1. Which of the following is NOT a valid deadlock prevention scheme? (GATE CS 2000)
(a) Release all resources before requesting a new resource
(b) Number the resources uniquely and never request a lower numbered resource than the last one requested.
(c) Never request a resource after releasing any resource
(d) Request and all required resources be allocated before execution.

Answer: (c)

2.	What is the name of the technique in which the operating system of a computer executes several programs concurrently by switching back and forth between them?
	A. Partitioning B. Multitasking C. Windowing D. Paging E. None of the above

Answer: (b)

3.A multi-user, multi-processing operating system cannot be implemented on hardware that does not support

a) Address translation

b) DMA for disk transfer

c) At least two modes CPU execution (priviledged and non-priviledged)

d) all of thes

Answer: (d)

4.	The problem of thrashing is affected significantly by:
	A. program structure B. program size C. primary-storage size D. all of the above E. None of the above

Answer: (a)

5.	What is the name given to the software which can be legally compiled and often used for free?
	A. Shareware program B. Public domain program C. Firmware program D. Mindware

Answer: (b)

6. what is the operating system used by Macintosh computers

a. system 7.0

b .au/x

c. xenix

d. none of the above 

Answer: (d)


7.the size of the virtual memory depends on
Answer: (The Size of Address Bus)

8.an algorithm is best described as
Answer: (A step by step procedure for solving a problem)

8.in a paged segmented scheme of memory management, the segment table itself must have a page table because
a)the segment table is often too large to fit in one page.
b)each segment is spread over a number of pages.
c)segment tables point to page tables and not to the physical location of the segment.
d)the processor's description base register pointa to a page table.
Answer: (b)

Q Memory protection is normally done by the

1. processor and associated hardware
2. operating system
3. compiler
4. user program

Answer: (1)

Q which of the following scheduling policy is well suited for a time-shared operating system ? 

1 shortest job first
2 round robin
3 first come=first served
4 elevator

Answer: (2)