We ____________ tennis in the lawn when it suddenly started to rain.
Select the most appropriate option to complete the above sentence.
We ____________ tennis in the lawn when it suddenly started to rain.
Select the most appropriate option to complete the above sentence.
Show Hint
- have been playing
- had been playing
- would have been playing
- could be playing
The Correct Option is B
Solution and Explanation
The sentence describes an action that was happening in the past and was interrupted by another event. The phrase "when it suddenly started to rain" suggests that the action of playing tennis was ongoing at the time the rain started. This points to the past perfect continuous tense, which is used to describe an action that was happening continuously before another past action interrupted it.
Step 2: Analyzing the Options:
Option (A) "have been playing": This is the present perfect continuous tense, which indicates an action that started in the past and continues into the present. Since the sentence is referring to a past event, this is not correct.
Option (B) "had been playing": This is the past perfect continuous tense, which correctly describes an action that was happening continuously in the past before another past event (the rain) interrupted it. This is the correct choice.
Option (C) "would have been playing": This is the conditional perfect continuous tense, typically used to describe hypothetical situations or actions that would have happened under different conditions. This is not appropriate for the sentence.
Option (D) "could be playing": This suggests possibility in the present, which is incorrect because the sentence is referring to a past event.
Therefore, the most appropriate option is (B) had been playing.
Top Questions on Tenses
Questions Asked in GATE DA exam
Consider a directed graph \( G = (V,E) \), where \( V = \{0,1,2,\dots,100\} \) and
\[ E = \{(i,j) : 0 < j - i \leq 2, \text{ for all } i,j \in V \}. \] Suppose the adjacency list of each vertex is in decreasing order of vertex number, and depth-first search (DFS) is performed at vertex 0. The number of vertices that will be discovered after vertex 50 is:- GATE DA - 2025
- Data Structures
- Consider the following pseudocode.
Create empty stack S Set x = 0, flag = 0, sum = 0 Push x onto S while (S is not empty){ if (flag equals 0){ Set x = x + 1 Push x onto S } if (x equals 8): Set flag = 1 if (flag equals 1){ x = Pop(S) if (x is odd): Pop(S) Set sum = sum + x } } Output sumThe value of \( sum \) output by a program executing the above pseudocode is:- GATE DA - 2025
- Data Structures
- Consider the following Python code snippet.
def f(a, b): if (a == 0): return b if (a % 2 == 1): return 2 * f((a - 1) / 2, b) return b + f(a - 1, b) print(f(15, 10))The value printed by the code snippet is 160 (Answer in integer).- GATE DA - 2025
- Recursion
Consider the following tables, Loan and Borrower, of a bank.
Query: \[ \pi_{\text{branch\_name}, \text{customer\_name}} (\text{Loan} \bowtie \text{Borrower}) \div \pi_{\text{branch\_name}}(\text{Loan}) \] where \( \bowtie \) denotes natural join. The number of tuples returned by the above relational algebra query is 1 (Answer in integer).- GATE DA - 2025
- Relational Algebra
- Let \( D = \{ x^{(1)}, x^{(2)}, \dots, x^{(n)} \} \) be a dataset of \( n \) observations where each \( x^{(i)} \in \mathbb{R}^{100} \). It is given that
\[ \sum_{i=1}^{n} x^{(i)} = 0. \] The covariance matrix computed from \( D \) has eigenvalues \( \lambda_i = 100^2 - i \), for \( 1 \leq i \leq 100 \). Let \( u \in \mathbb{R}^{100} \) be the direction of maximum variance with \( u^T u = 1 \). The value of
\[ \frac{1}{n} \sum_{i=1}^{n} \left( u^T x^{(i)} \right)^2 = \underline{\hspace{2cm}} \quad \text{(Answer in integer)} \]- GATE DA - 2025
- Matrix algebra