MCQOPTIONS
Saved Bookmarks
MCQOPTIONS
This section includes 105 Mcqs, each offering curated multiple-choice questions to sharpen your Automata Theory knowledge and support exam preparation. Choose a topic below to get started.
| 101. |
For the expression E*(E) where * and brackets are the operation, number of nodes in the respective parse tree are: |
| A. | 6 |
| B. | 7 |
| C. | 5 |
| D. | 2 |
| Answer» C. 5 | |
| 102. |
Which among the following is the root of the parse tree? |
| A. | Production P |
| B. | Terminal T |
| C. | Variable V |
| D. | Starting Variable S |
| Answer» E. | |
| 103. |
In which order are the children of any node ordered? |
| A. | From the left |
| B. | From the right |
| C. | Arbitrarily |
| D. | None of the mentioned |
| Answer» B. From the right | |
| 104. |
Which of the following statement is false in context of tree terminology? |
| A. | Root with no children is called a leaf |
| B. | A node can have three children |
| C. | Root has no parent |
| D. | Trees are collection of nodes, with a parent child relationship |
| Answer» B. A node can have three children | |
| 105. |
The most suitable data structure used to represent the derivations in compiler: |
| A. | Queue |
| B. | Linked List |
| C. | Tree |
| D. | Hash Tables |
| Answer» D. Hash Tables | |