Let **X** and **Y** be two rows in the "Scores" table. We call **X** and **Y** partially matching if student **X** and **Y**
either have the same **DOB** or are from the same city, but not both.
Let **partialMatch(X, Y)** be a procedure to find whether **X** and **Y** are partially matching. Choose the
correct implementation of the procedure **partialMatch**.
The given pseudocode is executed using the "Words" dataset. At the end of execution **A** captures
the frequency count of the most frequent consonant in the dataset. But the pseudocode may have
mistakes. Identify all such mistakes (if any). Assume that all statements not listed in the options
below are free of errors.
6406536956222.
Line 1: Incorrect initialization of **D**
6406536956223.
Line 8: Incorrect conditional expression
6406536956224.
Line 9: **A** updated with wrong value
6406536956225.
Line 13: Incorrect initialization of **i**
6406536956226.
Line 16: Conditional expression should not use "**not**" operator
6406536956227.
Line 22: **i** updated at wrong place
A published solution is not available for this question yet.
The following pseudocode is executed using the "Library" dataset. At the end of the execution, **A**
stores a dictionary with the author's name as key mapped to the number of books written by
him/her. But the code may have mistakes. Identify all such mistakes (if any). Assume that all
statements not listed in the options below are free of errors.
6406536956210.
Replacing the condition given in line 4 with the statement given below will
provide the correct result.
6406536956211.
Interchanging Line 4 and 7 will provide the correct result.
6406536956212.
Interchanging Line 5 and 8 will provide the correct result.
6406536956213.
The pseudocode will provide the correct result even without getting modified.
A published solution is not available for this question yet.
The following pseudocode is executed using the "Words" dataset. Assume that the rows in the
table are sorted in the ascending order of sequence number. What does **outList** represent at the
end of execution?
6406536956234.
**outList** represents a list of lists
6406536956235.
Each element in **outList** represents a list containing words and their parts of
speech from a sentence except for the adjectives
6406536956236.
Each element in **outList** corresponds to one word from the paragraph
6406536956237.
Each element in **outList** represents the words from a sentence that have part
of speech 'adjective'
A published solution is not available for this question yet.
The following pseudocode is executing using the “Scores” table. At the end of the
execution,**matrix** represents the adjacency matrix of the graph generated from the “Scores” table.
Based on the above data, answer the given subquestions.
If **matrixPh[i] [j]** = 1, then:
6406536956249.
**i** scored at most 10 and at least 20 more marks in Physics than **j**
6406536956250.
**i** scored at least 10 and at most 20 more marks in Physics than **j**
6406536956251.
**j** scored at least 10 and at most 20 more marks in Physics than **i**
6406536956252.
**j** scored at most 10 and at least 20 more marks in Physics than **i**
A published solution is not available for this question yet.
The following pseudocode is executing using the “Scores” table. At the end of the
execution,**matrix** represents the adjacency matrix of the graph generated from the “Scores” table.
Based on the above data, answer the given subquestions.
Choose the correct statement based on the main data pseudocode.
6406536956253.
For all **i, j** with **i ≠ j**,
+
= 1
6406536956254.
For all **i, j** with **i ≠ j**, if
= 1 then
= 0
6406536956255.
For all **i, j** with **i ≠ j**, if
= 0 then
= 1
6406536956256.
For all **i, j** with **i ≠ j**, if
= 1 then
= 1
6406536956257.
For all **i, j** with **i ≠ j**, if
= 0 then
= 0
A published solution is not available for this question yet.