- Which of the following is most likely to be used
to do the searching carried out with the fgrep
command in UNIX:
a) inverted file. b) Patricia tree. c) Boyer-Moore.
d) Karp-Rabin. e) Shift-Or.
- Pre-processing the pattern used for string searching is part of
the
............approach, while pre-processing the target string is part of the
............approach.
- Explain the main advantage, and the main disadvantage, of
using PAT arrays as opposed to PAT trees.
- Explain how PAT carries out the fby type of query,
in terms of operations on a PAT tree.
- If a text collection to be used with PAT will fit into memory,
what is the computational complexity and the overall approach that
can be taken to most quickly build a PAT tree for that collection?