A deck of playing cards contains 52 cards, 4 each with face values in the set {A, 2, 3, 4, 5, 6, 7, 8, 9, 10, J, Q, K}. Let us define face values of the top and bottom cards as X and Y. The shuffling algorithm is defined as follows : Sh1 : Permute the cards randomly due to that each arrangement occurs with probability \(1/52!\) Sh2 : If \(X \ne Y\), flip the biased coin that comes up heads with probability P and go back to Sh1 if heads turns up otherwise stop. Each coin flip and each permutation is assumed to be independent of all the other randomization. What value of P will make X and Y independent random variables once this process of shuffling will stops ?
\(P = 1/4\)
For X and Y to be independent at the end, every ordered pair of face values (a, b) must finally occur with probability \(\frac{1}{13} \cdot \frac{1}{13} = \frac{1}{169}\), since each face value appears equally often in the deck and the marginals are uniform by symmetry.
In one random permutation, the probability that the top and bottom cards are a particular equal pair (a, a) is \(\frac{4 \times 3}{52 \times 51} = \frac{12}{2652}\), and for a particular unequal pair (a, b) it is \(\frac{4 \times 4}{52 \times 51} = \frac{16}{2652}\).
If X = Y the process always stops. If \(X \ne Y\) it stops only when the coin shows tails, with probability \(1 - P\); otherwise the deck is reshuffled and the trial repeats independently.
So the final probability of each pair is proportional to its stopping weight: \(12\) for an equal pair and \(16(1 - P)\) for an unequal pair.
All pairs become equally likely, and hence X and Y independent, exactly when \(12 = 16(1 - P)\), i.e. \(1 - P = \frac{3}{4}\), which gives \(P = \frac{1}{4}\).
Check: with \(P = \frac{1}{4}\) the unequal weight is \(16 \times \frac{3}{4} = 12\), equal to the equal-pair weight, so all 169 pairs share probability \(\frac{1}{169}\), and \(P(X = a, Y = b) = P(X = a) \, P(Y = b)\) holds.
Hence, \(P = 1/4\).
Let \(\varphi, \psi\) be the formula, \(\varphi \models \Psi\), if and only if \(\varphi \models \Psi\) is a :
Which of the following relations defined on X = {1, 2, 3} is an equivalent relation ?
A rod is divided into six segment is to be colored with one or more of 4 different colors. In how many ways can this be done ?
Consider the following linear programming problem : Maximize \(z = 5x_{1} + 2x_{2} + 3x_{3} - x_{4} + x_{5}\) Subject to : \(x_{1} + 2x_{2} + 2x_{3} + x_{4} = 8\), \(3x_{1} + 4x_{2} + x_{3} + x_{5} = 7\), \(x_{1}, x_{2}, x_{3}, x_{4}, x_{5} \geq 0\) What will be the basic feasible solution after iteration 1 ?
The thickness of a graph G is defined as minimum number of (edge-disjoint) planar subgraphs into which G can be decomposed. The thickness of G is defined as \(\theta(G)\). What is the thickness of planar graph ?
A committee is to be selected from 5 candidates a, b, c, d and e. The selection must satisfy all the following conditions :
• Either a or b must be included, but not both
• Either c or e or both must be included
• If d is included then b must be included
• Either a or c are included or neither is included.
• If e is included, then c and d must be included. How should selection be made ?
Let us consider the letters from a through h, and all 5 letters are made using these letters. (words are just strings of letters). How many of these words contain no repeated letters ?
Let us consider the following primal problem : Maximize \(z = 2x_{1} + x_{2}\) Subject to \(x_{1} - x_{2} \leq 4\), \(x_{1} - x_{2} \leq 2\), \(x_{1}, x_{2} \geq 0\) What will be its dual problem ?
Identify an appropriate operation sequence with respect to execution of a machine level language instruction.
The “instruction decode” phase in CPU’s instruction cycle is responsible to _____ .
.................... is a client server application that identifies each host on the internet with a unique user-friendly name.
Every OS has a ................ or .......... which primarily resides in the main memory of the computer to perform some of the basic functions of the OS.
(i) Kernel
(ii) Interface
(iii) Nucleus
(iv) Compiler
Codes:
Which of the following are referred to as low level language?
(i) Machine language
(ii) Assembly language
(iii) High level language
(iv) Natural language
Codes:
Match the following:
| List I | List II |
| (a) New York Public Library | (i) Shelv AR |
| (b) Miami University Augmented Research Group | (ii) Smart library |
| (c) Oula University Library | (iii) Wolf Walk |
| (d) North Carolina State University | (iv) Find the future |
Codes:
Which part of the QR code represents the encoded data?