Related InterviewSolutions

• Given input string = “ABCDABCATRYCARCABCSRT” and pattern string = “CAT”. Find the first index of the pattern match using quick search algorithm.(a) 2(b) 6(c) 11(d) 14The question was posed to me during an interview.I would like to ask this question from String Matching topic in chapter String Matching of Data Structures & Algorithms II
• What character shift tables does Boyer-Moore’s search algorithm use?(a) good-character shift tables(b) bad-character shift tables(c) next-character shift tables(d) both good and bad character shift tablesThis question was posed to me in semester exam.My enquiry is from String Matching topic in section String Matching of Data Structures & Algorithms II
• What is the worst case running time in searching phase of Boyer-Moore’s algorithm?(a) O(n)(b) O(log n)(c) O(m+n)(d) O(mn)The question was posed to me during an interview for a job.My question is based upon String Matching topic in chapter String Matching of Data Structures & Algorithms II
• The searching phase in quick search algorithm has good practical behaviour.(a) true(b) falseI have been asked this question in quiz.Asked question is from String Matching in portion String Matching of Data Structures & Algorithms II
• Quick search algorithm starts searching from the right most character to the left.(a) true(b) falseThis question was addressed to me in my homework.This intriguing question originated from String Matching topic in chapter String Matching of Data Structures & Algorithms II
• What is the space complexity of quick search algorithm?(a) O(n)(b) O(log n)(c) O(m+n)(d) O(mn)This question was addressed to me in homework.I'd like to ask this question from String Matching in section String Matching of Data Structures & Algorithms II
• What character shift tables does quick search algorithm use?(a) good-character shift tables(b) bad-character shift tables(c) next-character shift tables(d) both good and bad character shift tablesI have been asked this question in an online quiz.I'm obligated to ask this question of String Matching topic in chapter String Matching of Data Structures & Algorithms II
• What is the time complexity of the Quick search algorithm?(a) O(n)(b) O(log n)(c) O(m+n)(d) O(mn)I have been asked this question in an online quiz.Enquiry is from String Matching topic in section String Matching of Data Structures & Algorithms II
• Which of the following algorithms formed the basis for the Quick search algorithm?(a) Boyer-Moore’s algorithm(b) Parallel string matching algorithm(c) Binary Search algorithm(d) Linear Search algorithmThe question was asked in a national level competition.My question is based upon String Matching in section String Matching of Data Structures & Algorithms II
• Which of the following is the fastest algorithm in string matching field?(a) Boyer-Moore’s algorithm(b) String matching algorithm(c) Quick search algorithm(d) Linear search algorithmThe question was asked in a national level competition.Asked question is from String Matching in portion String Matching of Data Structures & Algorithms II