1. The memory management, y one clock policy is applied then the page first loaded into a frame in memory its use bit is set to
Correct : B. One
2. In memory management Free page list is: A- A list of page frames available for reading in pages. B- A list where replaced page is assigned without modification. C-A list where replaced page is assigned with modification.
Correct : B. A and B are true
3. A policy in memory management referred as
clock policy because one can visualize the page frames as laid out in
Correct : C. Circle
4. In memory management :A-Fixed allocation policy, B-Variable allocation policy: 1-It gives a process a fixed number of frames in main memory within which to execute. 2-It allows the number of page frames allocated to a process to be varied over the life time of the process. 3-In it a number of allocated frames are decided at initial load time.
Correct : A. A – 1, 3, B – 2
5. In uni-processor scheduling :A : Turnaround time, B : Response time, 1: A time interval between the submission of a process and its completion. 2: For interactive process, it is a time from the submission of a request until the response begins to received. 3: It includes actual execution time plus time spent waiting for resources.
Correct : B. A – 1, 3, B – 2
6. In uni-processor management processor through put
Correct : A. Is a measure of how much work is being performed
7. In uni-processor scheduling, a priorities enforcement is
Correct : A. When processes are assigned priorities and scheduling policy favor higher priority processes.
8. In uni-processor scheduling, if non- preemptive policy is applied then
Correct : A. Once a process is in running state, it continues to execute until it terminates or block itself.
9. In aperiodic (real time) tasks
Correct : C. The dead line for finish and start is mandatory.
10. The time table of railway, and airline which defines arrival and departure can be considered as
Correct : A. Hard real time scheduling
11. When preemptive policy is applied to uni- processor scheduling then
Correct : B. Currently running process can be interrupted and moved to ready state by the operating system.
12. The normalized turnaround time is
Correct : A. Ratio of turnaround time to service time
13. In round robin (time slicing) policy applied on uni-processor scheduling
Correct : A. When interrupt occurs, the currently running process is placed in ready queue, and next ready job is selected in First come First serve basis.
14. If normalized turnaround time of different process are given. Then Highest response ratio next policy in uni- processor scheduling policy selects.
Correct : B. The ready process with highest normalized turnaround time.
15. In multi processor scheduling, independent parallelism indicates
Correct : B. There is no explicit synchronization among processes.
16. In round robin (time slicing) policy applied
on uni processor scheduling
Correct : A. When interrupt occurs, the currently running process is placed in ready queue, and next ready job is selected in First come First serve basis.
17. If normalized turnaround time of different process are given. Then Highest response ratio next policy in uni processor scheduling policy selects
Correct : B. The ready process with highest normalized turnaround time.
18. In multi processor scheduling, independent parallelism indicates
Correct : B. There is no explicit synchronization among processes.
19. In multi processor scheduling; A: Coarse gained parallelism, B: Medium grained parallelism, C: Fine grained parallelism; 1- Concurrent processes running on a multi programmed uni processor, 2 Parallel processing or multi tasking is done within a single application, 3-Parallel processing is done within a single instruction stream.
Correct : A. A – 1, B – 2, C – 3
20. A situation where two or more processes coordinate their activities based on a condition is referred as
Correct : A. Synchronization
21. Par begin (P1)
Correct : A. Suspends main program, execute procedure P1 and after execution resume main program.
22. The mail box and ports are examples of
Correct : A. Indirect process communication
23. In Dynamic partition of main memory in memory management, the sized of process and memory partition is
Correct : A. of exactly same size
24. In the simple paging in memory management where
Correct : C. Process is divided into a number of equal size pages of same length as of frames.
25. A. Absolute Loading B. Relocatable Loading
C. Dynamic Run-Time Loading; 1- It requires that a load module always be loaded into some location in main memory. 2- A load module can be located anywhere in main memory.
Correct : C. A – 1, B – 2, C – 2
26. The disk and tape devices are referred as
Correct : A. Block oriented I/O devices
27. Which of the following is not human readable I/O device ?
Correct : D. Disk drives
28. Following is not the stream oriented I/O
device
Correct : D. Disk/tape
29. The direct memory access (DM(A) module
Correct : A. Controls the data exchange between main memory and I/O module.
30. The access time in disk scheduling is
Correct : C. The sum of seek time and rotational delay.
31. The transfer time in disk scheduling is
Correct : A. Proportional to rotation speed.
32. In last- in-first- out, disk scheduling policy
Correct : B. Recently received request is entertained first.
33. In disk scheduling, SCAN algorithm states
Correct : A. The arm is required to move in one direction only.
34. RAID (Redundant Array of Independent Disks) scheme consists of
Correct : C. Seven levels, from zero to six.
35. In RAID scheme, which of the RAID level does
not use parity calculation in redundancy achievement
Correct : D. RAID 1
36. In system buffer cache, used in UNIX, following not true
Correct : B. It is not a disk cache
37. In disk scheduling, the shortest service time first policy selects the disk request that
Correct : B. In cure the minimum seek time
38. The C–SCAN, in disk scheduling states
Correct : C. The are is to be state fixed
39. RAID-O does not support the following characteristics: A: RAID is a set of physical disk drives viewed by the operating system as a single logical drive. B: Data distributed across the physical drives of an array. C: Re- demdant disk capacity is used to store parity information, which guarantees data recoverability in case of a disk failure.
Correct : D. C only
40. The UNIX scheduling gives
Correct : A. Highest preference to real time processes
41. In disk scheduling when SCAN (Look) policy is applied and when last track reached in one direction
Correct : A. The service direction is reversed and scan proceeds in opposite direction.
42. In RAID (Redundant Array of Independent
Disks) scheme, which of the following RAID level does not include redundancy to improve performance ?
Correct : A. RAID level 0
43. In which of the following RAID scheme, redundancy is achieved by the simple expedient of duplicating all the data ?
Correct : B. RAID level 1
44. In shortest service time first policy, applied on disk scheduling, the disk request is selected
Correct : A. That requires the least movement of disk arm from its current position.
45. The RAID (Redundant Array of Independent Disks) level one requires
Correct : B. Twice disk space of the logical disk that it support.
46. Match the following in RAID scheme : A- Parallel access array, B-Independent access array, 1- All member disks participate in the execution of every I/O request. 2- Each member disk participates separately in the execution of every I/O request. 3- Here spindles of the individual drives are synchronized so that each disk head is in the same position on each disk at any given time.
Correct : A. A – 1, 3 and B – 2
47. The following RAID level employer parallel access technique and single redundant disk
Correct : D. RAID level 3
48. The RAID scheme indicate
Correct : D. Redundant access of information data.
49. Which of the RAID level does not employ
independent access technique ?
Correct : D. RAID 3
50. Which of the following RAID level uses independent access technique and distributes the parity strips across all disks?
Correct : D. Five
51. Cache memory is
Correct : D. Smaller and faster than main memory
52. By principle of locality, cache memory
Correct : B. Reduces average memory access time
53. Following is not true for disk cache
Correct : C. It is bigger is size than main memory
54. In disk storage devices, data are recorded on and later retrieved from disk via a conducting coil named
Correct : C. Head
55. In disk storage devices during read and write operation
Correct : B. Head is stationary while platter rotates
56. In magnetic disk, density that is in bits per linear inch
Correct : A. Increases in moving from the outer most track to the inner most track.
57. Data from and to magnetic disk is
transformed in
Correct : B. Blocks
58. On magnetic disks, the data on the platter is organized in a concentric sets of rings called
Correct : D. Tracks
59. In disk storage devices the width of head is:
Correct : A. Same of the track
60. In a fixed head disk, the number of read/write head per track are
Correct : A. One
61. CD defines
Correct : C. Compact disk
62. A-Fixed-Head disk, B-Movable-Head disk, 1- One head per track and al head are mounted on rigid arm that extends across all tracks. 2- Only one head and head is mounted on the arm, such that it can position the track.
Correct : A. A – 1, B – 2
63. The record is the collection of
Correct : A. Fields
64. In File system architecture which is the correct arrangement from lower level to higher.
Correct : A. Device drives, basic file system, basic I/ O supervisor, logical I/O.
65. In file management system the following communicate directly with periphing I/O devices.
Correct : A. Device drives
66. For file management, in file operations
device drivers are
Correct : C. A and B both
67. In file management, the primary interface of computer system with external environment is done through
Correct : B. Basic file system
68. In file management, users and applications access records via
Correct : C. Logical I/O
69. Match the following for file system architecture : A-Basic file system, B-Logical I/O module, 1- Deals with blocks of data, 2- Deals with file records, 3- Provides general purpose record I/O capacity.
Correct : A. A – 1, B – 2, 3
70. Match the following access rights :A-Specific user, B-User group, C-All ; 1- Individual user who are designated by user I, 2-A set of users who are individually defined, 3-Every user has access to the system.
Correct : A. A – 1, B – 2, C – 3
71. In file management, the pile
Correct : A. The collection of data in order which they arrive.
72. In file management, in the following record blocking method, the optional use of space is made, without unused space left
Correct : B. Variable-length spanned blocking
73. In secondary storage management, “If allocation of file is made on an individual block basis and each block contains a pointer to the next block in the chain” then it is referred as
Correct : B. Chained allocation
74. In secondary storage management, bit table,
for each block on disk a vector contains
Correct : A. One bit each block
75. In bit table used for Free space management in secondary storage
Correct : A. Bit zero corresponds to free block
76. The amount of memory (in bytes) required for a block bitmap is
Correct : B. Disk size/ (8 × file system block size)
77. In 16 G byte disk with 512-bit block, the bit table requires
Correct : D. 4 M bytes.
78. Application Programming Interface is
Correct : A. A set of function and call programs that allows clients and servers to intercommunicate.
79. If in a computer networking environment when all the processing is done on single computer can be referred as
Correct : A. Host based processing
80. In three tier client/server architecture application software match the following: A- User machine, 1-Client, B- Middle-tier, 2- Application server, C- Backend server, 3 Data servers.
Correct : A. A – 1, B – 2, C – 3
81. UNIX was developed by
Correct : A. Bell Labs for PDP-7 in 1970
82. UNIX is a
Correct : A. Operating system
83. In UNIX process management, the system process runs in
Correct : A. Kernel mode only
84. In UNIX process management, the user processes runs in
Correct : B. Kernel and user mode both
85. In UNIX process management, the following is true
Correct : A. User process enters kernel mode by issuing a system call when interrupt occurs.
86. The number of process states recognized by UNIX
Correct : B. Nine
87. In process management of UNIX system, which of the following process states are running states in respect of whether the process is executing in user or kernel mode
Correct : D. A and C are true
88. A task in a blocked state is
Correct : B. Waiting for some temporarily unavailable resource
89. Semaphores
Correct : C. synchronize critical resources to prevent deadlock.
90. Priorities
Correct : A. are used to schedule processes
91. Dijkstra’s banker’s algorithm in an operating-system solves the problem of
Correct : A. deadlock avoidance
92. Which structure prohibits the sharing of files and directories
Correct : D. none of these
93. With round-robin CPU scheduling in a time shared system
Correct : A. using very large time slices degenerates into First-Come First Served Algorithm
94. The portion of the process scheduler in an operating system that dispatches processes is concerned with
Correct : C. assigning ready processes to the CPU
95. Following is the correct definition of a valid process transition within an operating system
Correct : B. dispatch: ready – running
96. I/O redirection
Correct : B. can be employed to use an exiting file as input file for a program
97. When an interrupt occurs, an operating system
Correct : D. may change state of interrupted process to blocked and schedule another process
98. Thrashing
Correct : C. implies excessive page I/O
99. Dirty bit for a page in a page table
Correct : A. helps avoid unnecessary writes on a paging device
100. A set of resources allocations such that the system can allocate resources to each process is some order, and still avoid a dead lock is called