CS 3308 GRADED QUIZ UNIT 5 RESULTS | QUESTIONS AND ANSWERS | 2026
UPDATE | 100% CORRECT.
Dashboard / My courses / CS 3308-01 - AY2023-T February
- 1 March / Graded Quiz Unit 5
Started on Sunday, 26 February 2025, 12:54 PM
Completed on Sunday, 26 February 2025, 1:13 PM
Time taken 19 mins 5 secs
Marks 2200/22.00
Grade 100.00 out of 100.00
Question 1
Correct
Mark 1.00 out of 1.00
e ————
True/False: The purpose of the inverse document frequency is to increase the weight of terms with high collection frequency.
Select one:
True
False v
Question 2
Correct
Mark 1.00 out of 1.00
The number of times that a word or term occurs in a document is called the:
Select one:
a. Proximity Operator
b. Vocabulary Lexicon
¢ TermFrequency ¥
Indexing
o
e Granularity
, Question 3
Correct
Mark 1.00 out of 1.00
In information retrieval, extremely common words which would appear to be of little value in helping select documents that are
excluded from the index vocabulary are called:
Select one:
a. Stop Words ™"
b. Tokens
c. Lemmatized Words
d. Stemmed Terms
Question 4
Correct
Mark 1.00 out of 1.00
For a small collection of documents on a personal computer that don't experience any change the most appropriate indexing
algorithm would be:
Select one:
a Block sort-based indexing algorithm ¥
b. Single-pass in memory indexing algorithm
Distributed Map-Reduce indexing algorithm
o
Dynamic indexing process employing an auxiliary index
a
Question 5
Correct
Meark 1.00 out of 1.00
A compression algorithm that results in some loss of data is called:
Select one:
a. zipf compression
b. dictionary compression
c. lossless compression
d lossy compression ¥
UPDATE | 100% CORRECT.
Dashboard / My courses / CS 3308-01 - AY2023-T February
- 1 March / Graded Quiz Unit 5
Started on Sunday, 26 February 2025, 12:54 PM
Completed on Sunday, 26 February 2025, 1:13 PM
Time taken 19 mins 5 secs
Marks 2200/22.00
Grade 100.00 out of 100.00
Question 1
Correct
Mark 1.00 out of 1.00
e ————
True/False: The purpose of the inverse document frequency is to increase the weight of terms with high collection frequency.
Select one:
True
False v
Question 2
Correct
Mark 1.00 out of 1.00
The number of times that a word or term occurs in a document is called the:
Select one:
a. Proximity Operator
b. Vocabulary Lexicon
¢ TermFrequency ¥
Indexing
o
e Granularity
, Question 3
Correct
Mark 1.00 out of 1.00
In information retrieval, extremely common words which would appear to be of little value in helping select documents that are
excluded from the index vocabulary are called:
Select one:
a. Stop Words ™"
b. Tokens
c. Lemmatized Words
d. Stemmed Terms
Question 4
Correct
Mark 1.00 out of 1.00
For a small collection of documents on a personal computer that don't experience any change the most appropriate indexing
algorithm would be:
Select one:
a Block sort-based indexing algorithm ¥
b. Single-pass in memory indexing algorithm
Distributed Map-Reduce indexing algorithm
o
Dynamic indexing process employing an auxiliary index
a
Question 5
Correct
Meark 1.00 out of 1.00
A compression algorithm that results in some loss of data is called:
Select one:
a. zipf compression
b. dictionary compression
c. lossless compression
d lossy compression ¥