McqMate
These multiple-choice questions (MCQs) are designed to enhance your knowledge and understanding in the following areas: Bachelor of Science in Computer Science (BSc CS) .
| 1. |
Compiler is a program that |
| A. | places programs into memory and prepares them for execution |
| B. | automates the translation of assembly language into machine language |
| C. | accepts a program written in a high level language and produces an object program |
| D. | appears to execute a source program as if it were machine language. |
| Answer» C. accepts a program written in a high level language and produces an object program | |
| 2. |
Loader is a program that |
| A. | places programs into memory and prepares them for execution. |
| B. | automates the translation of assembly language into machine language. |
| C. | accepts a program written in a high level language and produces an object program. |
| D. | appers to execute a source program as if it were machine language |
| Answer» A. places programs into memory and prepares them for execution. | |
| 3. |
The action of parsing the source program into the proper syntactic classes is called |
| A. | syntax analysis |
| B. | lexical analysis |
| C. | interpretation analysis |
| D. | general syntax analysis |
| Answer» B. lexical analysis | |
| 4. |
In analyzing the compilation of PL/I program ,the term “lexical analysis” is associated with |
| A. | recognition of basic syntactic constructs through reductions |
| B. | recognition of basic elements and creation of uniform symbols |
| C. | creation of more optional matrix |
| D. | use of macro processor to produce more optimal assembly code |
| Answer» B. recognition of basic elements and creation of uniform symbols | |
| 5. |
In analyzing the compilation of PL/I program,the description creation of more optimal matrix is associated with |
| A. | assembly and output |
| B. | code generation |
| C. | syntax analysis |
| D. | machine independent optimization |
| Answer» D. machine independent optimization | |
| 6. |
Task of the lexical analysis phase is |
| A. | to parse the source program into basic elements or tockens of the language |
| B. | to build a literal literal table and an identifier table |
| C. | to build a uniform symbol table |
| D. | all of these |
| Answer» D. all of these | |
| 7. |
which is a permanent database in the general model of compiler |
| A. | Literal table |
| B. | Identifier table |
| C. | Terminal table |
| D. | source code |
| Answer» C. Terminal table | |
| 8. |
which table is a permanent data bases that has an entry for each terminal symbol |
| A. | Terminal table |
| B. | Literal table |
| C. | Identifier table |
| D. | Reductions |
| Answer» A. Terminal table | |
| 9. |
The output of lexical analyser is |
| A. | a set of regular expressions |
| B. | syntax tree |
| C. | set of tokens |
| D. | strings of characters |
| Answer» C. set of tokens | |
| 10. |
which of the following system software resides in main memory |
| A. | texteditor |
| B. | assembler |
| C. | linker |
| D. | all of these |
| Answer» D. all of these | |
| 11. |
.machine independent phase of the compiler is |
| A. | syntax analysis |
| B. | lexical analysis |
| C. | intermediate code generation |
| D. | all of these |
| Answer» D. all of these | |
| 12. |
which of the following statement is true |
| A. | SLR parser is more powerful than LALR |
| B. | LALR parser is more powerful than canonical LR parser |
| C. | canonical LR parser is more powerful than LALR parser |
| D. | parser SLR,canonical CR and LALR have the same power |
| Answer» D. parser SLR,canonical CR and LALR have the same power | |
| 13. |
.which of the following is used for grouping of characteristics into tockens |
| A. | parser |
| B. | code optimization |
| C. | code generator |
| D. | lexical analyser |
| Answer» D. lexical analyser | |
| 14. |
A bottom up parser generates |
| A. | Right most derivations |
| B. | Right most derivations in reverse |
| C. | Leftmost derivations |
| D. | Leftmost derivations in reverse |
| Answer» B. Right most derivations in reverse | |
| 15. |
.A top down parser generates |
| A. | Right most derivations |
| B. | Right most derivations in reverse |
| C. | Leftmost derivations |
| D. | Leftmost derivations in reverse |
| Answer» C. Leftmost derivations | |
| 16. |
which of the following grammer is LR(1) |
| A. | A->aAa A->bAb A->a A->b |
| B. | A->aAa A->aAb A->c |
| C. | A->A+A A->a |
| D. | both a and b |
| Answer» B. A->aAa A->aAb A->c | |
| 17. |
which of the following parser is the most powerful |
| A. | Operator precedence |
| B. | Canonical LR |
| C. | LALR |
| D. | SLR |
| Answer» B. Canonical LR | |
| 18. |
Minimum hamming distance method is used for connection of |
| A. | syntactic errors |
| B. | semantic errors |
| C. | algorithm errors |
| D. | transcription errors |
| Answer» A. syntactic errors | |
| 19. |
.Pee hole optimization is a form of |
| A. | loop optimization |
| B. | local optimization |
| C. | constant folding |
| D. | none of these |
| Answer» A. loop optimization | |
| 20. |
The optimization which avoids test at every iteration is |
| A. | loop unrolling |
| B. | loop jamming |
| C. | constant folding |
| D. | none of these |
| Answer» A. loop unrolling | |
| 21. |
The value of k,in LR(k)cannot be |
| A. | zero |
| B. | 1 |
| C. | 2 |
| D. | none of these |
| Answer» D. none of these | |
| 22. |
The cost of developing a compiler is proportional to |
| A. | complexity of the source language |
| B. | complexity of the architecture of the target machine |
| C. | flexibility of the available instruction set |
| D. | all of these |
| Answer» D. all of these | |
| 23. |
which of the following is the most general phase structured grammar |
| A. | Regular |
| B. | Context free |
| C. | Context sensitive |
| D. | none of these |
| Answer» C. Context sensitive | |
| 24. |
Type checking is normally done during |
| A. | lexical analysis |
| B. | syntax analysis |
| C. | syntax directed translation |
| D. | code optimization |
| Answer» C. syntax directed translation | |
| 25. |
which of the following grammars are not phase structured |
| A. | Regular |
| B. | Context free |
| C. | Context sensitive |
| D. | None of these |
| Answer» D. None of these | |
| 26. |
csg can be recognized by |
| A. | push down automata |
| B. | 2-way linear bounded automata |
| C. | finite state automata |
| D. | None of these |
| Answer» B. 2-way linear bounded automata | |
| 27. |
which of the following is not a source error |
| A. | faulty design specification |
| B. | faulty algorithm |
| C. | Compilers themselves |
| D. | none of these |
| Answer» D. none of these | |
| 28. |
A parser with valid prefix property is advantageous because it |
| A. | detects error as soon as possible |
| B. | detects errors as and when they occur |
| C. | limits the amount of erroneous output passed to the next phase |
| D. | all of these |
| Answer» C. limits the amount of erroneous output passed to the next phase | |
| 29. |
ud-chaining is useful for |
| A. | determining whether a particular definition is used anywhere or not |
| B. | constant folding |
| C. | checking whether a variable is used,without prior assignment |
| D. | all of these |
| Answer» D. all of these | |
| 30. |
Back-patching is useful for handling |
| A. | conditional jumps |
| B. | unconditional jumps |
| C. | backward reference |
| D. | forward references |
| Answer» D. forward references | |
| 31. |
Ir stands for |
| A. | left to right |
| B. | left to right reduction |
| C. | right to left |
| D. | left to right and right most derivations in reverse |
| Answer» D. left to right and right most derivations in reverse | |
| 32. |
An ideal compiler should |
| A. | be small in size |
| B. | produce object code that is smaller in size and execute faster |
| C. | takes less time for compiling |
| D. | all of these |
| Answer» D. all of these | |
| 33. |
which of the following is used for grouping of characters into tockens |
| A. | parser |
| B. | code optimizer |
| C. | code generator |
| D. | scanner |
| Answer» D. scanner | |
| 34. |
which of the following class of statements usually produces no executable code when compiled |
| A. | Declaration statements |
| B. | Assignment statements |
| C. | Input and output statements |
| D. | structural statements |
| Answer» D. structural statements | |
| 35. |
Access time of the symbol table will be logarithmic,if it is implemented by |
| A. | linear list |
| B. | search tree |
| C. | hash table |
| D. | self-organizing list |
| Answer» B. search tree | |
| 36. |
A shift reduce parser carries out the actions specified within braces immediately after reducing,with the corresponding rule of the grammar
|
| A. | 11231 |
| B. | 11233 |
| C. | 23131 |
| D. | 233321 |
| Answer» C. 23131 | |
| 37. |
The output of a lexical analyzer is |
| A. | machine code |
| B. | intermediate code |
| C. | a stream of tockens |
| D. | a parse tree |
| Answer» C. a stream of tockens | |
| 38. |
Synthesized attribute can be easily simulated by a |
| A. | LL grammar |
| B. | ambiguous grammar |
| C. | LR grammar |
| D. | none of these |
| Answer» C. LR grammar | |
| 39. |
which of the following cannot be used an an intermediate code form |
| A. | post fix notation |
| B. | Three address codes |
| C. | Syntax trees |
| D. | Quadraples |
| Answer» D. Quadraples | |
| 40. |
A Language L is defined by L={xn yn |n>1} which of the following definitions generates the same language as L |
| A. | E->xEy | xy |
| B. | (xy)|(xxyy) |
| C. | x-y |
| D. | All of these |
| Answer» A. E->xEy | xy | |
| 41. |
pass1 |
| A. | assign address to all statements in the program |
| B. | save the values assigned to all labels for use in pass2 |
| C. | perform some processing of assembler directives |
| D. | all of these |
| Answer» D. all of these | |
| 42. |
pass2 |
| A. | assemble instruction and generate data |
| B. | perform processing of assembler directions not done during pass1 |
| C. | write the object program and the assembly listing |
| D. | all of these |
| Answer» D. all of these | |
| 43. |
A compiler which allows only the modified section of the source code to be re-compiled is called |
| A. | incremental compiler |
| B. | re-configurable compiler |
| C. | dynamic compiler |
| D. | subjective compiler |
| Answer» A. incremental compiler | |
| 44. |
In a two pass assembler pseudo code,equ is to be evaluated during |
| A. | pass1 |
| B. | pass2 |
| C. | not evaluated by the assembler |
| D. | none of these |
| Answer» A. pass1 | |
| 45. |
In a syntax directed translation scheme,if values of an attribute of a node is a function of the attributes of its children,then attribute is called |
| A. | canonical attribute |
| B. | synthesized attribute |
| C. | inherited attribute |
| D. | none of these |
| Answer» B. synthesized attribute | |
| 46. |
Software that allows your computer to interact with the user, applications, and hardware is called |
| A. | application software |
| B. | word processor |
| C. | system software |
| D. | database software |
| Answer» C. system software | |
| 47. |
Programs that coordinate computer resources, provide an interface between users and the computer, and run applications are called |
| A. | utilities |
| B. | operating systems |
| C. | device drivers |
| D. | language translators |
| Answer» B. operating systems | |
| 48. |
Specialized programs that allow particular input or output devices to communicate with the rest of the computer system are called |
| A. | operating systems |
| B. | utilities |
| C. | device drivers |
| D. | language translators |
| Answer» C. device drivers | |
| 49. |
Also known as a service program, this type of program performs specific tasks related to managing computer resources. |
| A. | utility |
| B. | operating system |
| C. | language translator |
| D. | device driver |
| Answer» A. utility | |
| 50. |
In order for a computer to understand a program, it must be converted into machine language by a(n)__________. |
| A. | operating system |
| B. | utility |
| C. | device driver |
| D. | language translator |
| Answer» D. language translator | |
Done Studing? Take A Test.
Great job completing your study session! Now it's time to put your knowledge to the test. Challenge yourself, see how much you've learned, and identify areas for improvement. Don’t worry, this is all part of the journey to mastery. Ready for the next step? Take a quiz to solidify what you've just studied.