MCQOPTIONS
Saved Bookmarks
This section includes 9 Mcqs, each offering curated multiple-choice questions to sharpen your Compilers knowledge and support exam preparation. Choose a topic below to get started.
| 1. |
WHICH_OF_THE_FOLLOWING_FUNCTIONS_IS_PERFORMED_BY_LOADER??$ |
| A. | Allocate memory for the programs and resolve symbolic references between objects decks |
| B. | Address dependent locations, such as address constants, to correspond to the allocated space |
| C. | Physically place the machine instructions and data into memory |
| D. | All of the mentioned |
| Answer» E. | |
| 2. |
The_root_directory_of_a_disk_should_be_placed$ |
| A. | At a fixed address in main memory |
| B. | At a fixed location on the disk |
| C. | Anywhere on the disk |
| D. | None of the mentioned |
| Answer» C. Anywhere on the disk | |
| 3. |
Which table is a permanent database that has an entry for each terminal symbol? |
| A. | Terminal Table |
| B. | Literal Table |
| C. | Identifier Table |
| D. | None of the mentioned |
| Answer» B. Literal Table | |
| 4. |
Pass I |
| A. | Assign address to all statements |
| B. | Save the values assigned to all labels for use in pass 2 |
| C. | Perform some processing |
| D. | All of the mentioned |
| Answer» E. | |
| 5. |
If E be a shifting operation applied to a function f, such that E(f) = f (x +β ), then$ |
| A. | E (αf+β g) =α E(f) +β E (g) |
| B. | E (αf +β g )=. ( α+ β )+ E (f + g) |
| C. | E (αf +β g )=α E (f+gβ) |
| D. | E (αf +β g )=αβ E (f + g) |
| Answer» B. E (‚âà√≠¬¨¬±f +‚âà√≠‚Äö√¢¬ß g )=. ( ‚âà√≠¬¨¬±+ ‚âà√≠‚Äö√¢¬ß )+ E (f + g) | |
| 6. |
Function of the syntax phase is to |
| A. | recognize the language and to cal the appropriate action routines that will generate the intermediate form or matrix for these constructs |
| B. | Build a literal table and an identifier table |
| C. | Build a uniform symbol table |
| D. | Parse the source program into the basic elements or tokens of the language |
| Answer» B. Build a literal table and an identifier table | |
| 7. |
The process manager has to keep track of |
| A. | Status of each program |
| B. | Information to a programmer using the system |
| C. | Both of the mentioned |
| D. | None of the mentioned |
| Answer» D. None of the mentioned | |
| 8. |
The method which merges the bodies of two loops is |
| A. | Loop rolling |
| B. | Loop jamming |
| C. | Constant folding |
| D. | None of the mentioned |
| Answer» C. Constant folding | |
| 9. |
In a single pass assembler, most of the forward references can be avoided by putting the restriction |
| A. | On the number of strings/life reacts |
| B. | Code segment to be defined after data segment |
| C. | On unconditional rump |
| D. | None of the mentioned |
| Answer» C. On unconditional rump | |