1. A disk scheduling algorithm in an operating system causes the disk arm to seek back and forth access the disc surface servicing all request in its path, this is a
Correct : C. scan
2. An attached processor
Correct : D. is used only for limited, specific functions
3. Situations where two or more processes are reading or writing some shared data and the final result depends on who runs precisely which are called
Correct : A. race condition
4. Producer consumer problem can be solved using
Correct : D. All of the above
5. The strategy of allowing process that are logically run able to be temporarily suspended is called
Correct : A. preemptive scheduling
6. Moving process from main memory to disk is called
Correct : C. Swapping
7. Banker’s algorithm for resource allocation deals with
Correct : B. deadlock avoidance
8. The dispatcher
Correct : A. actually schedules the tasks into the processor
9. A set or resource allocations such that the system can allocate resources to each process in some order, and still avoids a deadlock is called
Correct : B. safe state
10. Processor-bound tasks
Correct : B. use more processor time
11. The following resources can cause
deadlocks
Correct : C. Printers
12. The intensive jobs
Correct : B. you are constrained by their I/O requirements
13. The FIFO algorithm
Correct : B. executes first the job that first entered the queue
14. Check pointing a job
Correct : B. allows it to continue executing later
15. Windows is an
Correct : C. user interface
16. Following is/are operating system used in computers
Correct : D. All of the above
17. The following operating system writes through catches?
Correct : B. DOS
18. Which is/are the most important features of Microsoft windows program?
Correct : D. All of the above
19. Multiprocessing models have
Correct : C. both (A) and (B) above
20. Real-time systems are
Correct : B. used for monitoring events as they occur
21. Multiprogramming systems
Correct : C. execute more jobs in the same time period
22. Virtual memory is
Correct : C. less efficient in utilization of memory
23. Memory management is
Correct : B. replaced with virtual memory on current systems
24. Scheduling is
Correct : C. Both A and B
25. Following is true for Multiprocessing
Correct : C. It allows the same computer to have multiple processors
26. A monitor program is a program that
Correct : C. interprets the input from a keyboard and converts the input into its binary equivalent
27. The process scheduler in the processor management unit
Correct : C. selects a process to run
28. Round robin is a
Correct : B. process scheduling policy
29. Which is the correct definition of a valid process transition in an operating system?
Correct : B. Dispatch: ready? running
30. A critical section is a program segment
Correct : C. where shared resources are accessed
31. Which of the following is an example of a spooled device?
Correct : A. A line printer used to print the output of a number of jobs
32. A solution to the Dining Philosophers Problem which avoids deadlock is
Correct : C. ensure that one particular philosopher picks up the left fork before the right fork, and all other philosophers pick up the right fork before the left fork.
33. Locality of reference implies that the page reference being made by a process
Correct : B. is likely to be to one of the pages used in the last few page references
34. The correct matching for the following pairs is - (A) Disk sucheduling, (1) Round robin, (B) Batch processing, (2) SCAN ,(C) Time sharing, (3) LIFO, (D) Interrupt processing, (4) FIFO,
Correct : A. A-2, B-4, C-1, D-3
35. Shared sub-directories and files are
example of
Correct : A. cyclic graph directory
36. The lowest level of I/O control consists of
Correct : C. both A and B above
37. Which type of design problem in file system
Correct : C. Both A and B above
38. Of the following which is the methods for allocating disks
Correct : B. Linked
39. External fragmentation solved by which allocation?
Correct : D. both B and C
40. Which O/I are best method for allocating?
Correct : B. Linked
41. Allocate the first hole that is big enough is called
Correct : A. first fit
42. Allocate the smallest hole that. is big enough is called
Correct : B. best fit
43. The most efficient data set organization is
Correct : C. variable depending upon the usage of the data set
44. A partitioned data set is most used for
Correct : C. a program or source library
45. Fragmentation of the file system
Correct : C. can be temporarily removed by compaction
46. File record length
Correct : C. depends upon the size of the file
47. Disaster recovery
Correct : C. varies in degree between installations
48. Wild-card specifies
Correct : A. provide an easy way of finding groups of related files
49. The allocation map
Correct : B. specifies which blocks are used by which file
50. The activity of a file
Correct : A. is a low percentage of number of records that are added to or deleted from a file
51. The volatility of a file refers to
Correct : A. The number of records added or deleted from a file composed to the original number of records in that file
52. Which types of file organization are
supported by magnetic tape?
Correct : B. contiguous sequential file
53. Address Binding is defined as
Correct : D. All of the above
54. Compile time
Correct : A. where the process will reside in memory, then absolute code can be generated
55. Load time
Correct : B. where the process will reside in memory, then the compiler must generate relocatable memory
56. Fragmentation of the file system
Correct : C. can be temporarily removed by compaction
57. Stub
Correct : D. all of the above
58. Local replacement
Correct : B. requires that each process selects from only its own set of allocated frames
59. Thrashing
Correct : C. both A and B above
60. Thrashing can be avoided if
Correct : A. the pages, belonging to the working set of the programs are in main memory
61. The memory allocation scheme subject to external fragmentation is
Correct : A. segmentation
62. In virtual memory systems, dynamic address
translation
Correct : A. is the hardware necessary to implement paging
63. Relocatable programs
Correct : B. can be loaded almost anywhere in memory
64. Fixed partitions
Correct : C. are very inefficient in memory utilization
65. Virtual system swapping
Correct : D. is used only on systems that are thrashing
66. The term paging refers to
Correct : B. gradually increasing the priority of jobs that wait in the system for a long time to remedy infinite blocking
67. With a segmentation, if there are 64 segments, and the maximum segment size is 512 words, the length of the logical address in bits is
Correct : C. 15
68. High paging rate
Correct : A. may cause high I/O rate
69. The total time to prepare a disk drive
mechanism for a block of data to be read from it is
Correct : C. latency plus seek time
70. Following illustrates Associative Memory
Correct : C. No need for address; information is used as address
71. A disk scheduling algorithm in an operating system causes the disk arm to seek back and forth across the disk surface servicing all requests in its path, based on
Correct : C. Sean
72. Access to moving head disks requires three periods of delay before information is brought into memory. The response that correctly lists the three time delays for the physical access of data in the order of the relative speed from the slowest to the fastest is
Correct : C. seek time, latency time, transmission time
73. An unpaged cache associates disk domains with the address of the read and continues for a specific length. The major disadvantage of unpaged cache is that
Correct : A. it allows cache domain to contain redundant data