MCQOPTIONS
Saved Bookmarks
MCQOPTIONS
This section includes 2 Mcqs, each offering curated multiple-choice questions to sharpen your General Awareness knowledge and support exam preparation. Choose a topic below to get started.
| 1. |
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) |
| Answer» E. | |
| 2. |
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 tables |
| Answer» E. | |