The four pieces of a puzzle are shown in the figure below.

Which one of the figures labelled as P, Q, R, and S can be constructed by using each of the four pieces only once without overlaps?

Figure P

Figure Q

Figure R

Figure S
This question checks visual assembly, fitting four irregular black pieces together, edge to edge with no gaps and no overlaps, to recreate one of the four candidate silhouettes. The four given pieces are a rounded piece with a smooth curved bite cut into one edge, a dome shaped piece with a matching curved notch, a piece with a jagged zig-zag edge, and a piece shaped like twin triangular peaks (a small peak beside a taller one).
Each candidate silhouette (P, Q, R, S) shows a bird-like outline: a round head, a pointed beak on the right, and an angular body below, joined by a jagged little step where the head meets the body. The four pieces must combine, without stretching past what their true edges allow, to trace out that exact outline.
Only Figure P uses every edge of the four pieces exactly once, in a way that closes up cleanly with no leftover gaps or overlaps.
Let's summarize:
The correct figure is P.
Verbosity : Brevity :: Insolence : __________
Choose the word that best fills the blank.
The product of the digits of a three-digit number is 70. The sum of the digits of this three-digit number is _____
'If his latest movie had been a commercial success, the actor would have made enough money to sponsor his next movie.'
Based only on the above sentence, which one of the following statements is true?
Rishi and Swathi are students of Class 5. Pavan and Tanvi are students of Class 4. Rishi and Pavan are boys. Swathi and Tanvi are girls. The four students played a total of three games of chess. The games were played one after another. A player who lost a game did not participate in any more games. It was observed that:
The student who did not lose any game is __________.
| Column 1 | Column 2 | ||
| (p) | First In First Out | (i) | Stacks |
| (q) | Lookup Operation | (ii) | Queues |
| (r) | Last In First Out | (iii) | Hash Tables |