Consider the relationships among P, Q, R, S, and T:
• P is the brother of Q.
• S is the daughter of Q.
• T is the sister of S.
• R is the mother of Q.
The following statements are made based on the relationships given above.
(1) R is the grandmother of S.
(2) P is the uncle of S and T.
(3) R has only one son.
(4) Q has only one daughter.
Which one of the following options is correct?
In a small town lived a close-knit family where every relation could be expressed through simple symbols. For instance, when they said \( A \times B \), it meant \( A \) is the father of \( B \), while \( A \div B \) meant \( A \) is the mother of \( B \). The younger ones were often introduced with \( A + B \), meaning \( A \) was the daughter of \( B \), and the bond of brotherhood was shown by \( A - B \) (A is brother of B).
One day, the children in the family turned these symbols into a playful code. Instead of introducing their parents and siblings in words, they spoke only in symbols. “Look,” giggled little Meena, “\( M + N \div O \)!” Everyone laughed, because they knew it meant Meena was the daughter of \( N \), and \( N \) was the mother of \( O \), making her \( O \)’s sister. What started as a code soon became a family game, making the bonds of father, mother, daughter, and brother not just relations, but symbols of love and togetherness. (165 words)
Consider the relationships among P, Q, R, S, and T:
• P is the brother of Q.
• S is the daughter of Q.
• T is the sister of S.
• R is the mother of Q.
The following statements are made based on the relationships given above.
(1) R is the grandmother of S.
(2) P is the uncle of S and T.
(3) R has only one son.
(4) Q has only one daughter.
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).