Section 1
I. Multiple Choice Questions
In which of the following 'string matching' is used?(a) DNA matching(b) Text editors(c) Finding musical patterns from multimedia databases(d) All of the above
What would be the complexity of 'naive string matching', if the text $T$ is of length ' $n$ ' and the pattern $P$ is of length ' $m$ '?(a) $O\left(\mathrm{~m}^2\right)$(c) $O\left(n^2\right)$(b) $O(m(n-m))$(d) None of the above
What is the best case complexity of Rabin-Karp algorithm?(a) $O(n)$(c) $O\left(m^2\right)$(b) $O(n+m)$ in the best case(d) None of the above
What is the worst case complexity of Rabin-Karp algorithm?(a) $O(m(n-m))$(c) $O\left(n^2\right)$(b) $O\left(\mathrm{~m}^2\right)$(d) None of the above
What is the complexity of string matching using deterministic automata?(a) $O(n)$(c) $O\left(n^2\right)$(b) $\mathrm{O}(\mathrm{m})$(d) None of the above
What is the complexity of Knuth-Morris-Pitt algorithm?(a) $O(n)$(c) $O\left(n^2\right)$(b) $O(n m)$(d) None of the above
Which of the following data structures is best suited when many of the strings to be matched have the common prefix with the first string?(a) Trie(c) Do not try(b) Try(d) Trial
Which of the following is the trie of all the possible suffixes of a string?(a) Suffix tree(c) Suffix-Prefix(b) Suffix array(d) Prefix tree
Which of the following is also called a prefix tree?(a) Tries(c) Binary search tree(b) Suffix tree(d) None of the above
Which language is accepted by a deterministic finite acoeptor?(a) Regular(c) English(b) Irregular(d) Spanish
Which of the following is accepted by a non-deterministic finite acceptor?(a) Regular(c) English(b) Irregular(d) Spanish
Which of the following is true?(a) Corresponding to every DFA, there is an NFA(b) Corresponding to every NFA, there is a DFA(c) Both(d) None of the above
Which of the following is true?(a) An NFA can have a NULL transition(b) An NFA can go to more than one states on giving an input(c) Both of the above(d) None of the above
Which data structure is used in string matching?(a) DFA(c) Prefix tree(b) Trie(d) All of the above
Which is the most efficient string matching algorithm?(a) Knuth-Morris-Pitt(b) Rabin-Karp(c) Naive(d) All of the above are equally efficient
Which of the following is not used in string matching?(a) Longest common subsequence(c) Naìve string matching(b) Master theorem(d) All of the above