A quadratic polynomial \( (x - \alpha)(x - \beta) \) over complex numbers is said to be square invariant if \[ (x - \alpha)(x - \beta) = (x - \alpha^2)(x - \beta^2). \] Suppose from the set of all square invariant quadratic polynomials we choose one at random. The probability that the roots of the chosen polynomial are equal is ___________. (rounded off to one decimal place)
Given that the quadratic polynomial satisfies the square invariance property: \[ (x - \alpha)(x - \beta) = (x - \alpha^2)(x - \beta^2). \] Expanding both sides, we get: \[ x^2 - (\alpha + \beta)x + \alpha\beta = x^2 - (\alpha^2 + \beta^2)x + \alpha^2\beta^2. \] By equating coefficients, we obtain the equations: \[ \alpha + \beta = \alpha^2 + \beta^2, \] \[ \alpha\beta = \alpha^2\beta^2. \] Step 1: Solving for equal roots For equal roots, we assume \( \alpha = \beta \). Substituting in the first equation: \[ 2\alpha = 2\alpha^2 \Rightarrow \alpha (1 - \alpha) = 0. \] Thus, \( \alpha = 0 \) or \( \alpha = 1 \).
Step 2: Probability Calculation Among all possible values of \( \alpha, \beta \) satisfying the quadratic constraints, half of them lead to equal roots. Therefore, the required probability is: \[ \frac{1}{2} = 0.5. \]
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).