Step 1: Rewrite functions in exponential form.
We rewrite each function using exponentials to compare growth rates:
\[
f_2 = n^{\log n} = e^{(\log n)^2},
f_3 = n^{\sqrt{n}} = e^{\sqrt{n}\log n},
f_1 = 10^n = e^{n\log 10}.
\]
Step 2: Compare exponents.
\[
(\log n)^2 \ll \sqrt{n}\log n \ll n.
\]
Hence, \( f_2 \) grows slower than \( f_3 \), and \( f_3 \) grows slower than \( f_1 \).
Step 3: Arrange in increasing order.
\[
f_2 < f_3 < f_1.
\]
Consider the following recurrence relation.
\[ T(n) = \begin{cases} T(n/2) + T(2n/5) + 7n, & \text{if } n > 0 \\ 1, & \text{if } n = 0 \end{cases} \] Which one of the following options is correct?
In a 4-bit ripple counter, if the period of the waveform at the last flip-flop is 64 microseconds, then the frequency of the ripple counter in kHz is ______________. {(Answer in integer)}
Consider the following C code segment:
int x = 126, y = 105;
do {
if (x > y)
x = x - y;
else
y = y - x;
} while (x != y);
printf("%d", x);
The output of the given C code segment is ____________. (Answer in integer)
The following two signed 2’s complement numbers (multiplicand \( M \) and multiplier \( Q \)) are being multiplied using Booth’s algorithm:
| Multiplicand (\( M \)) | Multiplier (\( Q \)) |
|---|---|
| 1100 1101 1110 1101 | 1010 0100 1010 1010 |
The total number of addition and subtraction operations to be performed 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).