McqMate
These multiple-choice questions (MCQs) are designed to enhance your knowledge and understanding in the following areas: Common Topics in Competitive and Entrance exams .
| 151. |
Cache memory is |
| A. | Bigger and slower than main memory |
| B. | Bigger and faster that main memory |
| C. | Smaller and slower than main memory |
| D. | Smaller and faster than main memory |
| Answer» D. Smaller and faster than main memory | |
| 152. |
By principle of locality, cache memory |
| A. | Increases average memory access time. |
| B. | Reduces average memory access time |
| C. | Does not affect the average memory access time |
| D. | None of these |
| Answer» B. Reduces average memory access time | |
| 153. |
Following is not true for disk cache |
| A. | It is a buffer in main memory for disk sector |
| B. | It contains the copy of some of the sector on the disk |
| C. | It is bigger is size than main memory |
| D. | It is smaller is size than main memory |
| Answer» C. It is bigger is size than main memory | |
| 154. |
In disk storage devices, data are recorded on and later retrieved from disk via a conducting coil named |
| A. | Tail |
| B. | Foot |
| C. | Head |
| D. | Hand. |
| Answer» C. Head | |
| 155. |
In disk storage devices during read and write operation |
| A. | Head is rotate while platter is stationary |
| B. | Head is stationary while platter rotates |
| C. | Head and platter are both stationary |
| D. | None is true |
| Answer» B. Head is stationary while platter rotates | |
| 156. |
In magnetic disk, density that is in bits per linear inch |
| A. | Increases in moving from the outer most track to the inner most track. |
| B. | Decreases in moving from the outer most track to the inner most track. |
| C. | Remains same in moving from the outer most track to the inner most track. |
| D. | Randomly distributed in moving from the outer most track to the inner most track. |
| Answer» A. Increases in moving from the outer most track to the inner most track. | |
| 157. |
Data from and to magnetic disk is transformed in |
| A. | Continuation |
| B. | Blocks |
| C. | Block and Continuation both |
| D. | None of these. |
| Answer» B. Blocks | |
| 158. |
On magnetic disks, the data on the platter is organized in a concentric sets of rings called |
| A. | Sectors |
| B. | Gaps |
| C. | Rings |
| D. | Tracks |
| Answer» D. Tracks | |
| 159. |
In disk storage devices the width of head is: |
| A. | Same of the track |
| B. | More than of the track |
| C. | Less than of the track |
| D. | None is true. |
| Answer» A. Same of the track | |
| 160. |
In a fixed head disk, the number of read/write head per track are |
| A. | One |
| B. | Two |
| C. | Three |
| D. | Four. |
| Answer» A. One | |
| 161. |
CD defines |
| A. | Computer device |
| B. | Computer disk |
| C. | Compact disk |
| D. | None of these |
| Answer» C. Compact disk | |
| 162. |
A-Fixed-Head disk, B-Movable-Head disk, 1- One head per track and al head are mounted on rigid arm that extends across all tracks. 2- Only one head and head is mounted on the arm, such that it can position the track. |
| A. | A – 1, B – 2 |
| B. | A – 2, B – 1 |
| C. | A – 1, B – 1 |
| D. | A – 2, B – 2 |
| Answer» A. A – 1, B – 2 | |
| 163. |
The record is the collection of |
| A. | Fields |
| B. | Files |
| C. | Data base |
| D. | None of these. |
| Answer» A. Fields | |
| 164. |
In File system architecture which is the correct arrangement from lower level to higher. |
| A. | Device drives, basic file system, basic I/ O supervisor, logical I/O. |
| B. | Basic file system, basic I/O, logical I/O, device drives. |
| C. | Basic I/O, basic file system, logical I/O, device drives. |
| D. | None of these. |
| Answer» A. Device drives, basic file system, basic I/ O supervisor, logical I/O. | |
| 165. |
In file management system the following communicate directly with periphing I/O devices. |
| A. | Device drives |
| B. | Basic file system |
| C. | Basic I/O supervisor |
| D. | Logical I/O. |
| Answer» A. Device drives | |
| 166. |
For file management, in file operations device drivers are |
| A. | Disk drivers |
| B. | Tape drivers |
| C. | A and B both |
| D. | None of these. |
| Answer» C. A and B both | |
| 167. |
In file management, the primary interface of computer system with external environment is done through |
| A. | Device drivers |
| B. | Basic file system |
| C. | Basic I/O supervisor |
| D. | Logical I/O. |
| Answer» B. Basic file system | |
| 168. |
In file management, users and applications access records via |
| A. | Physical I/O |
| B. | Basic I/O supervisor |
| C. | Logical I/O |
| D. | None of these. |
| Answer» C. Logical I/O | |
| 169. |
Match the following for file system architecture : A-Basic file system, B-Logical I/O module, 1- Deals with blocks of data, 2- Deals with file records, 3- Provides general purpose record I/O capacity. |
| A. | A – 1, B – 2, 3 |
| B. | A – 1, 2, B – 3 |
| C. | A – 2, 3, B – 1 |
| D. | A – 1, 3, B – 2 |
| Answer» A. A – 1, B – 2, 3 | |
| 170. |
Match the following access rights :A-Specific user, B-User group, C-All ; 1- Individual user who are designated by user I, 2-A set of users who are individually defined, 3-Every user has access to the system. |
| A. | A – 1, B – 2, C – 3 |
| B. | A – 2, B – 1, C – 3 |
| C. | A – 1, B – 3, C – 2 |
| D. | A – 3, B – 2, C – 1 |
| Answer» A. A – 1, B – 2, C – 3 | |
| 171. |
In file management, the pile |
| A. | The collection of data in order which they arrive. |
| B. | A fixed format used for records. |
| C. | Records keep with some key sequence. |
| D. | None of these. |
| Answer» A. The collection of data in order which they arrive. | |
| 172. |
In file management, in the following record blocking method, the optional use of space is made, without unused space left |
| A. | Fixed blocking |
| B. | Variable-length spanned blocking |
| C. | Variable-length un-spanned blocking |
| D. | None of these. |
| Answer» B. Variable-length spanned blocking | |
| 173. |
In secondary storage management, “If allocation of file is made on an individual block basis and each block contains a pointer to the next block in the chain” then it is referred as |
| A. | Contiguous allocation |
| B. | Chained allocation |
| C. | Indexed allocation |
| D. | None of these. |
| Answer» B. Chained allocation | |
| 174. |
In secondary storage management, bit table, for each block on disk a vector contains |
| A. | One bit each block |
| B. | Two bit each block |
| C. | Three bit each block |
| D. | Four bit each block. |
| Answer» A. One bit each block | |
| 175. |
In bit table used for Free space management in secondary storage |
| A. | Bit zero corresponds to free block |
| B. | Bit one corresponds to free block |
| C. | Bit zero corresponds to block in use |
| D. | None of these |
| Answer» A. Bit zero corresponds to free block | |
| 176. |
The amount of memory (in bytes) required for a block bitmap is |
| A. | Disk size × 8 |
| B. | Disk size/ (8 × file system block size) |
| C. | File system block size/disk size |
| D. | None of these. |
| Answer» B. Disk size/ (8 × file system block size) | |
| 177. |
In 16 G byte disk with 512-bit block, the bit table requires |
| A. | 1 M bytes |
| B. | 2 M bytes |
| C. | 3 M bytes |
| D. | 4 M bytes. |
| Answer» D. 4 M bytes. | |
| 178. |
Application Programming Interface is |
| A. | A set of function and call programs that allows clients and servers to intercommunicate. |
| B. | A database, where information access is limited to the selection of rows that satisfy all search criteria. |
| C. | A computer usually a high powered work station. |
| D. | None of these. |
| Answer» A. A set of function and call programs that allows clients and servers to intercommunicate. | |
| 179. |
If in a computer networking environment when all the processing is done on single computer can be referred as |
| A. | Host based processing |
| B. | Server based processing |
| C. | Client based processing |
| D. | None of these. |
| Answer» A. Host based processing | |
| 180. |
In three tier client/server architecture application software match the following: A- User machine, 1-Client, B- Middle-tier, 2- Application server, C- Backend server, 3 Data servers. |
| A. | A – 1, B – 2, C – 3 |
| B. | A – 1, B – 3, C – 2 |
| C. | A – 2, B – 1, C – 3 |
| D. | A – 3, B – 2, C – 1 |
| Answer» A. A – 1, B – 2, C – 3 | |
| 181. |
UNIX was developed by |
| A. | Bell Labs for PDP-7 in 1970 |
| B. | Microsoft for IBM computers |
| C. | Macintosh |
| D. | None of these. |
| Answer» A. Bell Labs for PDP-7 in 1970 | |
| 182. |
UNIX is a |
| A. | Operating system |
| B. | Hardware |
| C. | Programming language |
| D. | None of these. |
| Answer» A. Operating system | |
| 183. |
In UNIX process management, the system process runs in |
| A. | Kernel mode only |
| B. | Kernel and user mode both |
| C. | User mode only |
| D. | None of these. |
| Answer» A. Kernel mode only | |
| 184. |
In UNIX process management, the user processes runs in |
| A. | Kernel mode only |
| B. | Kernel and user mode both |
| C. | User mode only |
| D. | None of these. |
| Answer» B. Kernel and user mode both | |
| 185. |
In UNIX process management, the following is true |
| A. | User process enters kernel mode by issuing a system call when interrupt occurs. |
| B. | Kernel mode is executed in user process. |
| C. | User process enters kernel mode with out issuing a system call when interrupt occurs. |
| D. | None of these. |
| Answer» A. User process enters kernel mode by issuing a system call when interrupt occurs. | |
| 186. |
The number of process states recognized by UNIX |
| A. | Two |
| B. | Nine |
| C. | Eight |
| D. | Seven. |
| Answer» B. Nine | |
| 187. |
In process management of UNIX system, which of the following process states are running states in respect of whether the process is executing in user or kernel mode |
| A. | Ready to run (in memory) state |
| B. | Ready to run (in swappe(D) state |
| C. | Preempted state |
| D. | A and C are true |
| Answer» D. A and C are true | |
| 188. |
A task in a blocked state is |
| A. | Executable |
| B. | Waiting for some temporarily unavailable resource |
| C. | Running |
| D. | None of these |
| Answer» B. Waiting for some temporarily unavailable resource | |
| 189. |
Semaphores |
| A. | are used to do I/O |
| B. | Synchronize critical resources to prevent contention |
| C. | synchronize critical resources to prevent deadlock. |
| D. | allow processes to communicate with one another. |
| Answer» C. synchronize critical resources to prevent deadlock. | |
| 190. |
Priorities |
| A. | are used to schedule processes |
| B. | increase as a process remains in the processor |
| C. | are attached to each page in the system |
| D. | are assigned by the user. |
| Answer» A. are used to schedule processes | |
| 191. |
Dijkstra’s banker’s algorithm in an operating-system solves the problem of |
| A. | deadlock avoidance |
| B. | deadlock recovery |
| C. | mutual exclusion |
| D. | context switching |
| Answer» A. deadlock avoidance | |
| 192. |
Which structure prohibits the sharing of files and directories |
| A. | tree structure |
| B. | one level structure |
| C. | two level structure |
| D. | none of these |
| Answer» D. none of these | |
| 193. |
With round-robin CPU scheduling in a time shared system |
| A. | using very large time slices degenerates into First-Come First Served Algorithm |
| B. | using extremely small time slices improves performance |
| C. | using very small time slices degenerate into Last-In-First-Out algorithm |
| D. | using medium sized time slices leades to Shortest Request Time First algorithm. |
| Answer» A. using very large time slices degenerates into First-Come First Served Algorithm | |
| 194. |
The portion of the process scheduler in an operating system that dispatches processes is concerned with |
| A. | activating suspended I/O-bound processes |
| B. | temporarily suspending processes when CPU load is too great |
| C. | assigning ready processes to the CPU |
| D. | all of the above |
| Answer» C. assigning ready processes to the CPU | |
| 195. |
Following is the correct definition of a valid process transition within an operating system |
| A. | wake up : ready – running |
| B. | dispatch: ready – running |
| C. | block: ready – blocked |
| D. | timer run out : ready – blocked |
| Answer» B. dispatch: ready – running | |
| 196. |
I/O redirection |
| A. | implies changing the name of a file |
| B. | can be employed to use an exiting file as input file for a program |
| C. | implies connection to programs through a pipe |
| D. | none of the above |
| Answer» B. can be employed to use an exiting file as input file for a program | |
| 197. |
When an interrupt occurs, an operating system |
| A. | ignores the interrupt |
| B. | always changes state of interrupted process after processing the interrupt |
| C. | always resumes execution of interrupted process after processing the interrupt |
| D. | may change state of interrupted process to blocked and schedule another process |
| Answer» D. may change state of interrupted process to blocked and schedule another process | |
| 198. |
Thrashing |
| A. | reduces page I/O |
| B. | decreases the degree of multi- programming |
| C. | implies excessive page I/O |
| D. | improve the system performance |
| Answer» C. implies excessive page I/O | |
| 199. |
Dirty bit for a page in a page table |
| A. | helps avoid unnecessary writes on a paging device |
| B. | helps maintain LRU information |
| C. | allows only read on a page |
| D. | none of the above |
| Answer» A. helps avoid unnecessary writes on a paging device | |
| 200. |
A disk scheduling algorithm in an operating system causes the disk arm to seek back and forth access the disc surface servicing all request in its path, this is a |
| A. | first come first served |
| B. | shortest seek time first |
| C. | scan |
| D. | None of these |
| Answer» C. scan | |
Done Studing? Take A Test.
Great job completing your study session! Now it's time to put your knowledge to the test. Challenge yourself, see how much you've learned, and identify areas for improvement. Don’t worry, this is all part of the journey to mastery. Ready for the next step? Take a quiz to solidify what you've just studied.