MCQs ON DSA
1. Virtual memory is:
An extremely large main memory
An extremely large secondary memory
An illusion of an extremely large main memory
A type of memory used in supercomputers
2. Spatial locality refers to the phenomenon that once a location is referenced:
It will not be referenced again
It will be referenced again
A nearby location will be referenced soon
None of the above
3. Which of the following is an example of a SPOOLED device?
The terminal used to enter the input data for a program being executed
The secondary memory device in a virtual memory system
A line printer used to print the output of a number of jobs
None of the above
4. Page fault occurs when:
The page is in main memory
The page is not in main memory
The page is corrupted by application software
One tries to divide a number by 10
5. Overlay is:
A part of an operating system
A specific memory location
A single contiguous memory that was used in the olden days for running large programs by swapping
Overloading the system with many user files
6. Determine the number of page faults when reference to pages occurs in the order 1,2,3,4,5,2,1,2,4. Assume that the main memory can accommodate 3 pages and the main memory already has the pages 1 and 2, with page 1 having been brought earlier than page 2 (assume LRU algorithm is used).
3
4
5
None of the above
7. Concurrent processes are processes that:
Do not overlap in time
Overlap in time
Are executed by a processor at the same time
None of the above
8. The page replacement policy that sometimes leads to more page faults when the size of the memory is increased is:
FIFO
No such policy exists
LRU
None of the above
9. The only state transition that is initiated by the user process itself is:
Block
Wake up
Dispatch
None of the above
10. Working set (t, k) at an instant of time, t, is the set of:
K future references that the operating system will make
Future references that the operating system will make in the next ‘k’ time units
K references with high frequency
Pages that have been referenced in the last k time units
11. Fragmentation is:
Dividing the secondary memory into equal-sized fragments
Dividing the main memory into equal-sized fragments
Fragments of memory words used in a page
Fragments of memory words unused in a page
12. Which of the following are real-time systems?
A process control system
Aircraft control system
An on-line railway reservation system
Both (B) and (C)
13. Dijkstra’s banking algorithm in an operating system solves the problem of:
Deadlock avoidance
Mutual exclusion
Deadlock recovery
Context switching
14. In page memory systems, if the page size is increased, then the internal fragmentation generally:
Becomes less
Remains constant
Becomes more
None of the above
15. An operating system contains 3 user processes each requiring 2 units of resource R. The minimum number of units of R such that no deadlock will ever occur is:
3
5
4
6
16. Critical region is:
A part of the operating system which is not allowed to be accessed by any process
A set of instructions that access common shared resource which exclude one another in time
The portion of the main memory which can be accessed only by one process at a time
None of the above
17. Kernel is:
Considered as the critical part of the operating system
The software which monitors the operating system
The set of primitive functions upon which the rest of operating system functions are built up
None of the above
18. With a single resource, deadlock occurs:
If there are more than two processes competing for that resource
If there are only two processes competing for that resource
If there is a single process competing for that resource
None of the above
19. Necessary conditions for deadlock are:
Non-preemption and circular wait
Both (A) and (B)
Mutual exclusion and partial allocation
None of the above
20. In time-sharing operating systems, when the time slot given to a process is completed, the process goes from the RUNNING state to the:
BLOCKED State
SUSPENDED state
READY state
TERMINATED state
21. At a particular time, the value of a counting semaphore is 10. It will become 7 after:
3 V operations
5 V operations and 2 P operations
3 P operations
13 P operations and 10 V operations
22. Supervisor call:
Is a call made by the supervisor of the system
Is a call with control functions
Are privileged calls that are used to perform resource management functions, which are controlled by the operating system
Is a call made by someone working in the root directory
23. Semaphores are used to solve the problem of:
Race condition
Mutual exclusion
Process synchronization
Both (B) and (C)
24. If the property of locality of reference is well pronounced in a program:
The number of page faults will be more
The number of page faults will be less
Execution will be faster
Both (B) and (C)
25. At a particular time of computation, the value of a counting semaphore is 7. Then 20 P operations and ‘x’ V operations were completed on this semaphore. If the final value of the semaphore is 5, x will be:
15
18
22
13
26. Pre-emptive scheduling is the strategy of temporarily suspending a running process:
Before the CPU time slice expires
When it requests I/O
To allow starving processes to run
None of the above
27. Mutual exclusion problem occurs:
Between two disjoint processes that do not interact
Among processes that share resources
Among processes that do not use the same resource
None of the above
28. Sector interleaving in disks is done by:
The disk manufacturer
The operating system
The disk controller cord
None of the above
29. Memory protection is of no use in a:
Single-user system
Non-multitasking system
Non-multiprogramming system
None of the above
30. Some computer systems support dual-mode operation—the user mode and the supervisor or monitor mode. These refer to the modes:
By which user programs handle their data
By which the operating system executes user programs
In which the processor and the associated hardware operate
Of memory access
31. Disk scheduling involves deciding:
Which disk should be accessed next
The order in which disk access requests must be serviced
The physical location where files should be accessed in the disk
None of the above
32. A computer system has 6 tape drives, with ‘n’ processes competing for them. Each process may need 3 tape drives. The maximum value of ‘n’ for which the system is guaranteed to be deadlock-free is:
2
4
3
1
33. Dirty bit is used to show the:
Page with corrupted data
Wrong page in the memory
Page that is modified after being loaded into cache memory
Page that is less frequently accessed
34. Fence register is used for:
CPU protection
File protection
Memory protection
All of the above
35. Which of the following is a service not supported by the operating system?
Protection
Compilation
Accounting
I/O operation
36. The first-fit, best-fit, and worst-fit algorithms can be used for:
Contiguous allocation of memory
Indexed allocation of memory
Linked allocation of memory
All of the above
37. Which of the following is a single-user operating system?
MS-DOS
XENIX
UNIX
Both (A) and (C)
38. In Round Robin CPU scheduling, as the time quantum is increased, the average turnaround time:
Increases
Remains constant
Decreases
Varies irregularly
39. In a multiprogramming environment:
The processor executes more than one process at a time
The programs are developed by more than one person
More than one process resides in the memory
A single user can execute many programs at the same time
40. Which of the following are true?
A re-entrant procedure can be called any number of times
A re-entrant procedure can be called even before the procedure has not returned from its previous call
Re-entrant procedures cannot be called recursively
Re-entrant procedures can be called recursively
41. In a paged memory, the page hit ratio is 0.35. The time required to access a page in secondary memory is equal to 100ns. The time required to access a page in primary memory is 10ns. The average time required to access a page is:
3.0 ns
68.0 ns
68.5 ns
78.5 ns
42. A state is safe if the system can allocate resources to each process (up to its maximum) in some order and still avoid deadlock. Which of the following are true?
Deadlock state is unsafe
Unsafe state may lead to a deadlock situation
Unsafe state must lead to a deadlock, deadlock state is a subset of unsafe state
All of the above
43. The size of the virtual memory depends on the size of the:
Data bus
Address bus
Main memory
None of the above
44. In a multi-user operating system, 20 requests are made to use a particular resource per hour, on average. The probability that no requests are made in 45 minutes is:
45. In which of the following scheduling policies does context switching never take place?
Round-robin
First come first serve
Shortest job first
Both (B) and (C)
46. In which of the following directory systems, it is possible to have multiple complete paths for a file, starting from the root directory?
Single level directory
Tree structural directory
Two level directory
Acyclic graph
47. Suppose that a process is in ‘BLOCKED’ state waiting for some I/O service. When the service is completed, it goes to the:
RUNNING state
SUSPENDED state
READY state
TERMINATED state
48. In a system that does not support swapping:
The compiler normally binds symbolic addresses (variables) to relocate addresses
The compiler normally binds symbolic addresses to physical addresses
The loader binds relocatable addresses to physical addresses
All of the above
49. To obtain better memory utilization, dynamic loading is used. With dynamic loading, a routine is not loaded until it is called. For implementing dynamic loading:
Special support from hardware is essential
Special support from the operating system is essential
Special support from both hardware and operating system are essential
User programs can implement dynamic loading without any special support from the operating system or hardware
50. Which of the following is true?
The linkage editor is used to edit programs which have to be later linked together
The linkage editor links object modules during compiling or assembling
The linkage editor links object modules and resolves external references between them before loading
The linkage editor resolves external references between the object modules during execution time
51. Which of the following is true?
Overlays are used to increase the size of physical memory
Overlays are used to increase the logical address space
When overlays are used, the size of a process is not limited to the size of physical memory
Overlays are used whenever the physical address space is smaller than the logical address space
52. In partitioned memory allocation scheme:
Best-fit algorithm is always better than the first-fit algorithm
First-fit algorithm is always better than the best-fit algorithm
Superiority of the first-fit and best-fit algorithms depends on the sequence of memory requests
None of the above
53. Cascading termination refers to the termination of all child processes before the parent terminates:
Normally
Normally or abnormally
Abnormally
None of the above
54. For implementing a multiprogramming operating system:
Special support from the processor is essential
Special support from the processor is not essential
Cache memory must be available
More than one processor must be available
55. Consider a system having ‘m’ resources of the same type. These resources are shared by 3 processes A, B, C, which have time demands of 3, 4, 6 respectively. The minimum value of ‘m’ that ensures that deadlock will never occur is:
11
12
13
14
56. A system has 3 processes sharing 4 resources. If each process needs a maximum of 2 units, then deadlock:
Can never occur
Has to occur
May occur
None of the above
57. ‘m’ processes share ‘n’ resources of the same type. The maximum need of each process does not exceed ‘n’, and the sum of all their maximum needs is always less than . In this setup, deadlock:
Can never occur
Has to occur
May occur
None of the above
58. A process refers to 5 pages, A, B, C, D, and E, in the order: A; B; C; D; A; E; B; C; D; E. If the page replacement algorithm is FIFO, the number of page faults with an empty internal store of 3 frames is:
8
10
9
7
59. Distributed systems should:
Meet prescribed time constraints
Aim for better system utilization
Aim for better resource sharing
Aim for low system overhead
60. The main function of shared memory is:
Use primary memory efficiently
Do inter-process communication
Do intra-process communication
None of the above
61. Which of the following is the most suitable scheduling scheme in a real-time operating system?
Round-robin
Pre-emptive scheduling
First-come-first-serve
Random scheduling
62. ‘Aging’ is:
Keeping track of cache contents
Keeping track of what pages are currently residing in the memory
Keeping track of how many times a given page is referenced
Increasing the priority of jobs to ensure termination in a finite time
63. If there are 32 segments, each of size 1 Kbytes, then the logical address should have:
13 bits
14 bits
15 bits
16 bits
64. Disk requests come to a disk driver for cylinders in the order 10, 22, 20, 2, 40, 6, and 38 at a time when a disk drive is reading from cylinder 20. The seek time is 6 ms per cylinder. The total seek time, if the disk arm scheduling algorithm is first-come-first-served, is:
360 ms
850 ms
900 ms
None of the above
65. A certain moving arm disk storage with one head has the following specifications:
Number of tracks/recording surface = 200
Disk rotation speed = 2400 rpm
Track storage capacity = 62500 bits The average latency time (assume that the head can move from one track to another only by traversing the entire track) is:
2.5 s
2.9 s
3.1 s
3.6 s
66. Memory protection is normally done by the:
Operating system
Compiler
Processor and the associated hardware
User program
67. Which of the following scheduling algorithms gives the minimum average waiting time?
FCFS
SJF
Round-robin
Priority
68. In a paged segmented scheme of memory management, the segment table itself must have a page table because:
The segment table is often too large to fit in one page
Each segment is spread over a number of pages
Segment tables point to page tables and not to the physical location of the segment
The processor’s description base register points to a page table
69. Which of the following page replacement algorithms suffers from Belady’s anomaly?
Optimal replacement
FIFO
LRU
Both optimal replacement and FIFO
70. Which of the following scheduling policies is well suited for a time-shared operating system?
Shortest job first
First come first serve
Round robin
Elevator
71. The address sequence generated by tracing a particular program executing in a pure demand paging system with 100 records per page, with 1 free main memory frame is recorded as follows. What is the number of page faults?
0100, 0200, 0430, 0499, 0510, 0530, 0560, 0120, 0220, 0240, 0260, 0320, 0370.
13
8
7
10
72. A computer system has 4 K word cache organized in a block-set-associative manner, with 4 blocks per set, 64 words per block. The number of bits in SET and WORD fields of the main memory address format is:
14, 4
6, 4
7, 2
4, 6
73. A memory page containing a heavily used variable that was initialized very early and is in constant use is removed when the page replacement algorithm is used:
LRU
FIFO
LFU
None of the above
74. A demand paging system, with the page table held in registers, takes 5 ms to service a page fault if an empty page is available, or if the page to be replaced is not dirty. It takes 15 ms if the replaced page is dirty. Memory access time is 1 microsecond. Assume we want an effective access time of 2 microseconds and that the page to be replaced is dirty 60% of the time. What is the approximate maximum acceptable page fault rate to meet this access time requirement?
0.1%
1.0%
2.5%
0.01%
75. Memory protection is normally done by the:
Operating system
Compiler
Processor and the associated hardware
User program
76. Which of the following scheduling algorithms gives the minimum average waiting time?
FCFS
SJF
Round-robin
Priority
77. In a paged segmented scheme of memory management, the segment table itself must have a page table because:
The segment table is often too large to fit in one page
Each segment is spread over a number of pages
Segment tables point to page tables and not to the physical location of the segment
The processor’s description base register points to a page table
78. Which of the following page replacement algorithms suffers from Belady’s anomaly?
Optimal replacement
FIFO
LRU
Both optimal replacement and FIFO
79. Which of the following scheduling policies is well suited for a time-shared operating system?
Shortest job first
First come first serve
Round robin
Elevator
80. The address sequence generated by tracing a particular program executing in a pure demand paging system with 100 records per page, with 1 free main memory frame is recorded as follows. What is the number of page faults?
0100, 0200, 0430, 0499, 0510, 0530, 0560, 0120, 0220, 0240, 0260, 0320, 0370.
13
8
7
10
81. A computer system has 4 K word cache organized in a block-set-associative manner, with 4 blocks per set, 64 words per block. The number of bits in SET and WORD fields of the main memory address format is:
14, 4
6, 4
7, 2
4, 6
82. A memory page containing a heavily used variable that was initialized very early and is in constant use is removed when the page replacement algorithm is used:
LRU
FIFO
LFU
None of the above
83. A demand paging system, with the page table held in registers, takes 5 ms to service a page fault if an empty page is available, or if the page to be replaced is not dirty. It takes 15 ms if the replaced page is dirty. Memory access time is 1 microsecond. Assume we want an effective access time of 2 microseconds and that the page to be replaced is dirty 60% of the time. What is the approximate maximum acceptable page fault rate to meet this access time requirement?
0.1%
1.0%
2.5%
0.01%
84. Trojan-Horse programs:
Are legitimate programs that allow unauthorized access
Do not usually work
Are hidden programs that do not show up on the system
Usually are immediately discovered
85. Page stealing:
Is a sign of an efficient system
Is taking page frames from other working sets
Should be the tuning goal
Is taking larger disk spaces for pages paged out
86. In virtual memory systems, Dynamic address translation:
Is the hardware necessary to implement paging
Stores pages at a specific location on disk
Is useless when swapping is used
Is part of the operating system paging algorithm
87. The garbage collector:
Prevents fragmentation from occurring
Is mostly used with fixed partitions
Collects fragmented areas of memory
Is critical for efficient virtual memory system
88. Page-map table is:
A data file
Used for address translation
A directory
All of the above
89. Which of the following rules out the use of GO TO?
Flowchart
Nassi-Shneiderman diagram
HIPO-DIAGRAMS
All of the above
90. Which of the following is a phase of a compilation process?
Lexical analysis
Both of the above
Code generation
Static analysis
91. A computer cannot “boot” if it does not have the:
Computer
Operating system
Loader
Assembler
92. Which of the following is a measure to test how good or bad a modular design is:
Module strength
Static analysis
Module coupling
All of the above
93. Which of the following types of software must you have in main memory in order to use your keyboard?
Word processing
Applications
Systems
Spreadsheet
94. If you want to execute more than one program at a time, the system software you are using must be capable of:
Word processing
Compiling
Virtual memory
Multitasking
95. Which of the following is a type of systems software used on microcomputers?
Apple DOS
PC-DOS
MS-DOS
All of the above
96. Which of the following is helpful in evaluating applications software that will best suit your needs?
Recommendations by other users
Objective software reviews
Computer magazines
All of the above
97. Which of the following are loaded into main memory when the computer is booted?
Internal command instructions
Utility programs
External command instructions
Word processing instructions
98. Which of the following software types is used to simplify using systems software?
Spreadsheet
Time sharing
Operating environment
Multitasking
99. Which of the following is not applications software?
Word processing
UNIX
Spreadsheet
Desktop publishing
100. Which of the following types of software should you use if you often need to create, edit, and print documents?
Word processing
UNIX
Spreadsheet
Desktop publishing
101. Multiprogramming was made possible by:
Input/output units that operate independently of the CPU
Operating systems
Both (A) and (B)
Neither (A) nor (B)
102. A translator which reads an entire program written in a high-level language and converts it into machine language code is:
Assembler
Compiler
Translator
System software
103. What is the name given to all the programs inside the computer which make it usable?
Application software
Firmware
System software
Shareware
104. Systems software is a program that directs the overall operation of the computer, facilitates its use, and interacts with all users. What are the different types of this software?
Operating system
Utilities
Language translators
All of the above
105. What is the name of the system which deals with the running of the actual computer and not with the programming problems?
Operating system
Object program
System program
Source program
106. Which of the following systems software does the job of merging the records from two files into one?
Security software
Networking software
Utility program
Documentation system
107. The term “operating system” means:
A set of programs which controls computer working
The way a computer operator works
Conversion of high-level language into machine code
The way a floppy disk drive operates
108. The operating system of a computer serves as a software interface between the user and:
Hardware
Memory
Peripheral
Screen
109. The primary job of the operating system of a computer is to:
Command resources
Provide utilities
Manage resources
Be user-friendly
110. All the time a computer is switched on, its operating system software has to stay in:
Main storage
Floppy disk
Primary storage
Disk drive
111. What is the name given to software which can be legally compiled and often used for free?
Shareware program
Firmware program
Public domain program
Mindware
112. What is the operating system used by Macintosh computers?
System 7.0
XENIX
AU/X
Either (A) or (B)
113. Who is called the overseer and supervisor of all computer activity?
Central processing unit
Control unit
Operating system
Application program
114. Can you name the major operating systems used in computers?
MS-DOS
UNIX
OS/2
All of the above
115. Who developed the operating system/2 (OS/2) for running IBM’s new PS/2 family of microcomputers?
IBM
Bell Laboratories
Microsoft Inc.
Digital Research Corporation
116. Most of the microcomputer’s operating systems like Apple DOS, MS DOS, and PC DOS are called disk operating systems because:
They are memory resident
They are initially stored on disk
They are available on magnetic tapes
They are partly in primary memory and partly on disk
117. What is the name given to the process of initializing a microcomputer with its operating system?
Cold booting
Warm booting
Booting
Boot recording
118. What is the name of the operating system which was originally designed by scientists and engineers for use by scientists and engineers?
XENIX
OS/2
UNIX
MS DOS
119. What are the most important features of Microsoft Windows program?
Windows
Icons
Pull-down menus
All of the above
120. What is the name given to the organized collection of software that controls the overall operation of a computer?
Working system
Operating system
Peripheral system
Controlling system
121. What is the name given to the values that are automatically provided by software to reduce keystrokes and improve a computer user’s productivity?
Defined values
Default values
Fixed values
Special values
122. The powerful text editor called PC-Writer can be used by anybody by paying a small fee. Such programs are called:
Software
Firmware
Shareware
Mindware
123. What is the name of the operating system that reads and reacts in terms of actual time?
Batch system
Real-time system
Quick response system
Time-sharing system
124. 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?
Partitioning
Windowing
Multitasking
Paging
125. When did IBM release the first version of its disk operating system DOS version 1.0?
1981
1982
1983
1984
126. IBM released its first PC in 1981. Can you name the operating system which was most popular at that time?
MS-DOS
PC-DOS
OS/360
CP/M
127. The mathematics software allows the users to directly write and solve problems in arithmetic, trigonometry, algebra, etc. Can you name the person who created this software?
Thomas Abraham
Yuri Manin
Steve Jobs
Stephen Wolfram
128. The higher version of the operating systems are so written that programs designed for earlier versions can still be run. What is it called?
Upgradability
Universality
Upward mobility
Upward compatibility
129. What is the name of the arrangement whereby several central processing units share one memory?
Multitasking
Multiprocessing
Multiprogramming
Concurrent programming
130. A graphical-menu-driven operating system allows you to pick up from the menu of choices it displays on the screen. What is the name given to the images which are used in such image-oriented menus?
Figure
Symbol
Icon
Model
131. With reference to Windows, a DLL is:
Distribution level library
Dedicated link library
Dynamic link library
Distributed library LAN
132. Windows is a(n):
Operating system
Operating environment
User interface
Programming platform
133. Microcomputer operating systems are generally:
Copy protected
Not loaded into the ROM by hardware manufacturers
Easily available in the market
All of the above
134. The part of the computer system which performs the housekeeping functions is called:
Interpreter
Operating system
Compiler
Assembler
135. An operating system designed to run on only one family of computers is called:
PC-DOS
Disk operating system
CP/M
Proprietary operating system
136. An operating system:
Is not required on large computers
Is always supplied with the computer
Is always written in BASIC
Consists of programs that help in the operation of the computer
137. The relationship between operating system software and application software is that:
Application software and operating system work independently
Operating system monitors application software
Application software and operating system work together
Application software monitors the operating system
138. A proprietary operating system can run on machines made by:
Different vendors
IBM only
A specific vendor
None of the above
139. The most popular 16-bit operating system is:
CP/M
MS-DOS
UNIX
TRS-DOS
140. DOS is:
A software
A data organization system
A hardware
None of the above
141. A computer program written into a storage medium from which it cannot be accidentally erased is called:
Software
Firmware
Operating system
ROM
142. The first popular microcomputer operating system developed around 1974 is:
PC-DOS
Apple-DOS
MS-DOS
CP/M
143. A microcomputer operating system which is popular with computer professionals and which can support multitasking is:
MS-DOS
UNIX
CP/M
OS
144. The two most popular operating systems for 8- and 16-bit personal computers are:
CP/M and CP/M-80
MS-DOS and PC-DOS
CP/M-80 and MS-DOS
MS-DOS and UNIX
145. UNIX operating system:
Is multi-user
Is multitasking
Can run on PCs and larger systems
All of the above
146. An operating system for a large computer is:
Developed by the actual user
Developed by the buyer
Always supplied by the computer supplier
Supplied by software vendors
147. Which of the following is not an operating system?
UNIX
MS-DOS
PASCAL
CP/M
148. XENIX can be used only with:
IBM-PCs
Supercomputers
IBM-PC/XTs
IBM-PC/ATs
149. The application package is used to:
Meet specific needs of a user
Run the computer system better
Run the compiler smoothly
Enable the operating system to control hardware better
150. The part of the computer system which performs the housekeeping functions is called:
Interpreter
Operating system
Compiler
Assembler
151. A computer program written in a high-level language is called a:
Source program
Machine language program
Object program
None of the above
152. A compiler can diagnose:
Grammatical errors only
Logical errors only
Grammatical as well as logical errors
Neither grammatical nor logical errors
153. Compilers are generally written by:
Computer manufacturers
Professional programmers
Computer users
System analysts
154. A programmer, by mistake, writes an instruction to divide instead of multiply. Such an error can be detected by a/an:
Compiler
Compiler or interpreter both
Interpreter
Neither compiler nor interpreter
155. Which is not true about ‘syntax’ and ‘semantics’ parts of a computer language?
Syntax is generally checked by the programmer
Semantics is the responsibility of the programmer
Semantics is checked mechanically by a computer
Both (B) and (C)
156. A series of statements explaining how the data is to be processed is called:
Instruction
Program
Compiler
Interpreter
157. The computer language generally translated to pseudo code is:
Assembly
Pascal
Machine
PL/I
158. Application programs used with microcomputers are generally written by:
The users themselves
Hardware suppliers
A team of experts known as ‘third parties’
IBM
159. What is true about machine language?
It is understood by the computer
It varies from one model of computer to another
It may always be represented by binary numbers
All of the above are true
160. Object program is:
A program written in machine language
A program to be translated into machine language
The translation of a high-level language into machine language
None of the above
161. What is true about assembly language?
It uses symbolic codes
It does not vary from one type of computer to another
It uses binary numbers
None of the above
162. The process of transferring data intended for a peripheral device into a disk (or intermediate store) so that it can be transferred to the peripheral at a more convenient time or in bulk is known as:
Multiprogramming
Caching
Spooling
Virtual programming
163. A form of code that uses more than one process and processor, possibly of different types, and that may on occasion have more than one process or processor active at the same time is known as:
Multiprogramming
Broadcasting
Multithreading
Time sharing
164. Situations where two or more processes are reading or writing some shared data and the final result depends on who runs precisely when are called:
Race conditions
Mutual exclusion
Critical sections
Message passing
165. Part of a program where the shared memory is accessed and which should be executed indivisibly is called:
Semaphores
Critical section
Directory
Mutual exclusion
166. A relationship between processes such that each has some part (critical section) which must not be executed while the critical section of another is being executed is known as:
Semaphore
Multiprogramming
Mutual exclusion
Multitasking
167. Which of the following operating systems use write-through caches?
UNIX
ULTRIX
DOS
XENIX
168. A disk scheduling algorithm in an operating system causes the disk arm to move back and forth across the disk surface in order to service all requests in its path. This is a:
First come first served
SCAN
Shortest Seek Time First (SSTF)
Eschenbach scheme
169. A system program that sets up an executable program in main memory ready for execution is:
Assembler
Loader
Linker
Text editor
170. A compiler for a high-level language that runs on one machine and produces code for a different machine is called:
Optimizing compiler
Cross compiler
One-pass compiler
Multi-pass compiler
171. An instruction in a programming language that is replaced by a sequence of instructions prior to assembly or compiling is known as:
Procedure name
Label
Macro
Literal
172. Which of the following translator programs converts assembly language program to object program?
Assembler
Macro processor
Compiler
Linker
173. Which of the following system programs forgoes the production of object code to generate absolute machine code and load it into the physical main storage location from which it will be executed immediately upon completion of the assembly?
Two-pass assembler
Microprocessor
Load-and-go assembler
Compiler
174. System programs such as compilers are designed so that they are:
Reentrant
Serially usable
Non-reusable
Recursive
175. Memory:
Is a device that performs a sequence of operations specified by instructions in memory
Is the device where information is stored
Is a sequence of instructions
Is typically characterized by interactive processing and time-slicing of the CPU’s time to allow quick response to each user
176. A program:
Is a device that performs a sequence of operations specified by instructions in memory
Is the device where information is stored
Is a sequence of instructions
Is typically characterized by interactive processing and time-slicing of the CPU’s time to allow quick response to each user
177. A processor:
Is a device that performs a sequence of operations specified by instructions in memory
Is the device where information is stored
Is a sequence of instructions
Is typically characterized by interactive processing and time-slicing of the CPU’s time to allow quick response to each user
178. An assembler is:
A program that places programs into memory and prepares them for execution
A program that automates the translation of assembly language into machine language
A program that accepts a program written in a high-level language and produces an object program
A program that appears to execute a source program as if it were machine language
179. An interpreter is:
A program that places programs into memory and prepares them for execution
A program that automates the translation of assembly language into machine language
A program that accepts a program written in a high-level language and produces an object program
A program that appears to execute a source program as if it were machine language
180. A compiler is:
A program that places programs into memory and prepares them for execution
A program that automates the translation of assembly language into machine language
A program that accepts a program written in a high-level language and produces an object program
A program that appears to execute a source program as if it were machine language
181. A loader is:
A program that places programs into memory and prepares them for execution
A program that automates the translation of assembly language into machine language
A program that accepts a program written in a high-level language and produces an object program
A program that appears to execute a source program as if it were machine language
182. Virtual Memory
Is a method of memory allocation by which the program is subdivided into equal portions, or pages, and core is subdivided into equal portions or blocks
Consists of those addresses that may be generated by a processor during execution of a computation
Is a method of allocating processor time
Allows multiple programs to reside in separate areas of core at the time
183. Paging
Is a method of memory allocation by which the program is subdivided into equal portions or pages and core is subdivided into equal portions or blocks
Consists of those addresses that may be generated by a processor during execution of a computation
Is a method of allocating processor time
Allows multiple programs to reside in separate areas of core at the time
184. Multiprogramming
Is a method of memory allocation by which the program is subdivided into equal portions or pages and core is subdivided into equal portions or blocks
Consists of those addresses that may be generated by a processor during execution of a computation
Is a method of allocating processor time
Allows multiple programs to reside in separate areas of core at the time
185. The Memory Buffer Register (MBR)
Is a hardware memory device which denotes the location of the current instruction being executed
Is a group of electrical circuits (hardware) that performs the intent of instructions fetched from memory
Contains the address of the memory location that is to be read from or stored into
Contains a copy of the designated memory location specified by the MAR after a “read” or the new contents of the memory prior to a “write”
186. The Memory Address Register (MAR)
Is a hardware memory device which denotes the location of the current instruction being executed
Is a group of electrical circuits (hardware) that performs the intent of instructions fetched from memory
Contains the address of the memory location that is to be read from or stored into
Contains a copy of the designated memory location specified by the MAR after a “read” or the new contents of the memory prior to a “write”
187. The Instruction Register (IR)
Is a hardware memory device which denotes the location of the current instruction being executed
Is a group of electrical circuits (hardware) that performs the intent of instructions fetched from memory
Contains the address of the memory location that is to be read from or stored into
Contains a copy of the designated memory location specified by the MAR after a “read” or the new contents of the memory prior to a “write”
188. Advantage(s) of using assembly language rather than machine language is (are):
It is mnemonic and easy to read
Addresses are symbolic, not absolute
Introduction of data to the program is easier
All of the above
189. Pass 1 of an assembler:
Assigns addresses to all statements in the program
Saves the values assigned to all labels for use in Pass 2
Performs some processing of assembler directives
All of the above
190. Pass 2 of an assembler:
Assembles instructions and generates data
Performs processing of assembler directives not done during Pass 1
Writes the object program and the assembly listing
All of the above
191. The System/370 assembler language:
Allows the programmer to write base registers and displacements explicitly in the source program
Is used to remember which of the general-purpose registers are currently available as base registers, and what base addresses they contain
Allows multiple programs to reside in separate areas of core at the same time
Is a term that refers to the control programs of an operating system
192. A base register table:
Allows the programmer to write base registers and displacements explicitly in the source program
Is used to remember which of the general-purpose registers are currently available as base registers, and what base addresses they contain
Allows multiple programs to reside in separate areas of core at the same time
Is a term that refers to the control programs of an operating system
193. Addressing structure:
Defines the fundamental method of determining effective operand addresses
Are variations in the use of fundamental addressing structures, or some associated actions which are related to addressing
Performs indicated operations on two fast registers of the machine and leaves the result in one of the registers
All of the above
194. Addressing modes:
Defines the fundamental method of determining effective operand addresses
Are variations in the use of fundamental addressing structures, or some associated actions which are related to addressing
Performs indicated operations on two fast registers of the machine and leaves the result in one of the registers
All of the above
195. The Register-to-Register (RR) instructions:
Have both their operands in the main store
Perform an operation on a register operand and an operand located in the main store, generally leaving the result in the register
Perform indicated operations on two fast registers of the machine and leave the result in one of the registers
All of the above
196. The Register-to-Storage (RS) instructions:
Have both their operands in the main store
Perform an operation on a register operand and an operand located in the main store, generally leaving the result in the register
Perform indicated operations on two fast registers of the machine and leave the result in one of the registers
All of the above
197. The Storage-to-Storage (SS) instructions:
Have both their operands in the main store
Perform an operation on a register operand and an operand located in the main store, generally leaving the result in the register
Perform indicated operations on two fast registers of the machine and leave the result in one of the registers
All of the above
198. Which of the following are Language Processors?
Assemblers
Interpreters
Compilers
All of the above
199. The specific tasks Storage Manager performs are:
Allocation/deallocation of storage to programs
Protection of the storage area allocated to a program from illegal access by other programs in the system
The status of each program
Both (A) and (B)
200. The process manager (or processor manager) has to keep track of:
The status of each program
The priority of each program
The information management support to a programmer using the system
Both (A) and (B)
201. The advantage(s) of incorporating the macro processor into Pass 1 is (are):
Many functions do not have to be implemented twice
Functions are combined and it is not necessary to create intermediate files as output from the macro processor and input to the assembler
More flexibility is available to the programmer in that he may use all the features of the assembler in conjunction with macros
All of the above
202. The macro processor must perform:
Recognize macro definitions and macro calls
Save the macro definitions
Expand macro calls and substitute arguments
All of the above
203. In which way(s) a macro processor for assembly language can be implemented:
Independent two-pass processor
Independent one-pass processor
Processor incorporated into Pass 1 of a standard two-pass assembler
All of the above
204. Which of the following functions is(are) performed by the loader?
Allocate space in memory for the programs and resolve symbolic references between object decks
Adjust all address-dependent locations, such as address constants, to correspond to the allocated space
Physically place the machine instructions and data into memory
All of the above
205. When a computer is first turned on or restarted, a special type of absolute loader is executed, called a:
“Compile and Go” loader
Bootstrap loader
Boot loader
Relating loader
206. In MS-DOS 5.0, which is the number that acts as a code to uniquely identify the software?
MS
DOS
MS DOS
5.0
207. The higher versions of the operating systems are so written that programs designed for earlier versions can still be run. What is it called?
Upgradability
Universality
Upward mobility
Upward compatibility
208. What is the name of the process of initializing a microcomputer with its operating system?
Cold booting
Warm booting
Booting
Root recording
209. A hardware device that is capable of executing a sequence of instructions is known as:
CPU
ALU
CU
Processor
210. The function(s) performed by the paging software is(are):
Implementation of the access environment for all programs in the system
Management of the physical address space
Sharing and protection
All of the above
211. The file level is a descriptor containing all the information which would be required:
To connect the file to a program
To guard against the destruction of the file inadvertently or deliberately by another program
To facilitate easy creation, storage, and access of files
Both (A) and (B)
212. The task(s) of the lexical analysis phase is(are):
To parse the source program into the language
To build a literal table and an identifier table
To build a uniform symbol table
All of the above
213. Which is a permanent database in the general model of a compiler?
Literal Table
Terminal Table
Identifier Table
Source code
214. Which table is a permanent database that has an entry for each terminal symbol?
Terminal Table
Identifier Table
Literal Table
Reductions
215. While running DOS on a PC, which command would be used to duplicate the entire diskette?
COPY
CHKDSK
DISKCOPY
TYPE
216. Which of the following filename extensions suggests that the file is a backup copy of another file?
TXT
COM
BAS
BAK
217. While working with MS-DOS, which command will you use to transfer a specific file from one disk to another?
DISKCOPY
RENAME
COPY
FORMAT
218. With MS-DOS, which command will divide the surface of the blank floppy disk into sectors and assign a unique address to each one?
FORMAT command
VER command
FAT command
CHKDSK command
219. The functions of the Storage Assignment is(are):
To assign storage to all variables referenced in the source program
To assign storage to all temporary locations that are necessary for intermediate results
To assign storage to literals, and to ensure that the storage is allocated and appropriate locations are initialized
All of the above
220. A non-relocatable program is one which:
Cannot be made to execute in any area of storage other than the one designated for it at the time of its coding or translation
Consists of a program and relevant information for its relocation
Can itself perform the relocation of its address-sensitive portions
All of the above
221. A relocatable program form is one which:
Cannot be made to execute in any area of storage other than the one designated for it at the time of its coding or translation
Consists of a program and relevant information for its relocation
Can itself perform the relocation of its address-sensitive portions
All of the above
222. A self-relocating program is one which:
Cannot be made to execute in any area of storage other than the one designated for it at the time of its coding or translation
Consists of a program and relevant information for its relocation
Can itself perform the relocation of its address-sensitive portions
All of the above
223. The term "operating system" means:
A set of programs which controls computer working
The way a computer operator works
Conversion of high-level language into machine code
The way a floppy disk drive operates
224. Which of the following software types is used to simplify using system software?
Spreadsheet
Timesharing
Operating environment
Multitasking
225. Which of the following is not applications software?
Word processing
UNIX
Spreadsheet
Desktop publishing
226. Which of the following types of software should you use if you often need to create, edit, and print documents?
Word processing
UNIX
Spreadsheet
Desktop publishing
227. Which of the following will determine your choice of systems software for your computer?
Is the applications software you want to use compatible with it?
Is it expensive?
Is it compatible with your hardware?
Both (A) and (C)
228. Terminal Table:
Contains all constants in the program
A permanent table of decision rules in the form of patterns for matching with the uniform symbol table to discover syntactic structure
Consists of a full or partial list of the token’s as they appear in the program. Created by lexical analysis and used for syntax analysis and interpretation
A permanent table which lists all key words and special symbols of the language in symbolic form
229. Assembly code database is associated with:
Assembly language version of the program which is created by the code generation phase and is input to the assembly phase
A permanent table of decision rules in the form of patterns for matching with the uniform symbol table to discover syntactic structure
Consists of a full or partial list of the token’s as they appear in the program. Created by lexical analysis and used for syntax analysis and interpretation
A permanent table which lists all key words and special symbols of the language in symbolic form
230. The table created by lexical analysis to describe all literals used in the source program is:
Terminal Table
Identifier Table
Literal Table
Reductions
231. The functions of the syntax phase are:
To recognize the major constructs of the language and to call the appropriate action routines that will generate the intermediate form or matrix for these constructs
To build a literal table and an identifier table
To build a uniform symbol table
To parse the source program into the basic elements or tokens of the language
232. In an absolute loading scheme, which loader function is accomplished by the assembler?
Reallocation
Linking
Allocation
Loading
233. In an absolute loading scheme, which loader function is accomplished by the loader?
Reallocation
Linking
Allocation
Loading
234. The advantages inherent to using high-level language are:
Fewer people, less management, and shorter transition in learning time
Improved debugging capability, and superior documentation
A greater degree of machine independence
All of the above
235. The action of parsing the source program into the proper syntactic classes is known as:
Syntax analysis
Interpretation
Lexical analysis
General syntax analysis
236. In analyzing the compilation of a PL/I program, the term “Lexical analysis” is associated with:
Recognition of basic syntactic constructs through reductions
Recognition of basic elements and creation of uniform symbols
Creation of more optional matrix
Use of macro processor to produce more optimal assembly code
237. In analyzing the compilation of a PL/I program, the term “Machine independent optimization” is associated with:
Recognition of basic syntactic constructs through reductions
Recognition of basic elements and creation of uniform symbols
Creation of more optional matrix
Use of macro processor to produce more optimal assembly code
238. In analyzing the compilation of a PL/I program, the description “resolving symbolic address (labels) and generating machine language” is associated with:
Assembly and output
Storage assignment
Code generation
Syntax analysis
239. In analyzing the compilation of a PL/I program, the description “creation of more optimal matrix” is associated with:
Assembly and output
Syntax analysis
Code generation
Machine independent optimization
240. Which of the following is not a part of the operating system?
Supervisor
Job-control program
Performance monitor
Input/output control program
241. Which of the following is not an advantage of multiprogramming?
Increased throughput
Shorter response time
Decreased operating system overhead
Ability to assign priorities to jobs
242. In which addressing mode the contents of a register specified in the instruction are first decremented, and then these contents are used as the effective address of the operands?
Index addressing
Auto increment
Indirect addressing
Auto decrement
243. In which addressing mode, the effective address of the operand is generated by adding a constant value to the contents of a register?
Absolute mode
Immediate mode
Indirect mode
Index mode
244. In what modules, multiple instances of execution will yield the same result even if one instance has not terminated before the next one has begun?
Non-reusable module
Reentrant module
Serially reusable module
Recursive module
245. What is the name given to all the programs inside the computer which makes it usable?
Application software
Firmware
System software
Shareware
246. A translator which reads an entire program written in a high-level language and converts it into machine language code is:
Assembler
Compiler
Translator
System software
247. Which of the following is helpful in evaluating applications software that will best suit your needs?
Recommendations by other users
Objective software reviews
Computer magazines
All of the above
248. If you want to execute more than one program at a time, the system software you are using must be capable of:
Word processing
Compiling
Virtual memory
Multitasking
249. Which of the following types of software must you have in main memory in order to use your keyboard?
Word processing
Spreadsheet
System
Applications
250. Which of the following might be used to convert high-level language instructions into machine language?
System software
An operating environment
Application software
An interpreter
251. Multiprogramming was made possible by:
Input/output units that operate independently of the CPU
Operating systems
Both (A) and (B)
Neither (A) nor (B)
252. What is the name of the system which deals with the running of the actual computer and not with the programming problems?
Operating system
Objective program
System program
Source program
253. Which of the following scheduling objectives should be applied to the following: the system should admit jobs to create a mix that will keep most devices busy?
To be fair
To obey priorities
To balance resource utilization
To be predictable
254. Which policy replaces a page if it is not in the favored subset of a process’s pages?
FIFO
LFU
LRU
Working set
255. In which of the storage placement strategies a program is placed in the smallest available hole in the main memory?
Best fit
Worst fit
First fit
Buddy
256. Which of the following statements is false?
Protection in segmentation systems is more natural than in paging systems
Sharing is more natural in segmentation systems than in paging systems
Associative memory speeds up the dynamic address translation
Every cell of the associative memory is searched sequentially
257. Can you name the major operating system used in computers?
MS DOS
UNIX
OS/2
All of the above
258. What is the name of the operating system which was originally designed by scientists and engineers for use by scientists and engineers?
XENIX
OS/2
UNIX
MS DOS
259. Which are the most important features of Microsoft Windows program?
Windows
Icons
Pull-down menus
All of the above
260. What is the name given to the organized collection of software that controls the overall operation of a computer?
Working system
Operating system
Peripheral system
Controlling system
261. What is the name given to the values that are automatically provided by software to reduce keystrokes and improve a computer user’s productivity?
Defined values
Default values
Fixed values
Special values
262. Producer-consumer problem can be solved using:
Semaphores
Monitors
Event counters
All of the above
263. Situations where two or more processes are reading or writing some shared data and the final result depends on who runs precisely when, are called:
Race conditions
Mutual exclusion
Critical sections
Message passing
264. A process is:
Program in high-level language kept on disk
Contents of main memory
A program in execution
A job in secondary memory
265. In which addressing mode the effective address of the operand is the contents of a register specified in the instruction and after accessing the operand, the contents of this register is incremented to point to the next item in the list?
Index addressing
Auto increment
Indirect addressing
Auto decrement
266. A relationship between processes such that each has some part (critical section) which must not be executed while the critical section of another is being executed, is known as:
Semaphore
Multiprogramming
Mutual exclusion
Multitasking
267. The process of transferring data intended for a peripheral device into a disk (or intermediate store) so that it can be transferred to the peripheral at a more convenient time or in bulk, is known as:
Multiprogramming
Caching
Spooling
Virtual programming
268. Which of the following statements is false?
A small page size causes large page tables
Internal fragmentation is increased with small pages
A large size causes instructions and data that will not be referenced to be brought into primary storage
I/O transfers are more efficient with large pages
269. The powerful text editor called PC-Write can be used by anybody by paying a small fee. Such programs are called:
Software
Firmware
Shareware
Mindware
270. What is the name of the operating system that reads and reacts in terms of actual time?
Batch system
Real-time system
Quick response system
Time-sharing system
271. 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?
Partitioning
Windowing
Multitasking
Paging
272. What is the name given to the software which can be legally compiled and often used for free?
Shareware program
Firmware program
Public domain program
Mindware
273. All the time a computer is switched on, its operating system software has to stay in:
Main storage
Floppy disk
Primary storage
Disk drive
274. A front-end processor is usually used in:
Multiprogramming
Timesharing
Virtual storage
Multiprocessing
275. The problem of thrashing is affected significantly by:
Program structure
Primary-storage size
Program size
All of the above
276. Two basic types of operating systems are:
Sequential and direct
Sequential and real-time
Batch and timesharing
Batch and interactive
277. Remote computing service involves the use of timesharing and:
Multiprocessing
Batch processing
Interactive processing
Real-time processing
278. Non-modifiable procedures are called:
Serially unusable procedures
Reentrant procedures
Concurrent procedures
Top-down procedures
279. An instruction in a programming language that is replaced by a sequence of instructions prior to assembly or compiling is known as:
Procedure name
Label
Macro
Literal
280. The main function of the dispatcher (the portion of the process scheduler) is:
Swapping a process to the disk
Assigning ready processes to the CPU
Suspending some of the processes when the CPU load is high
Bringing processes from the disk to the main memory
281. The primary job of the operating system of a computer is to:
Command resources
Provide utilities
Manage resources
Be user-friendly
282. The operating system of a computer serves as a software interface between the user and:
Hardware
Memory
Peripheral
Screen
283. Which of the following operating systems use write-through caches?
UNIX
ULTRIX
DOS
XENIX
284. A system program that combines the separately compiled modules of a program into a form suitable for execution is:
Assembler
Cross compiler
Linking loader
Load and go
285. What problem is solved by Dijkstra’s banker’s algorithm?
Mutual exclusion
Deadlock avoidance
Deadlock recovery
Cache coherence
286. A compiler for a high-level language that runs on one machine and produces code for a different machine is called:
Optimizing compiler
Cross compiler
One-pass compiler
Multi-pass compiler
287. Banker’s algorithm for resource allocation deals with:
Deadlock prevention
Deadlock recovery
Deadlock avoidance
Mutual exclusion
288. To avoid race conditions, the maximum number of processes that may be simultaneously inside the critical section is:
Hundred
One
Two
Three
289. Daisy chain is a device for:
Connecting a number of controllers to a device
Connecting a number of devices to a controller
Interconnecting a number of devices to a number of controllers
All of the above
290. Scissoring enables:
A part of data to be displayed
Entire data to be displayed
Full data displayed
No data to be displayed
291. Information in memory that is no longer valid or wanted is known as:
Non-volatile
Surplus
Volatile
Garbage
292. Which of the following is a type of systems software used on microcomputers?
MS-DOS
Unix
PC-DOS
All of the above
293. Which of the following are loaded into main memory when the computer is booted?
Internal command instructions
External command instructions
Utility programs
Word processing instructions
294. What is the name of the operating system for the laptop computer called MacLife?
Windows
MS-DOS
DOS
OZ
295. What is the operating system used by Macintosh computers?
System 7.0
Unix
AU/X
Either A or B
296. Who developed the operating system/2 (OS/2) for running IBM’s new PS/2 family of microcomputers?
IBM
Bell Laboratories
Microsoft Inc.
Digital Research Corporation
297. In which addressing mode the operand is given explicitly in the instruction?
Absolute mode
Indirect mode
Immediate mode
Index mode
298. Which of the following programs is not a utility?
Debugger
Spooler
Editor
All of the above
299. Job Control Language (JCL) statements are used to:
Read the input from the slow-speed magnetic disk
Specify to the operating system, the beginning and end of a job in a batch
Allocate the CPU to a job
All of the above
300. Operating system is:
A collection of hardware components
A collection of input-output devices
A collection of software routines
All of the above
301. Most of the microcomputer’s operating systems like Apple DOS, MS DOS, and PC DOS, etc., are called disk operating systems because:
They are memory resident
They are initially stored on disk
They are available on magnetic tapes
They are partly in primary memory and partly on disk
302. When did IBM release the first version of the disk operating system DOS version 1.0?
1981
1983
1982
1984
303. IBM released its first PC in 1981. Can you name the operating system which was most popular at that time?
MS-DOS
OS/360
PC-DOS
CP/M
304. Page fault frequency in an operating system is reduced when the:
Size of pages is reduced
Processes tend to be I/O-bound
Processes tend to be CPU-bound
Locality of reference is applicable to the process
305. Which of the following is true for testing and debugging?
Testing checks for logical errors in the programs while debugging is a process of correcting those errors in the programs
Testing detects the syntax errors in the program while debugging corrects those errors in the program
Testing and debugging indicate the same thing
All of the above
306. If special forms are needed for printing the output, the programmer specifies these forms through:
JCL
Utility program
IPL
Load modules
307. Under multiprogramming, turnaround time for short jobs is usually...... and for long jobs is slightly......
Lengthened; shortened
Shortened; shortened
Shortened; lengthened
Lengthened; lengthened
308. The state transition initiated by the user process itself in an operating system is:
Block
Wake up
Dispatch
Timer run out
309. Which of the following terms refers to the degree to which data in a database system are accurate and correct?
Data security
Data independence
Data validity
Data integrity
310. The total time to prepare a disk drive mechanism for a block of data to be read from it is:
Latency
Latency plus transmission time
Latency plus seek time
Latency plus seek time plus transmission time
311. Indicate whether the statement LDA B is a statement in:
Machine language
High-level language
Assembly language
All of the above
312. Indicate which describes the term “software”:
Systems programs only
Both A and B
Application programs only
All of the printer
313. Bug means:
A logical error in a program
A difficult syntax error in a program
Documenting programs using an efficient documentation tool
All of the above
314. A development strategy whereby the executive control modules of a system are coded and tested first is known as:
Bottom-up development
Left-Right development
Top-down development
All of the above
315. Indicate which, of the following, is not true about Nassi-Shneiderman charts:
These charts are a type of graphical design tool
These charts cannot represent CASE constructs
These charts can represent three fundamental control structures
All of the above
316. Indicate which, of the following, is not true about a data flow diagram (DFD):
It is a graphical representation of the flow of data through the system
It is used to analyze any system or software at any level of abstraction
It is a very important tool, used by system analysts and designers
All of the above
317. Which of the following checks cannot be carried out on the input data to a system?
Consistency check
Range checks
Syntax check
All of the above
318. Which of the following is not true about documentation?
Documentation of a system should be as clear and direct as possible
Documentation increases the maintenance time and cost
Documentation gives a better understanding of the problem
All of the above
319. C is:
An assembly language
A third-generation high-level language
A machine language
All of the above
320. Which of the following modules does not incorporate initialization of values changed by the module?
Non-reusable module
Reentrant module
Serially reusable module
All of the above
321. Which of the following statements is false?
A process scheduling algorithm is preemptive if the CPU can be forcibly removed from a process
Time-sharing systems generally use preemptive CPU scheduling
Response times are more predictable in preemptive systems than in non-preemptive systems
Real-time systems generally use non-preemptive CPU scheduling
322. Indicate which, of the following, is not true about an interpreter:
Interpreter generates an object program from the source program
Interpreter is a kind of translator
Interpreter analyzes each source statement every time it is to be executed
All of the above
323. Indicate which, of the following, is not true about 4GL:
4GL does not support a high level of screen interaction
Many database management system packages support 4GL
A 4GL is a software tool which is written possibly in some third-generation language
All of the above
324. An algorithm is described as:
A computer language
A step-by-step procedure for solving a problem
A branch of mathematics
All of the above
325. A sequence of instructions, in a computer language, to get the desired result is known as:
Algorithm
Program
Decision table
All of the above
326. The strategy of allowing processes that are logically runnable to be temporarily suspended is called:
Preemptive scheduling
Shortest job first
Non-preemptive scheduling
First come first served
327. Part of a program where the shared memory is accessed and which should be executed indivisibly is called:
Semaphores
Critical section
Directory
Mutual exclusion
328. The technique, for sharing the time of a computer among several jobs, which switches jobs so rapidly such that each job appears to have the computer to itself is:
Time sharing
Time domain
Time out
FIFO
329. The operating system manages:
Memory
Disks and I/O devices
Processor
All of the above
330. A form of code that uses more than one process and processor, possibly of different types, and that may on occasion have more than one process or processor active at the same time is known as:
Multiprogramming
Broadcasting
Multithreading
Time sharing
331. Assembly language:
Is usually the primary user interface
Requires fixed-format commands
Is a mnemonic form of machine language
Is quite different from the SCL interpreter
332. Which of the following are the advantages of modular programming?
The program is much easier to change
Modules can be reused in other programs
Easy debugging
Easy to compile
333. Which of the following can be accessed by the transfer vector approach of linking?
External data segments
Data located in other procedures
External subroutines
All of the above
334. The linker:
Is the same as the loader
Is required to create a load module
Uses source code as input
Is always used before programs are executed
335. Indicate which is a pre-emptive scheduling algorithm:
Round-robin
Priority-based
Shortest-job-next
All of the above
336. A characteristic of an online real-time system is:
More than one CPU
Offline batch processing
No delay in processing
All of the above
337. Indicate which, of the following, is the worst type of module coupling:
Content coupling
Control coupling
No coupling
All of the above
338. A page fault:
Is an error in a specific page
Occurs when a program accesses a page of memory
Is an access to a page not currently in memory
Is a reference to a page belonging to another program
339. In memory systems, boundary registers:
Are used for temporary program variable storage
Are only necessary with fixed partitions
Track page boundaries
Track the beginning and ending of programs
340. Relocatable programs:
Cannot be used with fixed partitions
Can be loaded almost anywhere in memory
Do not need a linker
Can be loaded only at one specific location
341. The FIFO algorithm:
Executes first the job that last entered the queue
Executes first the job that first entered the queue
Executes first the job that has been in the queue the longest
Executes first the job with the least processor needs
342. The user interface:
Is relatively unimportant
Is slanted toward novice users
Supports both novice and experienced users
Is easy to provide, even with good support
343. Memory management is:
Not used in modern operating systems
Replaced with virtual memory on current systems
Not used on multiprogramming systems
Critical for even the simplest operating systems
344. The practice of “bundling” refers to:
Selling computers alone
Selling peripheral devices with computers
Selling software to run on computers
Giving away software with a computer purchase
345. The primary purpose of an operating system is to:
Make computers easier to use
Keep system programmers employed
Make the most efficient use of the hardware
Allow people to use the computers
346. Multiprogramming systems:
Are easier to develop than single programming systems
Execute each job faster
Execute more jobs in the same time period
Are used only on large mainframe computers
347. Spooling is most beneficial in a multiprogramming environment where:
Most jobs are CPU-bound
Most jobs are I/O-bound
Jobs are evenly divided as I/O-bound and CPU-bound
There is limited primary memory and need for secondary memory
348. Software that measures, monitors, analyzes, and controls real-world events is called:
System software
Scientific software
Real-time software
Business software
349. Object modules generated by assemblers that contain unresolved external references are resolved for two or more object modules by a/an:
Operating system
Linker
Loader
Compiler
350. Which of the following is false about disk when compared to main memory?
Non-volatile
Lower price per bit
Longer storage capacity
Faster
351. Which of the following capabilities is required for a system program to execute more than one program at a time?
Word processing
Virtual memory
Compiling
Multitasking
352. A critical region is:
A program segment that has not been proved bug-free
A program segment that often causes unexpected system crashes
A program segment where shared resources are accessed
One which is enclosed by a pair of P and V operations on semaphores
353. Which of the following addressing modes facilitates access to an operand whose location is defined relative to the beginning of the data structure in which it appears?
Ascending
Index
Sorting
Indirect
354. The register or main memory location which contains the effective address of the operand is known as:
Pointer
Special location
Indexed register
Scratch pad
355. System programs such as compilers are designed so that they are:
Re-entrant
Serially usable
Non-reusable
Recursive
356. Special software to create a job queue is called a:
Drive
Interpreter
Spooler
Linkage editor
357. The most common security failure is:
Carelessness by users
Depending on passwords
Too much emphasis on preventing physical access
Insufficient technology used to prevent breaches
358. A public key encryption system:
Allows anyone to decode the transmission
Allows only the correct sender to decode the data
Allows only the correct receiver to decode the data
Does not encode the data before transmitting it
359. Supervisor state is:
Never used
Entered by programs when they enter the processor
Required to perform any I/O
Only allowed to the operating system
360. A high paging rate:
May cause a high I/O rate
Keeps the system running well
Is a symptom of too much processor activity
Always creates a slow system
361. Round robin scheduling is essentially the preemptive version of:
FIFO
FILO
FCFS
Longest time first
362. If the number of bits in the virtual address of a program is 12 and the page size is 0.5 KB, the number of pages in the virtual address space is:
16
32
64
128
363. In which of the storage placement strategies is a program placed in the largest available hole in the main memory?
Best fit
Worst fit
First fit
Buddy
364. For how many processes which are sharing common data does Dekker’s algorithm implement mutual exclusion?
1
2
3
4
365. A disk scheduling algorithm in an operating system causes the disk arm to move back and forth across the disk surface in order to service all requests in its path. This is a:
First come first served
Scan
Shortest Seek Time First (SSTF)
FIFO
366. Round-robin scheduling:
Allows interactive tasks quicker access to the processor
Is quite complex to implement
Gives each task the same chance at the processor
Allows processor-bound tasks more time in the processor
367. Inter-process communication:
Is required for all processes
Is usually done via disk drives
Is never necessary
Allows processes to synchronize activity
368. Fork is:
The dispatching of a task
The creation of a new job
The creation of a new process
Increasing the priority of a task
369. A process is another name for:
A job
Paging
A task
The operating system dispatcher
370. Relocation bits used by relocating loader are specified (generated by):
Relocating loader itself
Assembler or translator
Linker
Macro processor
371. Device independence:
Allows the computer to run without I/O devices
Makes all devices look the same to the operating system
Allows programs to be written more easily
Allows tape drives to be substituted for disk drives
372. User-Friendly Systems are:
Required for object-oriented programming
Easy to develop
Common among traditional mainframe operating systems
Becoming more common
373. Disk scheduling includes deciding:
Which disk should be accessed next
The order in which disk access requests must be serviced
The physical location of the file
The logical location of the file
374. Which of the following translator programs convert assembly language program to object program?
Assembler
Macro processor
Compiler
Linker
375. Data encryption:
Is mostly used by public networks
Is mostly used by financial networks
Cannot be used by private installations
Is not necessary, since data cannot be intercepted
376. Seeks analysis:
Is used for analyzing paging problems
Is used for analyzing device busy problems
Is used for analyzing control-unit busy problems
Is only shown on real-time displays
377. Swapping:
Works best with many small partitions
Allows many programs to use memory simultaneously
Allows each program in turn to use the memory
Does not work with overlaying
378. Feedback queue:
Are very easy to implement
Dispatch tasks according to execution characteristics
Are used to favor real-time tasks
Require manual intervention to implement properly
379. A file organization component of a VSAM file is:
Relative record data set
Entry sequential data set
Keyed sequential data set
All of the above
380. The file structure that redefines its first record at a basic of zero uses the term:
Relative organization
Dynamic reallocation
Key fielding
Hashing
381. File record length:
Should always be fixed
Should always be variable
Depends upon the size of the file
Should be chosen to match the data characteristics
382. An incremental backup:
Should be done each month
Uses more tapes
Saves all files
Saves only files that have recently changed
383. A partitioned data set is most used for:
Program or source library
Storing backup information
Storing program data
Storing ISAM file
384. System generation:
Is always quite simple
Is always very difficult
Varies in difficulty between systems
Requires extensive tools to be understandable
385. Object code:
Is ready to execute
Is the output of compilers, but not assemblers
Must be “loaded” before execution
Must be rewritten before execution
386. Virtual memory is:
Simple to implement
Used in all major commercial operating systems
Less efficient in utilization of memory
Useful when fast I/O devices are not available
387. System maintenance:
Is usually not necessary
Is necessary on all systems, regardless of how good
Is not required if the system is well written
Always requires several programs
388. Which of the following statements is not true?
Time sharing is an example of multiprogramming
JCL is used only to communicate between systems programmers
A batch file contains a series of operating system commands
The primary function of operating systems is to make the computer hardware easily usable
389. What scheduling algorithm allows processes that are logically runnable to be temporarily suspended?
Preemptive scheduling
FIFO
Non-preemptive scheduling
FCFS
390. The term ‘polling’ in a computer means a process by which a computer system:
Detects/corrects errors
Multiplexes the inputs and updates the memory accordingly
Decides the correct alternative by analyzing several ones
Inquiries to see if a terminal has any transaction to send
391. In a magnetic disk, data is recorded in a set of concentric tracks which are subdivided into:
Periods
Zones
Sectors
Groups
392. Which of the following is true for machine language?
Repeated execution of program segments
Depicting flow of data in a system
A sequence of instructions which, when followed properly, solves a problem
The language which communicates with the computer using only the binary digits 1 and 0
393. The LRU algorithm:
Pages out pages that have been used recently
Pages out pages that have not been used recently
Pages out pages that have been least used recently
Pages out the first page in a given area
394. A linker:
Creates a load module
Is not necessary with variable partitions
Must be run after the loader
Is not needed with a good compiler
395. Global locks:
Synchronize access to local resources
Synchronize access to global resources
Are used to avoid local locks
Prevent access to global resources
396. The dynamic allocation of storage areas with VSAM files is accomplished by:
Hashing
Overflow areas
Control splits
Relative recording
397. Which of the following refers to associative memory?
The address of the data is generated by the CPU
The address of the data is supplied by the user
There is no need for an address, i.e., the data is used as an address
The data are accessed sequentially
398. Link encryption:
Is more secure than end-to-end encryption
Is less secure than end-to-end encryption
Cannot be used in a public network
Is used only to debug
399. Which of the following is a characteristic of an operating system?
Resource management
Memory management
Error recovery
All of the above
400. Files can have:
Read access
Write access
Copy access
All of the above
401. A file is sometimes called a:
Collection of input data
Temporary place to store data
Data set
Program
402. In MS-DOS, relocatable object files and load modules have extensions:
OBJ and .COM or .EXE respectively
COM and .OBJ, respectively
EXE and .OBJ, respectively
DAS and .EXE, respectively
403. Resolution of externally defined symbols is performed by:
Linker
Compiler
Loader
Assembler
404. In which of the following page replacement policies does Belady’s anomaly occur?
FIFO
LFU
LRU
NRU
405. Four necessary conditions for deadlock to exist are: mutual exclusion, no-preemption, circular wait, and:
Hold and wait
Race around condition
Deadlock avoidance
Buffer overflow
406. A system program that sets up an executable program in main memory ready for execution is:
Assembler
Loader
Linker
Compiler
407. The principle of locality of reference justifies the use of:
Re-entrant code
Virtual memory
Non-reusable code
Cache memory
408. The details of all external symbols and relocation information (relocation list or map) are provided to the linker by:
Macro processor
Loader
Translator
Editor
409. Scheduling is:
Allowing jobs to use the processor
Unrelated to performance considerations
Not required in uniprocessor systems
The same regardless of the purpose of the system
410. Real-time systems are:
Primarily used on mainframe computers
Used for monitoring events as they occur
Used for program analysis
Used for real-time interactive users
411. Access time is the highest in the case of:
Floppy disk
Swapping devices
Cache
Magnetic disk
412. The most common systems security method is:
Passwords
Firewall
Encryption
All of the above
413. Poor response times are caused by:
Processor busy
High paging rates
High I/O rate
Any of the above
414. Which of the following is a block device?
Mouse
Terminals
Printer
Disk
415. Which of the following statements is false?
The technique of storage compaction involves moving all occupied areas of storage to one end or other of main storage
Compaction does not involve relocation of programs
Compaction is also known as garbage collection
The system must stop everything while it performs compaction
416. Thrashing can be avoided if:
The pages belonging to the working set of the programs are in main memory
The speed of the CPU is increased
The speed of the I/O processor is increased
All of the above
417. Operating system:
Links a program with the subroutines it references
Provides a layered, user-friendly interface
Enables the programmer to draw a flowchart
All of the above
418. A task in a blocked state:
Is executable
Is running
Must still be placed in the run queues
Is waiting for something temporarily unavailable
419. Backups should be done:
Daily for most installations
Weekly for most installations
As several image copies, followed by an incremental
As several incremental, followed by an image copy
420. Which of the following statements is true?
The LRU algorithm pages out pages that have been used recently
Thrashing is a natural consequence of virtual memory systems
Seek analysis is used for analyzing control-unit busy problems
All of the above
421. A flowchart that uses predefined symbols to describe data flow in a system is known as:
Program flowchart
Data flow diagram
System flowchart
All of the above
422. Which of the following is true about pseudo code?
A machine language
A high-level language
An assembly language
None of the above
423. A program that converts a high-level language program to a set of instructions that can run on a computer is called a:
Compiler
Editor
Debugger
All of the above
424. Which of the following statements is not true about the FORTRAN language?
FORTRAN is a high-level language
A FORTRAN program, written for the IBM-PC, is totally different from a FORTRAN program written for execution on the SUN machine
FORTRAN is extensively used to write programs for performing scientific computations
All of the above
425. The initial value of the semaphore that allows only one of the many processes to enter their critical section is:
8
1
16
0
426. The principles of structured programming forbid the use of:
WHILE-DO
IF-THEN-ELSE
GO TO
DO-WHILE
427. Which of the following is necessary to work on a computer?
Compiler
Assembly
Operating system
Interpreter
428. Dividing a project into segments and smaller units in order to simplify the analysis, design, and programming efforts is known as:
Modular approach
Bottom-up approach
Top-down approach
Left-right approach
429. The errors that can be pointed out by the compiler are:
Syntax errors
Logical errors
Semantic errors
Internal errors
430. The dispatcher:
Actually schedules the tasks into the processor
Puts tasks in I/O wait
Is always small and simple
Never changes task priorities
431. The SJF algorithm executes first the job:
That last entered the queue
The first entered the queue
That has been in the queue the longest
With the least processor needs
432. Semaphores:
Synchronize critical resources to prevent deadlock
Synchronize critical resources to prevent contention
Are used to do I/O
Are used for memory management
433. Fragmentation of the file system:
Occurs only if the file system is used improperly
Can always be prevented
Can be temporarily removed by compaction
Is a characteristic of all file systems
434. The command interpreter:
Is usually the primary user interface
Requires fixed format commands
Is menu driven
Is quite different from the SCL interpreter
435. A translator is best described as:
An application software
A hardware component
A system software
All of the above
436. The part of the machine-level instruction, which tells the central processor what has to be done, is:
Operation code
Locator
Address
Flip-flop
437. Which of the following instruction steps would be written within the diamond-shaped box of a flowchart?
S = B - C
PRINT A
IS A < 10
DATA X, 4, Z
438. Block caches or buffer caches are used:
To improve disk performance
To handle interrupts
To increase the capacity of the main memory
To speed up main memory read operation
439. To avoid the race condition, the maximum number of processes that may be simultaneously inside their critical section is:
8
1
16
0
440. What is the initial value of the semaphore to allow only one of the many processes to enter their critical section?
8
1
16
0
441. Which technique stores a program on disk and then transfers the program into main storage as and when they are needed, is known as:
Spooling
Thrashing
Swapping
All of the above
442. Which of the following is not true about the description of a decision table?
A decision table is easy to modify
A decision table is directly understood by the computer
A decision table is easy to understand
All of the above
443. The memory allocation scheme subject to ‘external’ fragmentation is:
Segmentation
Pure demand paging
Swapping
Multiple contiguous fixed partitions
444. The advantage of a command processor running only built-in commands is:
Flexibility to the users in running lists of commands by simply collecting them in named batch command files
The command set being common across different hardware configurations
Users can create system programs and run them as commands
The processing is much faster than would otherwise be the case when user-defined commands are used
445. Which of the following is not true about memory management?
Virtual memory is used only in multiuser systems
Segmentation suffers from external fragmentation
Paging suffers from internal fragmentation
Segmented memory can be paged
446. In which way(s) can a macro processor for assembly language be implemented?
Independent two-pass processor
Independent one-pass processor
Processor incorporated into pass 1 of a standard two-pass assembler
All of the above
447. The disadvantage of “Compile and GO” loading scheme is (are):
A portion of memory is wasted because the core occupied by the assembler is unavailable to the object program
It is necessary to retranslate the user’s program deck every time it is run
It is very difficult to handle multiple segments, especially if the source programs are in different languages, and to produce orderly modular programs
All of the above
448. In analyzing the compilation of a PL/I program, the term “syntax analysis” is associated with:
Recognition of basic syntactic constructs through reductions
Recognition of basic elements and creation of uniform symbols
Creation of more optional matrix
Use of macro processor to produce more optimal assembly code
449. Uniform Symbols Table:
Contains all constants in the program
A permanent table of decision rules in the form of patterns for matching with the uniform symbol table to discover syntactic structure
Consists of a full or partial list of the tokens as they appear in the program, created by lexical analysis and used for syntax analysis and interpretation
A permanent table which lists all keywords and special symbols of the language in symbolic form
450. The function(s) of the scheduler is (are):
It selects which ready process is to be run next
It specifies the time slice
It is waiting for an event to occur before continuing execution
Both A and B
451. The function(s) of the file system is (are):
To provide complete file naming freedom to the users and to permit controlled sharing of files
To provide for long and short-term storage of files with appropriate economic tradeoffs
To provide security against loss of information due to system failure
All of the above
452. Moving a process from main memory to disk is called:
Scheduling
Swapping
Caching
Spooling
453. In order to allow only one process to enter its critical section, binary semaphores are initialized to:
0
1
2
3
454. The state transition initiated by the user process itself in an operating system is:
Block
Wake up
Dispatch
Timer run out
455. Which of the following terms refers to the degree to which data in a database system are accurate and correct?
Data security
Data independence
Data validity
Data integrity
456. The total time to prepare a disk drive mechanism for a block of data to be read from it is:
Latency
Latency plus transmission time
Latency plus seek time
Latency plus seek time plus transmission time
457. The paging rate:
Should never be greater than 100 per second
Is greater for large programs
Is the number of I/O interrupts each second
Increases as the number of page faults increases
458. Thrashing:
Is a natural consequence of virtual memory systems
Can always be avoided by swapping
Always occurs on large computers
Can be caused by poor paging algorithms
459. The computational technique used to compute the disk storage address of individual records is called:
Bubble memory
Dynamic reallocation
Key fielding
Hashing
460. Capacity planning:
Requires detailed system performance information
Is independent of the operating system
Does not depend on the monitoring tools available
Is not needed in small installations
461. In a multiprogramming system, a set of processes is deadlocked if each process in the set is waiting for an event to occur that can be initiated only by another process in the set. Which of the following is not one of the four conditions that are necessary for deadlock to occur?
Non-preemption
Partial assignment of resources
Process suspension
Circular wait
462. Belady's anomaly occurs in:
Optimal replacement
LRU
FIFO
Both in FIFO and LRU
463. The CPU, after receiving an interrupt from an I/O device:
Halts for a predetermined time
Hands over control of the address bus and data bus to the interrupting device
Branches off to the interrupt service routine immediately
Branches off to the interrupt service routine after completion of the current instruction
464. Which of the following is not a characteristic of a daisy chaining priority control scheme?
Priority is programmable
It is relatively easy to add more devices to the chain
The failure of one device may affect other devices on the chain
The number of control lines is independent of the number of devices on the chain
465. An example of a system development program is:
Operating system
Database management systems
Performance monitors
Language translators
466. Which of the following is not a part of the operating system?
Supervisor
Job-control program
Performance monitor
Input/output control program
467. If special forms are needed for printing the output, the programmer specifies these through:
JCL
Utility programs
IPL
Load modules
468. Which of the following is not an advantage of multiprogramming?
Increased throughput
Shorter response time
Decreased operating system overhead
Ability to assign priorities to jobs
469. The problem of thrashing is affected significantly by:
Program structure
Primary-storage size
Program size
None of the above
470. Logical extension of multiprogramming of operating system is:
Time sharing
Single programming
Multi-tasking
Both (A) and (B)
471. Under multiprogramming, turnaround time for short jobs is usually...... and that for long jobs is slightly......
Lengthened; shortened
Shortened; shortened
Shortened; lengthened
Shortened; unchanged
472. Remote computing service involves the use of time-sharing and......
Multiprocessing
Batch processing
Interactive processing
Real-time processing
473. Under which circumstances the scheduling scheme is non-preemptive:
When a process switches from running to waiting state, when a process terminates
When a process switches from waiting to the ready state
When a process switches from waiting to the ready state
Both (A) and (B)
474. Under which circumstances the scheduling scheme is preemptive:
When a process switches from running to waiting state
When a process switches from running to the ready state
When a process switches from waiting to the ready state
Both (B) and (C)
475. ......gives control of the CPU to the process selected by the short-term scheduler.
Long-term scheduler
Dispatcher
Medium-term scheduler
None of the above
476. Which of the following are the functions of the dispatcher?
Swapping
Jumping to the proper location in the user program to restart that program
Scheduling
All of the above
477. Which of the following are CPU scheduling criteria?
CPU utilization
Dispatcher latency
Waiting time
Both (A) and (B)
478. Which of the following is true for the algorithms for allocating regions of contiguous memory?
First-fit
Best-fit
Next-fit
All of the above
479. The first-fit algorithm for allocating regions of contiguous memory does......
Scan memory region list from start for first fit
Scan memory region list from point of last allocation to next
Tends to leave small unusable regions, and slower due to requirement of searching the entire list
There is no such algorithm
480. The best-fit algorithm for allocating regions of contiguous memory does......
Scan memory regions from start for first fit
Pick the closest free region in the entire list
There is no such algorithm
Find the worst fit in the entire list
481. Which of the following are scheduling algorithms:
First come first serve
Priority scheduling
Shortest job first
All of the above
482. Routine is not loaded until it is called. All routines are kept on disk in a reloadable load format. The main program is loaded into memory & is executed. This type of loading is called ______.
Static loading
Dynamic linking
Dynamic loading
Overlays
483. Which of the following is crucial time while accessing data on the disk?
Seek time
Transmission time
Rotational time
Waiting time
484. The host repeatedly checks if the controller is busy until it is not. It is in a loop that status register’s busy bit becomes clear. This is called ______ and a mechanism for the hardware controller to notify the CPU that it is ready is called ______.
Interrupt and Polling
Polling and Interrupt
Polling and Spooling
Deadlock and Starvation
485. Unix Operating System is an ______.
Time Sharing Operating System
Multi-tasking Operating System
Multi-User Operating Systems
All of the Above
486. Which of the following memory allocation scheme suffers from External fragmentation?
Segmentation
Swapping
Pure demand paging
Paging
487. Information about a process is maintained in a ______.
Stack
Process Control Block
Translation Look aside Buffer
Program Control Block
488. Distributed OS works on the ______ principle.
File Foundation
Multi system image
Single system images
Networking image
489. The problem of fragmentation arises in ______.
Static storage allocation
Stack allocation storage
Stack allocation with dynamic binding
Heap allocation
490. Which file system does DOS typically use?
FAT16
NTFS
FAT32
WNFS
491. The program is known as ______ which interacts with the inner part of called kernel.
Compiler
Protocol
Device Driver
Shell
492. The time taken by the disk arm to locate the specific address of a sector for getting information is called ______.
Rotational Latency
Search Time
Seek Time
Response Time
493. Which file system does Windows 95 typically use?
FAT16
NTFS
FAT32
LMFS
494. Identify the odd thing in the services of operating system.
Accounting
Error detection and correction
Protections
Deadlock handling
495. Cryptography technique is used in ______.
Polling
Protection
Job Scheduling
File Management
496. Which of the following is not an advantage of multiprogramming?
Increased throughput
Shorter response times
Decreased operating system overhead
Ability to assign priorities to jobs
497. In ______ OS, the response time is very critical.
Multitasking
Online
Batch
Real-time
498. An optimal scheduling algorithm in terms of minimizing the average waiting time of a given set of processes is ______.
FCFS scheduling algorithm
Round robin scheduling algorithm
Shortest job-first scheduling algorithm
None of the above
499. Real-time systems are ______.
Primarily used on mainframe computers
Used for monitoring events as they occur
Used for program development
Used for real-time interactive users
500. Which technique was introduced because a single job could not keep both the CPU and the I/O devices busy?
Time-sharing
Preemptive scheduling
Spooling
Multiprogramming
501. Inter-process communication can be done through ______.
Mail
System calls
Messages
Traps
502. In Priority Scheduling, a priority number (integer) is associated with each process. The CPU is allocated to the process with the highest priority (smallest integer = highest priority). The problem of starvation (low priority processes may never execute) is resolved by ______.
Terminating the process
Mutual Exclusion
Aging
Semaphore
503. CPU performance is measured through ______.
Throughput
Flops
MHz
None of the above
504. PCB = ______.
Program Control Block
Process Communication Block
Process Control Block
None of the above
505. Software is a program that directs the overall operation of the computer, facilitates its use, and interacts with the user. What are the different types of this software?
Operating system
Utilities
Language Compiler
All of the above
506. A ______ is software that manages the time of a microprocessor to ensure that all time-critical events are processed as efficiently as possible. This software allows the system activities to be divided into multiple independent elements called tasks.
Kernel
Processor
Shells
Device Driver
507. The primary job of the operating system of a computer is to ______.
Command Resources
Provide Utilities
Manage Resources
Be user-friendly
508. With the round-robin CPU scheduling in a time-shared system ______.
Using very large time slices degenerates into the first-come-first-served algorithm
Using extremely small time slices improves performance
Using extremely small time slices degenerates into the last-in-first-out algorithm
Using medium-sized time slices leads to the shortest request time first algorithm
509. Which of the following is a criterion to evaluate a scheduling algorithm?
CPU Utilization: Keep CPU utilization as high as possible
Throughput: Number of processes completed per unit time
Waiting Time: Amount of time spent ready to run but not running
All of the above
510. Which of the following is contained in Process Control Block (PCB)?
Process Number
Memory Limits
List of Open Files
All of the Above
511. Supercomputers typically employ ______.
Real-time Operating system
Desktop OS
Multiprocessors OS
None of the above
512. Round-robin scheduling is essentially ______ the preemptive version of ______.
FIFO
Shortest remaining
Shortest job first
Longest time first
513. A page fault occurs.
When the page is not in the memory
When the page is in the memory
When the process enters the blocked state
When the process is in the ready state
514. Which of the following will determine your choice of systems software for your computer?
Is the applications software you want to use compatible with it?
Is it expensive?
Is it compatible with your hardware?
Both (A) and (C)
515. Let S and Q be two semaphores initialized to 1, where P0 and P1 processes the following statements: wait(S); wait(Q); —; signal(S); signal(Q) and wait(Q); wait(S); —; signal(Q); signal(S); respectively. The above situation depicts a ______.
Semaphore
Signal
Deadlock
Interrupt
516. What is a shell?
It is a hardware component
It is a part in compiler
It is a command interpreter
It is a tool in CPU scheduling
517. Routine is not loaded until it is called. All routines are kept on disk in a relocatable load format. The main program is loaded into memory & is executed. This type of loading is called ______.
Static loading
Dynamic linking
Dynamic loading
Overlays
518. In the blocked state:
The processes waiting for I/O are found
The process which is running is found
The processes waiting for the processor are found
None of the above
519. What is the memory from 1K - 640K called?
Extended Memory
Low Memory
Normal Memory
Conventional Memory
520. 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 ______.
Editors
System Call
Compilers
Caching
521. If the Disk head is located initially at 32, find the number of disk moves required with FCFS if the disk queue of I/O blocks requests are 98, 37, 14, 124, 65, 67.
310
315
324
321
522. Multiprogramming systems ______.
Are easier to develop than single programming systems
Execute each job faster
Execute more jobs in the same time
Are used only on large mainframe computers
523. Which is not the state of the process?
Blocked
Ready
Running
Privileged
524. The solution to the Critical Section Problem is: Mutual Exclusion, Progress, and Bounded Waiting.
The statement is false
The statement is contradictory
The statement is true
None of the above
525. The problem of thrashing is affected significantly by ______.
Program structure
Primary storage size
Program size
None of the above
526. The state of a process after it encounters an I/O instruction is ______.
Ready
Idle
Blocked/Waiting
Running
527. The number of processes completed per unit time is known as ______.
Output
Efficiency
Throughput
Capacity
528. ______ is the situation in which a process is waiting on another process, which is also waiting on another process ... which is waiting on the first process. None of the processes involved in this circular wait are making progress.
Deadlock
Dormant
Starvation
None of the above
529. Which technique was introduced because a single job could not keep both the CPU and the I/O devices busy?
Time-sharing
Preemptive scheduling
Spooling
Multiprogramming
530. The mechanism that brings a page into memory only when it is needed is called ______.
Segmentation
Demand Paging
Fragmentation
Page Replacement
531. Switching the CPU to another Process requires saving the state of the old process and loading the new process state. This is called as ______.
Process Blocking
Time Sharing
Context Switch
None of the above
532. Which directory implementation is used in most Operating Systems?
Single level directory structure
Tree directory structure
Two level directory structure
Acyclic directory structures
533. The Banker’s algorithm is used:
To prevent deadlock in operating systems
To detect deadlock in operating systems
To rectify a deadlocked state
None of the above
534. A thread:
Is a lightweight process where the context switching is low
Is a lightweight process where the context switching is high
Is used to speed up paging
None of the above
535. ______ is a high-level abstraction over Semaphore.
Shared memory
Monitor
Message passing
Mutual exclusion
536. A tree-structured file directory system ______.
Allows easy storage and retrieval of file names
Is a much-debated unnecessary feature
Is not essential when we have millions of files
None of the above
537. Translator for low-level programming language were termed as:
Assembler
Linker
Compiler
Loader
538. Analysis which determines the meaning of a statement once its grammatical structure becomes known is termed as:
Semantic analysis
Regular analysis
Syntax analysis
General analysis
539. Load address for the first word of the program is called:
Linker address origin
Phase library
Load address origin
Absolute library
540. Symbolic names can be associated with:
Information
Operand
Data or instruction
Mnemonic operation
541. The translator which performs macro expansion is called a:
Macro processor
Micro pre-processor
Macro pre-processor
Assembler
542. Shell is the exclusive feature of:
UNIX
System software
DOS
Application software
543. A program in execution is called:
Process
Procedure
Instruction
Function
544. Interval between the time of submission and completion of the job is called:
Waiting time
Throughput
Turnaround time
Response time
545. A scheduler which selects processes from secondary storage device is called:
Short-term scheduler
Medium-term scheduler
Long-term scheduler
Process scheduler
546. The scheduling in which CPU is allocated to the process with the least CPU-burst time is called:
Priority Scheduling
Round Robin Scheduling
Shortest job-first Scheduling
Multilevel Queue Scheduling
547. The term ‘page traffic’ describes:
Number of pages in memory at a given instant
Number of papers required to be brought in at a given page request
The movement of pages in and out of memory
Number of pages of executing programs loaded in memory
548. The “turn-around” time of a user job is the:
Time since its submission to the time its results become available
Time duration for which the CPU is allotted to the job
Total time taken to execute the job
Time taken for the job to move from assembly phase to completion phase
549. Which of the following can be used as a criterion for classification of data structures used in language processing?
Nature of a data structure
Lifetime of a data structure
Purpose of a data structure
All of the above
550. Memory utilization factor shall be computed as follows:
Memory in use/allocated memory
Memory in use/total memory connected
Memory allocated/free existing memory
Memory committed/total memory available
550. Memory utilization factor shall be computed as follows:
Memory in use/allocated memory
Memory in use/total memory connected
Memory allocated/free existing memory
Memory committed/total memory available
551. Program ‘preemption’ is:
Forced deallocation of the CPU from a program which is executing on the CPU
Release of CPU by the program after completing its task
Forced allotment of CPU by a program to itself
A program terminating itself due to detection of an error
552. An assembler is:
Programming language dependent
Machine dependent
Syntax dependent
Data dependent
553. Which of the following is not a fundamental process state?
Ready
Executing
Terminated
Blocked
554. LRU page replacement policy is:
Last Replaced Unit
Least Recently Used
Last Restored Unit
Least Required Unit
555. Which of the following is true?
Block cipher technique is an encryption technique
Stream cipher technique is an encryption technique
Both (A) and (B)
Neither of (A) and (B)
556. Which of the following approaches do not require knowledge of the system state?
Deadlock detection
Deadlock avoidance
Deadlock prevention
None of the above
557. Program generation activity aims at:
Automatic generation of program
Organize execution of a program written in PL
Skips generation of program
Speed generation of program
558. Which amongst the following is not an advantage of Distributed systems?
Reliability
Resource sharing
Incremental growth
None of the above
559. An imperative statement:
Reserves areas of memory and associates names with them
Indicates an action to be performed during execution of assembled program
Indicates an action to be performed during optimization
None of the above
560. Which of the following loader is executed when a system is first turned on or restarted?
Boot loader
Bootstrap loader
Compile and Go loader
Relating loader
561. Poor response time is usually caused by:
Process busy
High paging rate
High I/O rates
Any of the above
562. The “blocking factor” of a file is:
The number of blocks accessible to a file
The number of blocks allocated to a file
The number of logical records in one physical record
None of the above
563. Which of these is a component of a process precedence sequence?
Process name
Concurrency operator
Sequence operator ';'
All of the above
564. Which amongst the following is valid syntax of the Fork and Join Primitive?
Fork
For
Fork
Fork
565. Nested Macro calls are expanded using the:
FIFO rule (First in first out)
FILO rule (First in last out)
LIFO (Last in First out)
None of the above
566. A parser which is a variant of top-down parsing without backtracking is:
Recursive Descent
LL(1) parser
Operator Precedence
LALR Parser
567. The expansion of nested macro calls follows:
FIFO rule
LILO rule
LIFO rule
Priority rule
568. In a two-pass assembler, the task of the Pass II is to:
Separate the symbol, mnemonic opcode, and operand fields
Build the symbol table
Construct intermediate code
Synthesize the target program
569. A linker program:
Places the program in the memory for the purpose of execution
Relocates the program to execute from the specific memory area allocated to it
Links the program with other programs needed for its execution
Interfaces the program with the entities generating its input data
570. Which scheduling policy is most suitable for a time-shared operating system?
Shortest-job First
Round-Robin
Elevator
First-Come-First-Serve
571. A critical section is a program segment:
Which should run in a certain specified amount of time
Which avoids deadlocks
Where shared resources are accessed
Which must be enclosed by a pair of semaphore operations, P and V
572. An operating system contains 3 user processes each requiring 2 units of resource R. The minimum number of units of R such that no deadlocks will ever arise is:
4
3
5
6
573. Locality of reference implies that the page reference being made by a process:
Will always be to the page used in the previous page reference
Is likely to be the one of the pages used in the last few page references
Will always be to one of the pages existing in memory
Will always lead to a page fault
574. This of these is not a part of Synthesis phase:
Obtain machine code corresponding to the mnemonic from the Mnemonics table
Obtain address of a memory operand from the symbol table
Perform LC processing
Synthesize a machine instruction or the machine form of a constant
575. The syntax of the assembler directive EQU is:
EQU
EQU
EQU
None of the above
576. The following features are needed to implement top-down parsing:
Source string marker
Matching and Backtracking
Prediction making mechanism
All of the above
577. A macro definition consists of:
Macro prototype statement
Macro pre-processor statements
One or more model statements
All of the above
578. The main reason to encrypt a file is to:
Reduce its size
Prepare it for backup
Secure it for transmission
Include it in the start-up sequence
579. This of the following is not a key piece of information, stored in a single page table entry, assuming pure paging and virtual memory:
Frame number
A bit indicating whether the page is in physical memory or on the disk
A reference for the disk block that stores the page
None of the above
580. A UNIX device driver is:
Structured into two halves called top half and bottom half
Three equal partitions
Unstructured
None of the above
581. The following is not a layer of IO management module:
PIOCS (Physical Input Output Control System)
LIOCS (Logical Input Output Control System)
FS (File System)
MCS (Management Control System)
582. Which amongst the following is not a valid page replacement policy?
LRU policy (Least Recently Used)
FIFO policy (First in first out)
RU policy (Recurrently used)
Optimal page replacement policy
583. Consider a program with a linked origin of 5000. Let the memory area allocated to it have the start address of 70000. Which amongst the following will be the value to be loaded in the relocation register?
20000
50000
70000
None of the above
584. An assembly language is a:
Low-level programming language
Middle-level programming language
High-level programming language
Internet-based programming language
585. TII stands for:
Table of Incomplete Instructions
Table of Information Instructions
Translation of Instructions Information
Translation of Information Instruction
586. An analysis, which determines the syntactic structure of the source statement, is called:
Semantic Analysis
Syntax Analysis
Process Analysis
Function Analysis
587. Actions implementing instruction’s meaning are actually carried out by:
Instruction Fetch
Instruction Execution
Instruction Decode
Instruction Program
588. The field that contains a segment index or an internal index is called:
Target Datum
Segment Field
Target Offset
Fis Data
589. A program in execution is called:
Process
CPU
Function
Memory
590. Jobs which are admitted to the system for processing are called:
Long-term scheduling
Medium-term scheduling
Short-term scheduling
Queuing
591. A set of techniques that allow executing a program which is not entirely in memory is called:
Demand Paging
Auxiliary Memory
Virtual Memory
Secondary Memory
592. SSTF stands for:
Shortest-Seek-Time-First scheduling
Simple-Seek-Time-First
Small–Small-Time-First
Small-Simple-Time-First scheduling
593. Before proceeding with its execution, each process must acquire all the resources it needs is called:
Hold and Wait
Circular Wait
No Pre-emption
Starvation
594. Relocation bits used by relocating loader are specified by:
Relocating loader itself
Macro processor
Assembler or Translator
Both (A) and (B)
595. Resolution of externally defined symbols is performed by:
Linker
Compiler
Loader
Editor
596. Relocation programs:
Cannot be used with fixed partitions
Can be loaded almost anywhere in memory
Do not need a linker
Can be loaded only at one specific location
597. Authentication is a fundamental building block in most computers:
Security Context
Execution Context
Control Context
Performance Context
598. Page fault frequency in an operating system is reduced when the:
Processes tend to be I/O-bound
Size of pages is reduced
Processes tend to be CPU-bound
Locality of reference is applicable to the process
599. Which of the following are language processors?
Assembler
Interpreter
Compiler
All of the above
600. Virtual memory can be implemented with:
Segmentation
None
Paging
All of the above
601. Recognition of basic syntactic constructs through reductions, this task is performed by:
Lexical Analysis
Semantic Analysis
Syntax Analysis
Structure Analysis
602. A grammar for a programming language is a formal description of:
Syntax
Structure
Semantics
Code
603. ______ is a technique of temporarily removing inactive programs from the memory of a computer system:
Swapping
Semaphore
Spooling
Scheduler
604. ______ is a technique of improving the priority of processes waiting in the queue for CPU allocation:
Starvation
Revocation
Aging
Relocation
605. ______ is the time required by a sector to reach below the read/write head:
Seek Time
Access Time
Latency Time
None
606. Which of the following is the most general phase-structured grammar?
Context-Sensitive
Context-Free
Regular
None of the above
607. File record length:
Should always be fixed
Should always be variable
Depends upon the size of the file
Should be chosen to match the data characteristics
608. The process is:
An instance of a program in execution
A program only
Processor state
None of the above
609. A program is passive while a process is:
Inactive
Spontaneous
Active
None of the above
610. A process is created and is initially put in the:
Ready queue
Device output
Any of the above
None of the above
611. Exit() system call results in:
Forced termination
Normal termination
Abnormal termination
None of the above
612. A thread is a:
Task
Process
Program
Lightweight process
613. Generally, we have user-level threads and:
Programmer-level thread
Kernel-level thread
Program-level thread
None of the above
614. IPCs can be done through:
Mails
Messages
System calls
Traps
615. RR scheduling is a preemptive version of:
FIFO
SJF
MLQ
None of the above
616. A scheduling where in the jobs are allowed to move between the queues:
Multilevel queue scheduling
Multilevel feedback scheduling
RR scheduling
None of the above
617. In RR Scheduling, a ready queue is treated as:
Circular queue
Doubly linked list
Stack
None of the above
618. FIFO scheduling is:
Preemptive
Non-preemptive
Deadline scheduling
None of the above
619. The indefinite blocking of low-priority processes by high-priority processes is known as:
Starvation
Deadlock
Aging
None of the above
620. The technique of gradually increasing the priority of processes that wait in the system for a long time is called:
Aging
Throughput
FCFS
None of the above
621. The main objective of scheduling is:
CPU utilization
Increase the throughput
Both A and B
None of the above
622. The total time elapsed from the time the job is submitted (or process is created) to the time the job (or process) is completed is called:
Response time
Waiting time
Turnaround time
None of the above
623. ______ is defined as the average fraction of time during which the CPU is busy, executing either user programs or system modules:
Throughput
CPU utilization
Response time
Waiting time
624. In ______ scheduling, if once a process has been allocated CPU, then the CPU cannot be taken away from that process:
Pre-emptive scheduling
Non-preemptive scheduling
Both A and C
None of the above
625. In ______, the CPU can be taken away before the completion of the process:
Pre-emptive scheduling
Non-preemptive
Both A and B
None of the above
626. “If there are n-processes in a ready queue and the time quantum is ‘q’ time intervals, then each process gets ‘1/n’, of the CPU time in the chunks of at most ‘q’ units of time. Each process will have to wait for (n -1) x q time unit until its next time quantum comes in” This principle is suitable for which one of the following:
Round robin algorithm
SFJ
FCFS
None of the above
627. Process can be in one of the following states:
New, Ready
Running
Waiting, Blocked, Terminate
All of the above
628. Process is:
Loosely coupled
Tightly coupled
Both A and B
None of the above
629. Process is:
Lightweight process
Heavyweight process
Tightly coupled
None of the above
630. The high paging activity is called:
Segmentation
Thrashing
Demand Paging
None of the above
631. The process of merging adjacent holes to form a single larger hole is called as:
Fragmentation
Coalescing
Swapping
None of the above
632. The degree of multiprogramming is controlled by:
CPU scheduler
Context switching
Long-term scheduler
Medium-term scheduler
633. Thrashing occurs:
When excessive swapping takes place
When you thrash your computer
Whenever deadlock occurs
When no swapping takes place
634. Boundary registers:
Are available in temporary program variables storage
Are only necessary with fixed partitions
Track the beginning and ending of programs
Track page boundaries
635. A scheduling algorithm is fair:
If no process faces starvation
If a process is starved, detect it and run it with high priority
If it uses semaphores
Only if a queue is used for scheduling
636. A critical region:
Is a piece of code which only one process executes at a time
Is a region prone to deadlock
Is a piece of code which only a finite number of processes executes
Is found only in Windows N operating system
637. In one of the deadlock prevention methods, impose a total ordering of all resource types, and require that each process requests resources in an increasing order of enumeration. This violates the ______ condition of deadlock:
Mutual exclusion
Hold and Wait
Circular wait
No preemption
638. Semaphore can be used for solving:
Wait and signal
Deadlock
Synchronization
Priority
639. The hardware mechanism that enables a device to notify the CPU is called:
Polling
Interrupt
System call
None of the above
640. ______ begins at the root and follows a path down to the specified file:
Relative path name
Absolute path name
Standalone name
All of the above
641. Process state is a part of:
Process control block
Node
File allocation table
None of the above
642. Virtual memory is commonly implemented by:
Segmentation
Swapping
Demand paging
None of the above
643. Paging:
Solves the memory fragmentation problem
Allows modular programming
Allows structured programming
Avoids deadlock
644. Which of the following is a criterion to evaluate a scheduling algorithm?
CPU Utilization: keep CPU utilization as high as possible
Throughput: number of processes completed per unit time
Waiting time: amount of time spent ready to run but not running
All of the above
645. Which of the following is contained in Process Control Block (PCB)?
Process number
List of open files
Memory limits
All of the above
646. With the round-robin CPU scheduling in a time-shared system:
Using very large time slice degenerates into the first-come-first-served algorithm
Using extremely small time slices improves performance
Using extremely small time slices degenerates into the last-in-first-out algorithm
Using medium-sized time slices leads to the shortest request time first algorithm
Last updated