MCQOPTIONS
Saved Bookmarks
MCQOPTIONS
This section includes 585 Mcqs, each offering curated multiple-choice questions to sharpen your Computer Organization knowledge and support exam preparation. Choose a topic below to get started.
| 101. |
Both the CISC and RISC architectures have been developed to reduce the |
| A. | Cost |
| B. | Time delay |
| C. | Semantic gap |
| D. | All of the mentioned |
| Answer» D. All of the mentioned | |
| 102. |
The computer architecture aimed at reducing the time of execution of instructions is _____ |
| A. | CISC |
| B. | RISC |
| C. | ISA |
| D. | ANNA |
| Answer» C. ISA | |
| 103. |
The CISC stands for ____ |
| A. | Computer Instruction Set Compliment |
| B. | Complete Instruction Set Compliment |
| C. | Computer Indexed Set Components |
| D. | Complex Instruction set computer |
| Answer» E. | |
| 104. |
The commitment unit uses a queue called __ |
| A. | Record buffer |
| B. | Commitment buffer |
| C. | Storage buffer |
| D. | None of the mentioned |
| Answer» B. Commitment buffer | |
| 105. |
Since it uses the out of order mode of execution, the results are stored in _ |
| A. | Buffers |
| B. | Special memory locations |
| C. | Temporary registers |
| D. | TLB |
| Answer» D. TLB | |
| 106. |
A special unit used govern the out of order execution of the instructions is called as ____ |
| A. | Commitment unit |
| B. | Temporal unit |
| C. | Monitor |
| D. | Supervisory unit |
| Answer» B. Temporal unit | |
| 107. |
The step where in the results stored in the temporary register is transfered into the permanent register is called as _ |
| A. | Final step |
| B. | Committment step |
| C. | Last step |
| D. | Inception step |
| Answer» C. Last step | |
| 108. |
If an exception is raised and the succeeding instructions are executed completly, then the processor is said to have _ |
| A. | Exception handling |
| B. | Imprecise exceptions |
| C. | Error correction |
| D. | None of the mentioned |
| Answer» C. Error correction | |
| 109. |
When the processor executes multiple instructions at a time it is said to use ___ |
| A. | single issue |
| B. | Multiplicity |
| C. | Visualization |
| D. | Multiple issue |
| Answer» E. | |
| 110. |
The throughput of a super scalar processor is |
| A. | less than 1 |
| B. | 1 |
| C. | More than 1 |
| D. | Not Known |
| Answer» D. Not Known | |
| 111. |
The situation where in the data of operands are not available is called __ |
| A. | Data hazard |
| B. | Stock |
| C. | Deadlock |
| D. | Structural hazard |
| Answer» B. Stock | |
| 112. |
The contention for the usage of a hardware device is called as __ |
| A. | Structural hazard |
| B. | Stalk |
| C. | Deadlock |
| D. | None of the mentioned |
| Answer» B. Stalk | |
| 113. |
The periods of time when the unit is idle is called as _ |
| A. | Stalls |
| B. | Bubbles |
| C. | Hazards |
| D. | Both Stalls and Bubbles |
| Answer» E. | |
| 114. |
The pipelining process is also called as ___ |
| A. | Superscalar operation |
| B. | Assembly line operation |
| C. | Von neumann cycle |
| D. | None of the mentioned |
| Answer» C. Von neumann cycle | |
| 115. |
To increase the speed of memory access in pipelining, we make use of ___ |
| A. | Special memory locations |
| B. | Special purpose registers |
| C. | Cache |
| D. | Buffers |
| Answer» D. Buffers | |
| 116. |
If a unit completes its task before the allotted time period, then |
| A. | It’ll perform some other task in the remaining time |
| B. | Its time gets reallocated to different task |
| C. | It’ll remain idle for the remaining time |
| D. | None of the mentioned |
| Answer» D. None of the mentioned | |
| 117. |
The fetch and execution cycles are interleaved with the help of ____ |
| A. | Modification in processor architecture |
| B. | Clock |
| C. | Special unit |
| D. | Control unit |
| Answer» C. Special unit | |
| 118. |
In double precision format the size of the mantissa is ___ |
| A. | 32 bit |
| B. | 52 bit |
| C. | 64 bit |
| D. | 72 bit |
| Answer» C. 64 bit | |
| 119. |
The 32 bit representation of the decimal number is called as _ |
| A. | Double-precision |
| B. | Single-precision |
| C. | Extended format |
| D. | None of the mentioned |
| Answer» C. Extended format | |
| 120. |
The sign followed by the string of digits is called as _ |
| A. | Significant |
| B. | Determinant |
| C. | Mantissa |
| D. | Exponent |
| Answer» D. Exponent | |
| 121. |
In 32 bit representation the scale factor as a range of __ |
| A. | -128 to 127 |
| B. | -256 to 255 |
| C. | 0 to 255 |
| D. | None of the mentioned |
| Answer» B. -256 to 255 | |
| 122. |
_______ constitute the representation of the floating number. |
| A. | Sign |
| B. | Significant digits |
| C. | Scale factor |
| D. | All of the mentioned |
| Answer» E. | |
| 123. |
If the decimal point is placed to the right of the first significant digit, then the number is called as __ |
| A. | Orthogonal |
| B. | Normalized |
| C. | Determinate |
| D. | None of the mentioned |
| Answer» C. Determinate | |
| 124. |
The multiplier -6(11010) is recorded as, |
| A. | 0-1-2 |
| B. | 0-1+1-10 |
| C. | -2-10 |
| D. | None of the mentioned |
| Answer» B. 0-1+1-10 | |
| 125. |
The numbers written to the power of 10 in the representation of decimal numbers are called as __ |
| A. | Height factors |
| B. | Size factors |
| C. | Scale factors |
| D. | None of the mentioned |
| Answer» D. None of the mentioned | |
| 126. |
CSA stands for |
| A. | Computer Speed Addition |
| B. | Carry Save Addition |
| C. | Computer Service Architecture |
| D. | None of the mentioned |
| Answer» B. Carry Save Addition | |
| 127. |
The bits 1 & 1 are recorded as _______ in bit-pair recording. |
| A. | -1 |
| B. | 0 |
| C. | +1 |
| D. | both -1 and 0 |
| Answer» E. | |
| 128. |
The method used to reduce the maximum number of summands by half is __ |
| A. | Fast multiplication |
| B. | Bit-pair recording |
| C. | Quick multiplication |
| D. | None of the mentioned |
| Answer» C. Quick multiplication | |
| 129. |
The product of 1101 & 1011 is |
| A. | 10001111 |
| B. | 10101010 |
| C. | 11110000 |
| D. | 11001100 |
| Answer» B. 10101010 | |
| 130. |
The multiplicand and the control signals are passed through to the n-bit adder via _ |
| A. | MUX |
| B. | DEMUX |
| C. | Encoder |
| D. | Decoder |
| Answer» B. DEMUX | |
| 131. |
The ______ is used to co-ordinate the operation of the multiplier. |
| A. | Controller |
| B. | Coordinator |
| C. | Control sequencer |
| D. | None of the mentioned |
| Answer» D. None of the mentioned | |
| 132. |
The multiplier is stored in __ |
| A. | PC Register |
| B. | Shift register |
| C. | Cache |
| D. | None of the mentioned |
| Answer» C. Cache | |
| 133. |
The delay reduced to in the carry look ahead adder is _____ |
| A. | 5 |
| B. | 8 |
| C. | 10 |
| D. | 2n |
| Answer» B. 8 | |
| 134. |
The final addition sum of the numbers, 0110 & 0110 is |
| A. | 1101 |
| B. | 1111 |
| C. | 1001 |
| D. | 1010 |
| Answer» B. 1111 | |
| 135. |
In a normal adder circuit the delay obtained in generation of the output is __ |
| A. | 2n + 2 |
| B. | 2n |
| C. | n + 2 |
| D. | None of the mentioned |
| Answer» B. 2n | |
| 136. |
The usual implementation of the carry circuit involves __ |
| A. | And and or gates |
| B. | XOR |
| C. | NAND |
| D. | XNOR |
| Answer» C. NAND | |
| 137. |
In full adders the sum circuit is implemented using _ |
| A. | And & or gates |
| B. | NAND gate |
| C. | XOR |
| D. | XNOR |
| Answer» D. XNOR | |
| 138. |
______ is used to deal with the difference in the transfer rates between the drive and the bus. |
| A. | Data repeaters |
| B. | Enhancers |
| C. | Data buffers |
| D. | None of the mentioned |
| Answer» D. None of the mentioned | |
| 139. |
The carry in the ripple adders(which is true) |
| A. | Are generated at the beginning only |
| B. | Must travel through the configuration |
| C. | Is generated at the end of each operation |
| D. | None of the mentioned |
| Answer» C. Is generated at the end of each operation | |
| 140. |
The carry generation function: ci + 1 = yici + xici + xiyi, is implemented in _____ |
| A. | Half adders |
| B. | Full adders |
| C. | Ripple adders |
| D. | Fast adders |
| Answer» C. Ripple adders | |
| 141. |
_____ is used to detect and correct the errors that may occur during data transfers. |
| A. | ECC |
| B. | CRC |
| C. | Checksum |
| D. | None of the mentioned |
| Answer» B. CRC | |
| 142. |
The disk drive is connected to the system by using the _ |
| A. | PCI bus |
| B. | SCSI bus |
| C. | HDMI |
| D. | ISA |
| Answer» C. HDMI | |
| 143. |
The access time is composed of __ |
| A. | Seek time |
| B. | Rotational delay |
| C. | Latency |
| D. | Both Seek time and Rotational delay |
| Answer» E. | |
| 144. |
To distinguish between two sectors we make use of _____ |
| A. | Inter sector gap |
| B. | Splitting bit |
| C. | Numbering bit |
| D. | None of the mentioned |
| Answer» B. Splitting bit | |
| 145. |
The method of placing the heads and the discs in an air tight environment is called as _____ |
| A. | RAID Arrays |
| B. | ATP tech |
| C. | Winchester technology |
| D. | Fleming reduction |
| Answer» D. Fleming reduction | |
| 146. |
The data can be accessed from the disk using ___ |
| A. | Surface number |
| B. | Sector number |
| C. | Track number |
| D. | All of the mentioned |
| Answer» E. | |
| 147. |
The set of corresponding tracks on all surfaces of a stack of disks form a ____ |
| A. | Cluster |
| B. | Cylinder |
| C. | Group |
| D. | Set |
| Answer» C. Group | |
| 148. |
A hard disk with 20 surfaces will have _____ heads. |
| A. | 10 |
| B. | 5 |
| C. | 1 |
| D. | 20 |
| Answer» E. | |
| 149. |
___ pushes the heads away from the surface as they rotate at their standard rates. |
| A. | Magnetic tension |
| B. | Electric force |
| C. | Air pressure |
| D. | None of the mentioned |
| Answer» D. None of the mentioned | |
| 150. |
The air pressure can be countered by putting ______ in the head-disc surface arrangement. |
| A. | Air filter |
| B. | Spring mechanism |
| C. | coolant |
| D. | None of the mentioned |
| Answer» C. coolant | |