I have some question on the programming part of the homework.
I got 2 and 3.
For first one, Does it mean we need to read all files (not only the .txt files) in the path_to_folder_to_index and check if they're text-based files or not. Then index the text-based files? Am I correct?
For Problem 7.3, is the expectation that we figure out the performance gain hidden in the O-notation AND do the proof as described in the original problem? Or just figure out the performance gain hidden in the O-notation?
@xianghong yes
@sshahab You should prove a Theta result, not just an O result. The goal is not to figure out the performance gain hidden in the constants so much as to show the performance gain is within a constant factor.
For the first part of the programming assignment, in order to calculate Mopt, we need Nt and N, if Nt and N are same, formula for Mopt will give error, what to choose M value in that scenario ?
@andvish93 There are two solutions.
First, because that term appears in every document, we don't need to use any bit to encode the delta list because gap is always 1. You can just encode the f_t,d.
Second, just set M to be 0. So you always use 1 bit to encode the gap id.
(Edited: 2018-12-08)