Exercise 4.1If we need T log2T comp

Exercise 4.1
If we need T log2
T comparisons (where T is the number of termID–docID pairs) and
two disk seeks for each comparison, how much time would index construction for
Reuters-RCV1 take if we used disk instead of memory for storage and an unoptimized sorting algorithm (i.e., not an external sorting algorithm)? Use the system
parameters in Table 4.1.
Exercise 4.2 [⋆]
How would you create the dictionary in blocked sort-based indexing on the fly to
avoid an extra pass through the data?

Results (English) 2:

Exercise 4.1
If we Need T log2
T comparisons (Where T is The number of Termid-docid Pairs) and
Two Disk seeks for each comparison, How much time would index Construction for
Reuters-RCv1 Take IF we Used Disk Instead of memory for Storage and. an unoptimized sorting algorithm (ie, not an external sorting algorithm)? Use The System
Parameters in Table 4.1.
Exercise 4.2 [⋆]
How would You create Blocked The dictionary in sort-based Indexing on The FL Y to
Avoid an extra Pass Through The Data?