✅ Correct statements: P, Q, and S
Let’s first convert both binary numbers into decimal (two’s complement form):
Add them:
$A + B = -103 + (-41) = -144$
Now, in 8-bit two’s complement, the range is $-128$ to $+127$. Since $-144$ is out of range, overflow occurs.
But let’s compute the 8-bit result (ignoring overflow):
$10011001 + 11010111 =$
10011001
+ 11010111
= 101110000 (9 bits)
Drop the carry beyond 8 bits → 01110000.
Therefore, the resulting 8-bit binary value is:
✅ Result = 01110000₂
(Overflow occurred, actual signed result would have been −144, but the 8-bit stored value is +112.)
✅ Correct statements: 1, 2, and 4
Memory size $=512\text{ KB}=2^{19}$ bytes $\Rightarrow$ address field needs $19$ bits.
Registers $=6 \Rightarrow$ bits per register $=\lceil \log_2 6\rceil=3$ bits. For two registers $\Rightarrow 2\times3=6$ bits.
Total operand bits $=19+6=25$.
Opcode bits $=32-25=7 \Rightarrow$ maximum distinct instructions $=2^{7}= {128}$.
| GROUP 1 | GROUP 2 |
| P. Intermediate representation | 1. Activation records |
| Q. Top-down parsing | 2. Code generation |
| R. Runtime environments | 3. Leftmost derivation |
| S. Register allocation | 4. Graph colouring |
| Group 1 | Group 2 (Match) | Explanation |
|---|---|---|
| P. Intermediate representation | → 2. Code generation | Intermediate representation (IR) is the form of code produced by the front end of a compiler and used as input to the code generation phase. |
| Q. Top-down parsing | → 3. Leftmost derivation | Top-down parsers construct a parse tree from the root using leftmost derivations. |
| R. Runtime environments | → 1. Activation records | Activation records (stack frames) are part of the runtime environment used to manage function calls and local variables. |
| S. Register allocation | → 4. Graph colouring | Register allocation is commonly implemented using graph-colouring algorithms to assign variables to CPU registers efficiently. |
✅ Final Matching:
P – 2, Q – 3, R – 1, S – 4
Among the given secondary storage devices, the access time comparison is as follows:
✅ Correct Answer: Solid State Drive (SSD)
For an n-bit system:
(9-bit means sign + 8 magnitude bits.)
Solution:
✅ Correct Answer: (1) Unicode is backward compatible with ASCII and includes all ASCII characters in its encoding.
Online Test Series, Information About Examination,
Syllabus, Notification
and More.
Online Test Series, Information About Examination,
Syllabus, Notification
and More.