List of top Computer Awareness Questions asked in NIMCET

Match all items in Group 1 with correct options from those given in Group 2: 
\[ \begin{array}{|c|c|} \hline \textbf{Group 1} & \textbf{Group 2} \\ \hline P. \text{ Intermediate representation} & 1. \text{ Activation records} \\ \hline Q. \text{ Top-down parsing} & 2. \text{ Code generation} \\ \hline R. \text{ Runtime environments} & 3. \text{ Leftmost derivation} \\ \hline S. \text{ Register Allocation} & 4. \text{ Graph colouring} \\ \hline \end{array} \]

Given an unsigned 32-bit integer \( x \), which of the following C/C++ expressions correctly toggles its bits starting from position \( p \) (with the least significant bit at position 0)? 

Assume: \( x \) is the input integer; \( p \) is the starting position of the bit range (0-based, LSB at position 0); \( m \) is the number of bits to toggle; and no overflow or invalid input conditions occur. Which of the following correctly toggles \( m \) bits starting from position \( p \)?

Consider the program below which uses six temporary variables a, b, c, d, e and f.
a = 10
b = 20
c = 30
d = a + c
e = b + d
f = c + c
b = c + e
e = b + f
d = 5 + e
return d + f
Assuming that all the above operations take their operands from registers, the minimum number of registers needed to execute this program without spilling is: