MCQOPTIONS
Saved Bookmarks
MCQOPTIONS
This section includes 1698 Mcqs, each offering curated multiple-choice questions to sharpen your General Awareness knowledge and support exam preparation. Choose a topic below to get started.
| 51. |
The number of proper subsets of the set {1, 2, and 3} is |
| A. | 8 |
| B. | 6 |
| C. | 7 |
| D. | 5 |
| Answer» C. 7 | |
| 52. |
If A and B are any two sets, then A (A B) is equal to |
| A. | A |
| B. | B |
| C. | A^B |
| D. | B^A |
| Answer» B. B | |
| 53. |
If A, B and C are any three sets, then A (B C) is equal to |
| A. | (A B) (A C) |
| B. | (A B) (A C) |
| C. | (A B) (A C) |
| D. | None of the above |
| Answer» B. (A B) (A C) | |
| 54. |
The process of forming tokens from an input stream of characters is called_____. |
| A. | Liberalisation |
| B. | Characterisation |
| C. | Tokenization |
| D. | None of the mentioned |
| Answer» D. None of the mentioned | |
| 55. |
Which grammar defines Lexical Syntax ? |
| A. | Regular Grammar |
| B. | Syntactic Grammar |
| C. | Context free Grammar |
| D. | Lexical Grammar |
| Answer» E. | |
| 56. |
Which of the following grammar rules violate the requirements of an operator grammar ? P, Q, R are nonterminals, and r, s, t are terminals.1. P Q R 2. P Q s R3. P 4. P Q t R r |
| A. | 1 only |
| B. | 1 and 3 only |
| C. | 2 and 3 only |
| D. | 3 and 4 only |
| Answer» C. 2 and 3 only | |
| 57. |
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» C. Interpretation analysis | |
| 58. |
Minimum hamming distance method is used for connection of |
| A. | Syntactic errors |
| B. | Semantic errors |
| C. | Algorithm errors |
| D. | Transcription errors |
| Answer» B. Semantic errors | |
| 59. |
Pee hole optimization is a form of |
| A. | Loop optimization |
| B. | Local optimization |
| C. | Constant folding |
| D. | None of these |
| Answer» B. Local optimization | |
| 60. |
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» E. | |
| 61. |
The value of k, in LR(k) cannot be |
| A. | 0 |
| B. | 1 |
| C. | 2 |
| D. | None of these |
| Answer» E. | |
| 62. |
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» E. | |
| 63. |
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» E. | |
| 64. |
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» E. | |
| 65. |
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» B. Re-configurable compiler | |
| 66. |
Storage mapping is done by |
| A. | Linker |
| B. | Compiler |
| C. | Loader |
| D. | Operating system |
| Answer» C. Loader | |
| 67. |
A computer programe that converts the whole programe into machine language at a single time is called |
| A. | Compiler |
| B. | Translater |
| C. | Interpreter |
| D. | All of the above |
| Answer» B. Translater | |
| 68. |
Compiler can check- |
| A. | Syntax Error |
| B. | Logical Error |
| C. | Both Logical and Syntax Error |
| D. | None of these |
| Answer» B. Logical Error | |
| 69. |
A programmer, by mistake, writes an instruction to divide, instead of a multiply, such error can be detected by a/an |
| A. | Compiler |
| B. | Interpreter |
| C. | Compiler or interpreter test |
| D. | None of these |
| Answer» E. | |
| 70. |
Disadvantage of Compile and GO loading scheme is that |
| A. | It is necessary to retranslate the users program and check everytime it is run |
| B. | A portion of memory is wasted because the case occupied by the assembler is unavailable to the object program |
| C. | It is very difficult to handle multiple segments, especially if the source programs are in different languages and to produce orderly modular programs |
| D. | All of these |
| Answer» E. | |
| 71. |
Peep-hole optimization is a form of |
| A. | Constant folding |
| B. | Data flow analysis |
| C. | Loop optimization |
| D. | Local optimization |
| Answer» B. Data flow analysis | |
| 72. |
An optimizing compiler |
| A. | Optimizes the code |
| B. | Is optimized to occupy less space |
| C. | Is optimized to take less time for execution |
| D. | All of the above |
| Answer» E. | |
| 73. |
If we compile the xyz.c file with the command gcc -o xyz xyz.c , then the executable file will be |
| A. | A.out |
| B. | Sam |
| C. | Sam.out |
| D. | None of the above |
| Answer» C. Sam.out | |
| 74. |
Which concept of grammar is used in the compiler ? |
| A. | Lexical analysis |
| B. | Parser |
| C. | Code generation |
| D. | Code optimization |
| Answer» C. Code generation | |
| 75. |
The smallest set A such that A {1, 2} = {1, 2, 3, 5, 9} is |
| A. | {2,3,5} |
| B. | {1, 2, 5, 9} |
| C. | {3, 5, 9} |
| D. | None of the above |
| Answer» E. | |
| 76. |
If a set A has n elements, then the total number of subsets of A is |
| A. | N |
| B. | 2^n |
| C. | N^2 |
| D. | 2n |
| Answer» D. 2n | |
| 77. |
If A B = B, then |
| A. | A B |
| B. | A = |
| C. | B A |
| D. | B = |
| Answer» D. B = | |
| 78. |
In analyzing the compilation of PL/I program, the term Machine independent optimization is assosiated with |
| A. | Creation of more optical matrix |
| B. | Recognition of basic elements and creation of uniform symbols |
| C. | Use of macro-processor to produce more optimal assembly code |
| D. | Recognization of basic syntactic construction through reductions |
| Answer» B. Recognition of basic elements and creation of uniform symbols | |
| 79. |
In analyzing the compilation of PL/I program the description resolving symbolic address ( lables ) and generating machine language is associated with |
| A. | Syntax analysis |
| B. | Code generation |
| C. | Storage assignment |
| D. | Assembly and output |
| Answer» E. | |
| 80. |
In analyzing the compilation of PL/I program the description creation of more optimal matrix is assosiated with |
| A. | Syntax analysis |
| B. | Code generation |
| C. | Assembly and output |
| D. | Machine independent optimization |
| Answer» E. | |
| 81. |
Which of the following translation program converts assembly language programs to object program |
| A. | Loader |
| B. | Compiler |
| C. | Assembler |
| D. | Macroprocessor |
| Answer» D. Macroprocessor | |
| 82. |
Loop is a collection of nodes that is |
| A. | Strongly connected and has a unique entry |
| B. | Loosely connected and has a unique entry |
| C. | Strongly connected |
| D. | None of these |
| Answer» B. Loosely connected and has a unique entry | |
| 83. |
Which table is permanent databases that has an entry for each terminal symbol ? |
| A. | Literal table |
| B. | Identiier table |
| C. | Terminal table |
| D. | None of these |
| Answer» D. None of these | |
| 84. |
Which of the following is not a function of pass1 of an assembler |
| A. | Generate data |
| B. | Keep track of LC |
| C. | Remember literals |
| D. | Remember values of symbols until pass 2 |
| Answer» B. Keep track of LC | |
| 85. |
An Assembler converts |
| A. | Machine code to mnemonics |
| B. | High level language to assembly level |
| C. | Assembly language to machine language |
| D. | All of the above |
| Answer» D. All of the above | |
| 86. |
____ converts the programs written in assembly language into machine instructions . |
| A. | Machine compiler |
| B. | Interpreter |
| C. | Assembler |
| D. | Converter |
| Answer» D. Converter | |
| 87. |
The instructions like MOV or ADD are called as ______ . |
| A. | OP-Code |
| B. | Operators |
| C. | Commands |
| D. | None of the above |
| Answer» B. Operators | |
| 88. |
Instructions which wont appear in the object program are called as _____ . |
| A. | Redundant instructions |
| B. | Exceptions |
| C. | Comments |
| D. | Assembler Directives |
| Answer» E. | |
| 89. |
The assembler stores all the names and their corresponding values in ______ . |
| A. | Special purpose Register |
| B. | Symbol Table |
| C. | Value map Set |
| D. | None of the above |
| Answer» C. Value map Set | |
| 90. |
When dealing with the branching code, the assembler |
| A. | Replaces the target with its address |
| B. | Does not replace until the test condition is satisfied |
| C. | Finds the Branch offset and replaces the Branch target with it |
| D. | Replaces the target with the value specified by the DATAWORD directive |
| Answer» D. Replaces the target with the value specified by the DATAWORD directive | |
| 91. |
The last statement of the source program should be _______ . |
| A. | Stop |
| B. | Return |
| C. | OP |
| D. | End |
| Answer» E. | |
| 92. |
_____ directive specifies the end of execution of a program . |
| A. | End |
| B. | Return |
| C. | Stop |
| D. | Terminate |
| Answer» C. Stop | |
| 93. |
In a two-pass assembler, the task of the Pass II is to |
| A. | Separate the symbol, mnemonic opcode and operand fields. |
| B. | Build the symbol table. |
| C. | Construct intermediate code. |
| D. | Synthesize the target program. |
| Answer» E. | |
| 94. |
Which of these features of assembler are Machine-Dependent ? |
| A. | Instruction formats |
| B. | Addressing modes |
| C. | Program relocation |
| D. | All of the mentioned |
| Answer» E. | |
| 95. |
In a two pass assembler pseudo code,equ is to be evaluated during |
| A. | Pass 1 |
| B. | Pass 2 |
| C. | Not evaluated by the assembler |
| D. | None of these |
| Answer» B. Pass 2 | |
| 96. |
The translator used by second generation languages is? |
| A. | Assembler |
| B. | Interpreter |
| C. | Compiler |
| D. | Linker |
| Answer» B. Interpreter | |
| 97. |
A simple two-pass assembler does which of the following in the first pass ? |
| A. | It allocates space for the literals |
| B. | It computes the total length of the program |
| C. | It builds the symbol table for the symbols and their values |
| D. | All of these |
| Answer» E. | |
| 98. |
The part of the machine level instruction, which tells the central processor what has to be done is |
| A. | Locator |
| B. | Address |
| C. | Flip Flop |
| D. | Operation code |
| Answer» E. | |
| 99. |
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» C. Creation of more optional matrix | |
| 100. |
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» E. | |