McqMate
These multiple-choice questions (MCQs) are designed to enhance your knowledge and understanding in the following areas: Mechanical Engineering , Programming Languages .
151. |
A strict substitution is called ‘in-line expansion’or_________. |
A. | macro extension |
B. | local function |
C. | both a & b |
D. | none of these |
Answer» A. macro extension |
152. |
Types of parameter passing techniques______. |
A. | call by value |
B. | call by name |
C. | call by reference |
D. | all of these |
Answer» D. all of these |
153. |
_________are generally passed by reference. |
A. | program |
B. | array |
C. | procedure |
D. | none of these |
Answer» B. array |
154. |
The address of actual parameter is passed to the formal parameter, “______”can happen. |
A. | overloading |
B. | aliasing |
C. | caller |
D. | none of these |
Answer» B. aliasing |
155. |
Any manipulation on the formal parameters doesn’t have effect on values in activation of the_____. |
A. | caller |
B. | callee |
C. | call |
D. | value |
Answer» A. caller |
156. |
________is a second usuage demonstrate for in-out parameter. |
A. | call by value |
B. | pass by reference |
C. | call by address |
D. | none of these |
Answer» B. pass by reference |
157. |
This sort of intercommunication between the modules is accomplished by_________. |
A. | parameter passing |
B. | fully dynamic data allocation |
C. | call by value |
D. | call by reference |
Answer» A. parameter passing |
158. |
The hybid method between call by value and call by reference is______. |
A. | call by name |
B. | copy restore |
C. | call by address |
D. | none of these |
Answer» B. copy restore |
159. |
The node of activation tree represents___________. |
A. | main |
B. | procedure |
C. | a and b |
D. | none of these |
Answer» C. a and b |
160. |
The root of activation tree represents_________. |
A. | main program |
B. | called procedure |
C. | a and b |
D. | none of these |
Answer» C. a and b |
161. |
______field ,of activation record refers to non local data in another activation record . |
A. | actual parameters |
B. | access link |
C. | control link |
D. | return values |
Answer» B. access link |
162. |
The control link of activation record points to__________. |
A. | caller procedure |
B. | callee procedure |
C. | both a & b |
D. | none of these |
Answer» A. caller procedure |
163. |
An interpreter is a program that repetitively executes : |
A. | get the next statement |
B. | determine the action to be executed |
C. | perform the action |
D. | all of the above |
Answer» C. perform the action |
164. |
CPU is also an interpreter of machine instruction |
A. | true |
B. | false |
Answer» A. true |
165. |
____translate code into some efficient ntermesiate representation and immediately execute that. |
A. | translator |
B. | interpreter |
C. | compiler |
D. | none of the above |
Answer» B. interpreter |
166. |
Interpreters are frequently used to executed |
A. | commad language |
B. | glue language |
C. | both |
D. | none |
Answer» C. both |
167. |
No intermediate code is generated in |
A. | interpreter |
B. | compiler |
C. | both |
D. | none |
Answer» A. interpreter |
168. |
BASIC language is an example of: |
A. | interpreter |
B. | compiler |
C. | both |
D. | none |
Answer» A. interpreter |
169. |
In interpreter conditional control statements are execute slower |
A. | true |
B. | false |
Answer» A. true |
170. |
In interpreter memory required is? |
A. | less |
B. | more |
C. | average |
D. | none |
Answer» A. less |
171. |
In ------- Higher level language is converted into lower level lenguage |
A. | interpreter |
B. | compiler |
C. | both |
D. | none |
Answer» A. interpreter |
172. |
In computing , an interpreter is a computer that reads the source code of another program and execute that program |
A. | true |
B. | false |
Answer» A. true |
173. |
Self modifying code can be easily implemented by |
A. | interpreter |
B. | compiler |
C. | both |
D. | none |
Answer» A. interpreter |
174. |
Translator for low level programming language were termed as C |
A. | assembler |
B. | compiler |
C. | linker |
D. | loader |
Answer» A. assembler |
175. |
The translator which perform macro expansion is called a |
A. | macro processor |
B. | macro pre-processor |
C. | micro pre-processor |
D. | assembler |
Answer» B. macro pre-processor |
176. |
Which of the following can be used as a criterion for classification of data structures used in language processing. |
A. | nature of a data structure |
B. | purpose of a data structure |
C. | lifetime of a data structure |
D. | all of the above |
Answer» D. all of the above |
177. |
An assembler is |
A. | programming language dependent. |
B. | syntax dependant. |
C. | machine dependant. |
D. | data dependant. |
Answer» C. machine dependant. |
178. |
Which is not a funciton of a loader |
A. | allocation |
B. | translation |
C. | relocation |
D. | loading |
Answer» B. translation |
179. |
An interpreter is a program that |
A. | places programs into memory and prepares then for execution |
B. | automates the translation of assemble language into machine language |
C. | accepts a program written in a high level language and produces an object program |
D. | appears to execute a resource as if it were machine language |
Answer» B. automates the translation of assemble language into machine language |
180. |
disadvantage of compiler and go loading scheme is that |
A. | a position of memory is wasted because the case occupied by the assembler is unavailable the object program |
B. | it is necessary to retranslate the users program check every time it is run |
C. | it is very difficult to handle multiple segments especially if the source programs are in different language and to produce overlay modular programs |
D. | all of the above |
Answer» D. all of the above |
181. |
which of the following are language processors |
A. | assembler |
B. | compilers |
C. | interpreter |
D. | all of these |
Answer» A. assembler |
182. |
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» C. assembly language to machine language |
183. |
Numerous binding are performed amid program execution is called_ _ _ _ |
A. | run time binding |
B. | late binding |
C. | both a) & b) |
D. | early binding |
Answer» C. both a) & b) |
184. |
Binding is done at_ _ _ |
A. | translation time |
B. | execution time |
C. | both a) & b) |
D. | none |
Answer» B. execution time |
185. |
Execution time binding is also called as |
A. | run time bindind |
B. | both |
C. | early binding |
D. | none |
Answer» C. early binding |
186. |
Binding is chosen by ....... |
A. | programmer |
B. | loader |
C. | translator |
D. | all of above |
Answer» D. all of above |
187. |
The time amid program formulation or processing when this decision is made is named........ |
A. | binding period |
B. | binding cycle |
C. | binding time |
D. | none |
Answer» C. binding time |
188. |
Which of the following logic is used to produce loops in programme logic?1)A data object that is characterized and named unequivocally in a program is named as…………... |
A. | value. |
B. | variables. |
C. | name. |
D. | scope. |
Answer» B. variables. |
189. |
The function with the name ___________ is always written in every program |
A. | int |
B. | main |
C. | void |
D. | factorial |
Answer» B. main |
190. |
The scope of a variable declared externally, is__________ |
A. | local within the function declared |
B. | global |
C. | in multiple programs |
D. | none of the above |
Answer» C. in multiple programs |
191. |
The scope of a variable declared as static storage class is__________ |
A. | local within the function declared |
B. | in multiple programs |
C. | global |
D. | none of the above |
Answer» A. local within the function declared |
192. |
__________binding is used to define the scope in terms of the lexical structure of a program. |
A. | static scope. |
B. | dynamic scope. |
C. | both |
D. | none of these |
Answer» A. static scope. |
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.