OS Overview Objectives 1-15

1.       Which is not an Operating System ?
1 Windows 95
2 MS-DOS
3 Windows 3.1
4 Windows 2000
Ans ) 3
2.       The operating system manages ________.
1 Memory
2 Processor
3 Disk and I/O devices
4 All of the above
Ans ) 4
3.       It is not the layer of the Operating system.
1 Kernel
2 Shell
3 Application program
4 Critcal Section
Ans ) 4
4.       ___________ begins at the root and follows a path down to the specified file
1 Relative path name
2 Absolute path name
3 Standalone name
4 All of the above
Ans ) 2
5.       Who is called a supervisor of computer acitvity ?
1 CPU
2 Operating system
3 Control unit
4 Application Program
Ans ) 2
6.       Consider the two statements.
(A) Protection is an internal problem.
(B) Security is considered as an external environment within which the system works. Which of the statement is not true?
1 Only A
2 Only B
3 Both A and B
4 None of the above
Ans ) 4
7.        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
Ans ) 3
8.       Mutual exclusion
1 if one process is in a critical region others are excluded
2 prevents deadlock
3 requires semaphores to implement
4 is found only in the Windows NT operating system
Ans ) 1
9.       Which scheduler controls the degree of multiprogramming?
1 Short term scheduler
2 Long term scheduler
3 Middle term scheduler
4 None of the above
Ans ) 2
10.    What is the name of the software which can be legally compiled and often used for free?
1 Shareware program
2 Public domain program
3 Firmware program
4 Mind Ware
Ans ) 2
11.   The problem of fragmentation arises in ________.
1 Static storage allocation
2 Stack allocation storage
3 Stack allocation with dynamic binding
4 Heap allocation
Ans ) 4
12.    In interactive environments such as time-sharing systems, the primary requirement is to provide reasonably good response time and in general, to share system resources equitably. In such situations, the scheduling algorithm that is most popularly applied is ________.
1 Shortest Remaining Time Next (SRTN) Scheduling
2 Priority Based Preemptive Scheduling
3 Round Robin Scheduling
4 None of the above
Ans ) 3
13.   Thrashing occurs ________.
1 when excessive swapping takes place
2 when you thrash your computer
3 whenever deadlock occurs
4 when no swapping takes place
Ans ) 1
14.    Boundary registers ________.
1 Are available in temporary program variable storage
2 Are only necessary with fixed partitions
3 Track the beginning and ending the program
4 Track page boundaries
Ans ) 3
15.   The principle of locality of reference justifies the use of ________.
1 Virtual Memory
2 Interrupts
3 Main memory
4 Cache memory

Ans ) 4 

No comments:

Post a Comment

Thank you for using this blog.