List of practice Questions

Consider the following statements about the use of backpatching in a compiler for intermediate code generation:
1. Backpatching can be used to generate code for Boolean expressions in one pass.
2. Backpatching can be used to generate code for flow-of-control statements in one pass.
Which ONE of the following options is CORRECT?

Consider an unordered list of $N$ distinct integers. What is the minimum number of element comparisons required to find an integer in the list that is NOT the largest in the list?

Consider the following C program:

A machine receives an IPv4 datagram. The protocol field of the IPv4 header has the protocol number of a protocol X. Which ONE of the following is NOT a possible candidate for X?

Consider the routing protocols given in List I and the names given in List II:

For matching of items in List I with those in List II, which ONE of the following options is CORRECT?

Consider the following statements:

Which ONE of the following is CORRECT?

Let $ P(x) $ be an arbitrary predicate over the domain of natural numbers. Which ONE of the following statements is TRUE?

For a direct-mapped cache, 4 bits are used for the tag field and 12 bits are used to index into a cache block. The size of each cache block is one byte. Assume that there is no other information stored for each cache block. Which ONE of the following is the CORRECT option for the sizes of the main memory and the cache memory in this system (byte addressable), respectively?

Suppose we are transmitting frames between two nodes using the Stop-and-Wait protocol. The frame size is 3000 bits. The transmission rate of the channel is 2000 bps (bits/second) and the propagation delay between the two nodes is 100 milliseconds. Assume that the processing times at the source and destination are negligible. Also, assume that the size of the acknowledgement packet is negligible. Which ONE of the following most accurately gives the channel utilization for the above scenario in percentage?

Consider a network that uses Ethernet and IPv4. Assume that IPv4 headers do not use any options field. Each Ethernet frame can carry a maximum of 1500 bytes in its data field. A UDP segment is transmitted. The payload (data) in the UDP segment is 7488 bytes. Which ONE of the following choices has the CORRECT total number of fragments transmitted and the size of the last fragment including IPv4 header?

Consider a binary tree $ T $ in which every node has either zero or two children. Let $ n%gt;0 $ be the number of nodes in $ T $. Which ONE of the following is the number of nodes in $ T $ that have exactly two children?

Let $ L, M, $ and $ N $ be non-singular matrices of order 3 satisfying the equations: \[ L^2 = L^{-1}, \quad M = L^8, \quad N = L^2. \] Which ONE of the following is the value of the determinant of $ (M - N) $?

The value of $ x $ such that $ x%gt;1 $ , satisfying the equation \[ \int_{1}^{x} t \ln t \, dt = 1 \] is

For positive integers $ n $, if $ 4 a_n = \frac{n^2 + 5n + 6}{4} $ and $$ S_n = \sum_{k=1}^{n} \left( \frac{1}{a_k} \right), \text{ then the value of } 507 S_{2025} \text{ is:} $$

The total number of 10-digit sequences formed by only $ \{0, 1, 2\} $, where 1 should be used at least 5 times and 2 should be used exactly three times, is:

Which of the following is the correct order of basic strength of amines in aqueous medium?

Consider the following C code:

int main() {
    sum = 0;
    for (n = 1; n < 3; n++) {
        n++;
        sum += g(f(n));
    }
    printf("%d", sum);
}

int g(n) {
    return 10 + n;
}

int f(n) {
    return g(2 * n);
}

What is the output?

A certain reaction is 50 complete in 20 minutes at 300 K and the same reaction is 50 complete in 5 minutes at 350 K. Calculate the activation energy if it is a first order reaction. Given: \[ R = 8.314 \, \text{J K}^{-1} \, \text{mol}^{-1}, \quad \log 4 = 0.602 \]

The value printed by the given C program is __________ (Answer in integer).

Refer to the given 3-address code sequence. This code sequence is split into basic blocks. The number of basic blocks is __________. (Answer in integer)
1001: i = 1
1002: j = 1
1003: t1 = 10i
1004: t2 = t1+j
1005: t3 = 8t2
1006: t4 = t3-88
1007: a[t4] = 0.0
1008: j = j+1
1009: if j <= 10 goto 1003
1010: i = i+1
1011: if i <= 10 goto 1002
1012: i = 1
1013: t5 = i-1
1014: t6 = 88t5
1015: a[t6] = 1.0
1016: i = i+1
1017: if i <= 10 goto 1013

Suppose in a multiprogramming environment, the following C program segment is executed. A process goes into the I/O queue whenever an I/O related operation is performed. Assume that there will always be a context switch whenever a process requests an I/O, and also whenever the process returns from an I/O. The number of times the process will enter the ready queue during its lifetime (not counting the time the process enters the ready queue when it is run initially) is _________ (Answer in integer).

The maximum value of $x$ such that the edge between the nodes B and C is included in every minimum spanning tree of the given graph is ___________ (answer in integer).

Consider the following C program

The value printed by the given C program is _________ (Answer in integer).