Project Part 3: Writing Pseudocode
Throughout this course project, we have been applying computational thinking to solve the problem of counting the number of occurrences of a word and its synonyms in a corpus of text documents.
In Part 1, we applied the pillars of computational thinking to decompose this problem into two smaller problems, then used pattern recognition to find commonalities between the problems, used data representation and abstraction to identify the data we needed, and developed an algorithm.
In Part 2, we represented that algorithm using a flowchart as follows:
Now, write the pseudocode for this algorithm, based on the flowchart and using the notation we have seen in previous activities.
In writing the pseudocode, you should use the following variables:
Keyword, which is the word to search for
Thesaurus, which is a collection of Entry objects, each of which has a Word attribute and an attribute called Synonyms, which is a collection of Word objects
Corpus, which is a collection of Document objects, each of which is a collection of Word objects
As in Part 2, you may assume that:
The Thesaurus is not empty, i.e., there is at least one Entry in the Thesaurus.
The Corpus is not empty, i.e., there is at least one Document in the Corpus.
Each Document contains at least one Word.
Hint: Review the pseudocode for algorithms and flowcharts we’ve previously seen, e.g., linear search and counting the number of occurrences of something in a collection, and see which patterns occur in those flowcharts and in this one.
