Multiple-Choice Questions 1. Windows 2000 OS can act as a (A) Web client. (C) Both (A) & (B).

(B) Web server. (D) Neither (A) nor (B).

2. While executing OS instructions the processor works in (A) Privileged mode. (C) Dual mode. (B) User mode. (D) Network mode.

3. The Application Programming Interface (API) contains (A) Network protocols. (C) Error detection codes 4. Fork leads to a (A) Interrupt. (C) Child process. (B) Exception. (D) Suspend process. (B) System calls. (D) Encryption data.

5. Wait and Signal primitives belong to (A) Semaphores. (C) Mailboxes. (B) Queues. (D) Pipes.

6. The optimum CPU scheduling algorithm is (A) FIFO. (C) SJF without preemption. 7. Bankers algorithm is used in (A) Deadlock detection. (C) Deadlock avoidance. (B) Deadlock prevention. (D) Inter process synchronisation. (B) SJF with preemption. (D) Round Robin.

8. A paging system with 8 pages and 1024 words each in these pages has ______ bits in its logical address. (A) 15 bits (C) 10 bits 9. (B) 20 bits (D) 13 bits

The operating system with bounded delays is a (A) Hard real time system (C) Distributed system (B) Soft real time system (D) Time sharing system

10. Execution of an Interrupt handler routine is an

(A) I/O process (C) User process

(B) Kernel process (D) Memory process

11. The command line interpreter program is also called as (A) kernel (C) protocol 12. Fork is a (A) user process (C) System call (B) CPU bound process (D) I/O operation (B) process (D) shell

13. Special software used to create a Job queue is called a (A) editor (C) driver (B) interpreter (D) spooler

14. In terms of average wait time the optimum scheduling algorithm is (A) FCFS (C) Priority (B) SJF (D) RR

15. Bakery algorithm is one of the solutions to (A) Scheduling (C) Process synchronisation (B) Inter process communication (D) Deadlock

16. Presence of Loops / cycles in a Resource Allocation Graph indicates (A) Deadlock state (C) Unsafe state (B) Safe state (D) Wait state

17. The memory management system that supports users view of memory is (A) Segmentation (C) Virtual memory 18. Files with an extension .bin is an (A) archive file (C) object file 19. Distributed systems provide (A) Resource sharing. (C) Reliability. 20. Naming is a method of (B) Speed. (D) All of these. (B) multimedia file (D) executable file (B) Paging (D) Contiguous memory

(A) IPC. (C) Synchronisation. 21. Round Robin scheduling is used in (A) Disk scheduling. (C) I/O scheduling. 22. Bankers algorithm is used in (A) Threads. (C) Deadlock avoidance. 23. Compaction is a solution to (A) Dead locks. (C) Security problems.

(B) Paging. (D) File management.

(B) CPU scheduling (D) Multitasking.

(B) CPU scheduling. (D) Paging.

(B) Fragmentation. (D) concurrency problems.

24. Page sizes in paging system are expressed in (A) Powers of 10 (C) Powers of 16 (B) Powers of 8 (D) Powers of 2

25. Context switching times are dependent on Hardware. FALSE TRUE

26. All unsafe states are deadlock states. TRUE FALSE

27.

The main task of Kernel layer in operating system is to handle (A) Segmentation and paging (C) File and devices (B) Data blocks (D) Process and Semaphores

28. Most computer systems have small piece of code stored in ROM known as

(A) Compiler (C) Byte code 29.

(B) Bootstrap program (D) Linker

Thread is a basic unit of execution of CPU utilization and is sometimes called (A) Heavy weight process (B) Virtual weight process (C) Light weight process (D) Dummy weight process

30.

The solution to critical section problem uses a Synchronization tool called (A) Semaphore (C) Atomicity (B) Scheduling (D) Event-handling

31.

A variant of resource-allocation-graph used for single instance resources in deadlock detection algorithm is (A) Process-graph (C) Wait-for graph (B) Resource graph (D) Isomorphic-graph

32.

An optimal page replacement has (A) High page fault rate and never suffer from Beladys anomaly (B) Low page fault rate and always suffer from Beladys anomaly (C) High page fault rate and always suffer from Beladys anomaly (D) Low page fault rate and never suffer from Beladys anomaly

33.

File Allocation Table (FAT) is used in (A) MS-DOS (C) OS/2 (B) Both (A) and (C) (D) Unix

34.

In I/O devices, the host repeatedly reads the busy bit until that bit becomes clear. This process is known as (A) Masking (C) Polling (B) Interrupting (D) Exception handling

35.

In Windows 2000 all processor dependent code is isolated in a dynamic link library (DLL) called (A) Kernel System (C) Hardware Abstraction Layer (B) Network File System (D) Object Manager

36. In soft-real time scheduling, which one of the following is valid: (A) Critical processes receive priority over less fortunate process

(B) Critical process to complete in a guaranteed amount of time (C) Critical process to preempt all process (D) Critical process to have resource reservation. 37. Bankers algorithm for resource allocation deals with (A) Deadlock prevention. (C) Deadlock recovery. (B) Deadlock avoidance. (D) Mutual exclusion.

38. Moving process from main memory to disk is called (A) Scheduling. (C) Swapping. (B) Caching. (D) Spooling.

39. What is name of operating system that read and reacts in terms of actual time? (A) Real time system (C) Quick response system (B) Batch system (D) Time sharing system

40. In which of the following page replacement policies, Boladys anomaly occurs? (A) FIFO (C) LFU (B) LRU (D) SRU

41. Producer consumer problem can be solved using (A) Semaphores. (C) Monitors. (B) Event counters. (D) All of the above.

42. The principle of locality of reference justify the use of (A) DMA. (C) Cache memory. 43. Virtual memory is (A) an extreme large main memory. (B) an extremely large secondary memory. (C) an illusion of an extremely large memory. (D) a type of memory used in computers. 44. In Round Robin CPU scheduling, as the time quantum is increased, the average turn around time (A) Varies irregular. (C) Increases. (B) Remains constant. (D) Decreases. (B) Polling. (D) Virtual memory.

45.

In which of the following strategies a program is located in the smallest available hole in the main memory. (A) Buddy (C) First-fit (B) Best-fit (D) Worst-fit

46. To avoid the race condition the number of processes that may be simultaneously inside the critical section is (A) 0 (C) 2 (B) 1 (D) 3

47. When two or more processes are waiting indefinitely for an event which can be solved by one of the waiting processes, the state is called as (A) Hanging (C) Starvation (B) Deadlock (D) Circular wait

48. One solution to external fragmentation is (A) Swapping (C) Compaction 49. Demand paging technique is used in (A) Virtual memory (C) Physical memory (B) Cache memory (D) Secondary memory (B) Garbage collection (D) Paging

50. Batch processing operating systems refer to their resident code as (A) Dispatcher (C) Linker (B) Scheduler (D) Supervisor

51. For a segment with base = 400 and Length = 350, the physical address for a logical address 575 is (A) 975, valid (C) 750, valid 52. Fork is a (A) System call (C) Kernel process (B) User process (D) I/O process (B) 750, invalid (D) 975, invalid

53. The operating system with bounded delays is a (A) Soft real time system (C) Distributed system (B) Hard real time system (D) Time sharing system

54. The type of network suited for a university campus is a

(A) WAN (C) LAN

(B) MAN (D) INTERNETWORK

55. Signal and wait are two procedures belonging to (A) Semaphores (C) Monitors 56. Command interpretation is done by (A) Kernel (C) Microkernel 57. Beladys anamoly refers to (A) (B) (C) (D) Page fault variation. Loss of synchrony between processes. Misbehaviour of child processes. None of the above. (B) Shell (D) Supervisor (B) Queues (D) Mailboxes

58. Cycle stealing is found in (A) Virtual memory. (C) RAM accesses. (B) DMA access. (D) Segmentation.