Question:
Consider the following Python code snippet.
\[
A = \{\text{"this"}, \text{"that"}\}, \quad B = \{\text{"that"}, \text{"other"}\}, \quad C = \{\text{"other"}, \text{"this"}\}
\]
\[
\text{while "other" in C:}
\]
\[
\quad \text{if "this" in A:}
\]
\[
\quad \quad A, B, C = A - B, B - C, C - A
\]
\[
\quad \text{if "that" in B:}
\]
\[
\quad \quad A, B, C = C | A, A | B, B | C
\]
When the above program is executed, at the end, which of the following sets contains "this"?
Consider the following Python code snippet.
\[
A = \{\text{"this"}, \text{"that"}\}, \quad B = \{\text{"that"}, \text{"other"}\}, \quad C = \{\text{"other"}, \text{"this"}\}
\]
\[
\text{while "other" in C:}
\]
\[
\quad \text{if "this" in A:}
\]
\[
\quad \quad A, B, C = A - B, B - C, C - A
\]
\[
\quad \text{if "that" in B:}
\]
\[
\quad \quad A, B, C = C | A, A | B, B | C
\]
When the above program is executed, at the end, which of the following sets contains "this"?
Show Hint
In Python, set operations such as union (\(|\)) and difference (\(-\)) can modify sets in place. The "in" operator checks whether an element exists in a set, and set operations like union and difference are commonly used for solving problems involving sets.
Updated On: Apr 4, 2025
- Only A
- Only B
- Only C
- A, C
Hide Solution
Verified By Collegedunia
The Correct Option is B
Solution and Explanation
The initial sets are \( A = \{ \text{"this"}, \text{"that"} \} \), \( B = \{ \text{"that"}, \text{"other"} \} \), and \( C = \{ \text{"other"}, \text{"this"} \} \). After executing the program and performing the set operations within the while loop, the sets are updated as follows:
\( A = \{ \text{"other"}, \text{"this"} \} \)
\( B = \{ \text{"that"}, \text{"other"}, \text{"this"} \} \)
\( C = \{ \text{"that"}, \text{"other"}, \text{"this"} \} \)
Thus, "this" is found in set \( B \) at the end of the program execution.
The correct answer is Option (B).
\( A = \{ \text{"other"}, \text{"this"} \} \)
\( B = \{ \text{"that"}, \text{"other"}, \text{"this"} \} \)
\( C = \{ \text{"that"}, \text{"other"}, \text{"this"} \} \)
Thus, "this" is found in set \( B \) at the end of the program execution.
The correct answer is Option (B).
Was this answer helpful?
0
0
Top Questions on Programming in Python
- Consider the following Python declarations of two lists.
\[ A = [1, 2, 3] \quad \text{and} \quad B = [4, 5, 6]. \] Which one of the following statements results in \( A = [1, 2, 3, 4, 5, 6] \)?- GATE DA - 2025
- Data Science and Artificial Intelligence
- Programming in Python
- Consider the following sets: \[ A = \{"this", "that"\}, \quad B = \{"that", "other"\}, \quad C = \{"other", "this"\} \]
Which of the following sets remain non-empty at the end?- GATE DA - 2025
- Data Science and Artificial Intelligence
- Programming in Python
- Given the lists: \[ A = [1,2,3], \quad B = [4,5,6] \] Which of the following statements will result in \[ A = [1,2,3,4,5,6]? \]
- GATE DA - 2025
- Data Science and Artificial Intelligence
- Programming in Python
- Consider the following Python function :
def fun (D, s1, s2) :
if s1 s2:
D[s1], D[s2] = D[s2], D[sl]
fun (D, s1+1, s2-1)
What does this Python function fun () do? Select the ONE appropriate option below.- GATE AR - 2024
- Data Science and Artificial Intelligence
- Programming in Python
- Consider the following Python code :
def count (child_dict, i) :
if i not in child_dict.keys() :
return 1
ans = 1
for j in child_dict[i] :
ans += count (child_dict, j)
return ans
child_dict = dict()
child_dict [0] = [1, 2]
child_dict [1] = [3, 4, 5]
child_dict [2] = [6, 7, 8]
print (count(child_dict,0))
Which ONE of the following is the output of this code ?- GATE AR - 2024
- Data Science and Artificial Intelligence
- Programming in Python
View More Questions
Questions Asked in GATE DA exam
- Given the equation: $$ 3^{x^2} = 27 \times 9^x $$ Find the value of: $$ \frac{2^{x^2}}{(2^x)^2} $$
- GATE DA - 2025
- Algebra
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
View More Questions