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. \]
Suppose a 5-bit message is transmitted from a source to a destination through a noisy channel. The probability that a bit of the message gets flipped during transmission is 0.01. Flipping of each bit is independent of one another. The probability that the message is delivered error-free to the destination is ___________. (rounded off to three decimal places)
The unit interval \((0, 1)\) is divided at a point chosen uniformly distributed over \((0, 1)\) in \(\mathbb{R}\) into two disjoint subintervals. The expected length of the subinterval that contains 0.4 is ___________. (rounded off to two decimal places)
Consider the following C program:
Consider the following C program:
The output of the above program is __________ . (Answer in integer)
An application executes \( 6.4 \times 10^8 \) number of instructions in 6.3 seconds. There are four types of instructions, the details of which are given in the table. The duration of a clock cycle in nanoseconds is ____________. (rounded off to one decimal place)
Let \( \Sigma = \{1,2,3,4\} \). For \( x \in \Sigma^* \), let \( {prod}(x) \) be the product of symbols in \( x \) modulo 7. We take \( {prod}(\epsilon) = 1 \), where \( \epsilon \) is the null string. For example, \[ {prod}(124) = (1 \times 2 \times 4) \mod 7 = 1. \] Define \[ L = \{ x \in \Sigma^* \mid {prod}(x) = 2 \}. \] The number of states in a minimum state DFA for \( L \) is ___________. (Answer in integer)