Let **X** and **Y** be two rows in the "Scores" table. We call **X** and **Y** partially matching if student **X** and **Y**
are either have the same **Total Marks** 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**.
Consider a graph generated from the "Scores" table that is represented by a matrix B. Each node
in the graph corresponds to a student from the table. SeqNo is used to label the nodes in the
graph. Which of the following statements are true about this graph?
6406536924224.
There are two cliques in this graph, one for each gender.
6406536924225.
In every clique, there is at least a pair of students having different genders.
6406536924226.
All students in a given clique have the same gender.
6406536924227.
All students in a given clique are from the same city/town.
6406536924228.
There are no cliques in this graph.
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?
6406536924261.
**outList** represents a list of lists
6406536924262.
Each element in **outList** represents a list containing words and their letter
counts from a sentence except for the adjectives
6406536924263.
Each element in **outList** corresponds to one word from the paragraph
6406536924264.
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 given pseudocode is executed using the "Words" dataset. At the end of execution **A** captures
the frequency count of the least 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.
6406536924249.
Line 1: Incorrect initialization of **A**
6406536924250.
Line 8: Incorrect conditional expression
6406536924251.
Line 9: **A** updated with wrong value
6406536924252.
Line 13: Incorrect initialization of **i**
6406536924253.
Line 16: Conditional expression should not use "**not**" operator
6406536924254.
Line 22: **i** updated at wrong place
A published solution is not available for this question yet.
In the following pseudocode:
• graph is a matrix
• parents is a dictionary
• sequence is a list
Consider the following graph with six nodes. **A** is the **6 × 6** adjacency matrix corresponding to this
graph.
Assume that it has already been computed:
In given subquestions, **S** represents a list, **P** represents a dictionary, while **A** represents adjacency
matrix of the above graph.
Based on the above data, answer the given subquestions.
What will be the value of S after executing the following pseudocode?
6406536924271.
[0, 1, 2, 5, 3, 4]
6406536924272.
[0, 1, 4]
6406536924273.
[0, 1, 2, 3, 5, 4]
6406536924274.
[0, 3, 1, 4, 5]
A published solution is not available for this question yet.
In the following pseudocode:
• graph is a matrix
• parents is a dictionary
• sequence is a list
Consider the following graph with six nodes. **A** is the **6 × 6** adjacency matrix corresponding to this
graph.
Assume that it has already been computed:
In given subquestions, **S** represents a list, **P** represents a dictionary, while **A** represents adjacency
matrix of the above graph.
Based on the above data, answer the given subquestions.
What will be the value of nodes after executing the following pseudocode?
6406536924275.
[5, 2, 1, 0, 3, 4]
6406536924276.
[5, 2, 1, 4, 0, 3]
6406536924277.
[5, 2, 3, 0, 1, 4]
6406536924278.
Cannot be determined
A published solution is not available for this question yet.