MCQOPTIONS
Saved Bookmarks
This section includes 12 Mcqs, each offering curated multiple-choice questions to sharpen your Data Structures and Algorithms knowledge and support exam preparation. Choose a topic below to get started.
| 1. |
In a Propositional Directed Acyclic Graph Leaves maybe labelled with a boolean variable. |
| A. | True |
| B. | False |
| Answer» B. False | |
| 2. |
Every Binary Decision Diagram is also a Propositional Directed Acyclic Graph. |
| A. | True |
| B. | False |
| Answer» B. False | |
| 3. |
Which of the following symbols represent leaf nodes? |
| A. | iv) and v) |
| B. | v) |
| C. | i) and iii) |
| D. | ii)View Answer |
| Answer» B. v) | |
| 4. |
Which of the following symbols represent nodes having exactly one child? |
| A. | iv) and v) |
| B. | v) |
| C. | i) and iii) |
| D. | iii)View Answer |
| Answer» E. | |
| 5. |
Consider the following symbols and choose which of the symbols represent nodes having atleast one child? |
| A. | iv) and v) |
| B. | iii) iv) and v) |
| C. | i) and ii) |
| D. | i) and iii)View Answer |
| Answer» D. i) and iii)View Answer | |
| 6. |
What is the number of words that can be formed from the given Directed Acyclic Word Graph? |
| A. | 2 |
| B. | 4 |
| C. | 12 |
| D. | 7 |
| Answer» C. 12 | |
| 7. |
WHICH_OF_THE_GIVEN_SYMBOLS_REPRESENT_MAY_REPRESENT_LEAF_NODES??$ |
| A. | iv) and v) |
| B. | v) |
| C. | i) and iii) |
| D. | ii) |
| Answer» B. v) | |
| 8. |
Which of the given symbols represent nodes having at least one child? |
| A. | iv) and v) |
| B. | iii) iv) and v) |
| C. | i) and ii) |
| D. | i) and iii) |
| Answer» E. | |
| 9. |
In which of the following case does a Propositional Directed Acyclic Graph is used for? |
| A. | Representation of Boolean Functions |
| B. | String Matching |
| C. | Searching |
| D. | Sorting of number |
| Answer» B. String Matching | |
| 10. |
What is time complexity to check if a string(length S1) is a substring of another string(length S2) stored in a Directed Acyclic Word Graph, given S2 is greater than S1? |
| A. | O(S1) |
| B. | O(S2) |
| C. | O(S1+S2) |
| D. | O(1) |
| Answer» B. O(S2) | |
| 11. |
Determine the longest string which is described by the given Directed Acyclic Word Graph. |
| A. | BATS |
| B. | BOATS |
| C. | BOT |
| D. | None of the mentioned |
| Answer» B. BOATS | |
| 12. |
In which of the following does a Directed Acyclic Word Graph finds its application in? |
| A. | String Matching |
| B. | Number Sorting |
| C. | Manipulations on numbers |
| D. | None of the mentioned |
| Answer» B. Number Sorting | |