The following pseudocode constructs a graph from the "Words" dataset. A dictionary wordI is created. Each word in the dictionary, wordI, is considered as a node. The matrix W represents the graph. W[i][j] = 1 if there is an edge from node i to node j. i = 0 wordI = { }, wordF = { } while (Table 1 has more rows) { Read the first row X in Table 1 if (isKey(wordF, X.Word)) { wordF[X.Word] = wordF[X.Word] + 1 } else { wordF[X.Word] = 1 wordI[X.Word] = i i = i + 1 } Move row X to Table 2 } n = length(keys(wordI)) W = createMatrix(n, n) foreach r in keys(wordI) { foreach c in keys(wordI) { if (r ≠ c and wordF[r] ≠ wordF[c] and isSimilar(r, c)) { W[wordI[r]] [wordI[c]] = 1 } } } Procedure isSimilar(P, Q) if (P.PartOfSpeech == Q.PartOfSpeech) { return (True) } else { return (False) } End isSimilar Study the pseudocode above and answer the given subquestions: There will be an edge between word i and word j if and only if:

(D) The part of speech of word i and j are same but both have different frequencies.

(A) The part of speech of word i and j are different but both have the same frequency.

(B) The part of speech of word i and j are same and both have the same frequency.

(C) The part of speech of word i and j are different and both have different frequencies.

Computational Thinking · End Term · 22 Aug 2021 · May 2021 term

Question 17: The following pseudocode constructs a graph from the "Wo…

Question 17

+2 marksOne correct option

The following pseudocode constructs a graph from the "Words" dataset. A dictionary wordI is created. Each word in the dictionary, wordI, is considered as a node. The matrix W represents the graph. W[i][j] = 1 if there is an edge from node i to node j.

text

1i = 0
2wordI = { }, wordF = { }
3while (Table 1 has more rows) {
4    Read the first row X in Table 1
5    if (isKey(wordF, X.Word)) {
6        wordF[X.Word] = wordF[X.Word] + 1
7    }
8    else {
9        wordF[X.Word] = 1
10        wordI[X.Word] = i
11        i = i + 1
12    }
13    Move row X to Table 2
14}
15
16n = length(keys(wordI))
17W = createMatrix(n, n)
18foreach r in keys(wordI) {
19    foreach c in keys(wordI) {
20        if (r ≠ c and wordF[r] ≠ wordF[c] and isSimilar(r, c)) {
21            W[wordI[r]] [wordI[c]] = 1
22        }
23    }
24}
25
26Procedure isSimilar(P, Q)
27    if (P.PartOfSpeech == Q.PartOfSpeech) {
28        return (True)
29    }
30    else {
31        return (False)
32    }
33End isSimilar

Study the pseudocode above and answer the given subquestions:

There will be an edge between word i and word j if and only if:

A
The part of speech of word i and j are different but both have the same frequency.
B
The part of speech of word i and j are same and both have the same frequency.
C
The part of speech of word i and j are different and both have different frequencies.
D
The part of speech of word i and j are same but both have different frequencies.
E
None of these

Show answer

Correct answer

D
The part of speech of word i and j are same but both have different frequencies.

See the whole paper Take it as a mock test

Question 17 of 25 in the IIT Madras BS Computational Thinking (Computational Thinking (CT)) End Term paper sat on 22 Aug 2021, in the May 2021 term (IITM TERM FINAL EXAM POD21TEFNQPA 22 Aug 2021). It carries 2 marks.

Question 17: The following pseudocode constructs a graph from the "Wo…

Question 17

More questions from this paper