81. In C programming, the qualifiers ‘signed’ and ‘unsigned’ apply to
1. Char
2. Float
3. Int
4. Double
2. Float
3. Int
4. Double
(a) 1 and 4
(b) 2 and 3
(c) 1 and 3
(d) 2 and 4
(b) 2 and 3
(c) 1 and 3
(d) 2 and 4
Answer: (c)
82. When a compiler encounters a function parameter for a single-subscripted array of the form int a [ ], it converts the parameter to:
(a) Int a
(b) Int & a
(c) Int * a
(d) No conversion is required
(a) Int a
(b) Int & a
(c) Int * a
(d) No conversion is required
Answer: (c)
83. The dominator node in DAG represents
(a) Any node of DAG which represents start of loop
(b) Last node of DAG
(c) Node with highest degree of DAG
(d) Isolated node of DAG
(a) Any node of DAG which represents start of loop
(b) Last node of DAG
(c) Node with highest degree of DAG
(d) Isolated node of DAG
Answer: (a)
84. Which of the following is used for grouping of characters into tokens?
(a) Parser
(b) Code optimization
(c) Code generator
(d) Lexical analyzer
(a) Parser
(b) Code optimization
(c) Code generator
(d) Lexical analyzer
Answer: (d)
85. Consider the following contents of different registers:
Offset (displacement) = 5000 H
[AX]−1000 𝐻 , [BX]−2000𝐻 , [SI]−4000𝐻 , [DI]−3000𝐻
[BP]−5000 𝐻 , [SP]−6000𝐻 , [CS]−0000𝐻 , [DS]−2000𝐻
[SS]−3000 𝐻 , [IP]−7000𝐻 ,
[AX]−1000 𝐻 , [BX]−2000𝐻 , [SI]−4000𝐻 , [DI]−3000𝐻
[BP]−5000 𝐻 , [SP]−6000𝐻 , [CS]−0000𝐻 , [DS]−2000𝐻
[SS]−3000 𝐻 , [IP]−7000𝐻 ,
What is the effective address of the data for the following instruction?
MOV AX, [BX ] [SI]
(a) 20000𝐻
(b) 25000𝐻
(c) 26000𝐻
(d) 30000𝐻
(b) 25000𝐻
(c) 26000𝐻
(d) 30000𝐻
Answer: (c)
86. In a 𝐶 program, a programmer has written following line in a function.
x=100+"hello"; //x defined as integer data type
Which part of compiler will detect the error?
(a) Lexical Analyzer
(b) Syntax Analyzer
(c) Semantic Analyzer
(d) Intermediate code Generator
(a) Lexical Analyzer
(b) Syntax Analyzer
(c) Semantic Analyzer
(d) Intermediate code Generator
Answer: (c)
87. In a program, dead code occurs because of
(a) Aliasing
(b) Function in-lining and macros
(c) Loop invariant instructions and loop peeling
(d) Constant folding, constant propagation and copy propagation
(a) Aliasing
(b) Function in-lining and macros
(c) Loop invariant instructions and loop peeling
(d) Constant folding, constant propagation and copy propagation
Answer: (d)
88. In which method a Parse tree is created, a depending graph is drawn and then the semantic rules of the Parse tree nodes are evaluated in topological sorted order?
(a) Parse tree method
(b) Bottom up translation
(c) Top-down translation
(d) Recursive evaluator model
(a) Parse tree method
(b) Bottom up translation
(c) Top-down translation
(d) Recursive evaluator model
Answer: (a)
89. The Capability Maturity Model (CMM) level 5 defines:
(a) Initial mature work processes in software development organization
(b) Managed work processes in software development organization
(c) Optimizing work processes in software development organization
(d) Repeatable work processes in software development organization
(a) Initial mature work processes in software development organization
(b) Managed work processes in software development organization
(c) Optimizing work processes in software development organization
(d) Repeatable work processes in software development organization
Answer: (c)
90. Consider the following statements:
The UML sequence diagram shows
1. Lifelines of processes along vertical lines
2. Sequence of operations within a process
3. Interactions among processes
1. Lifelines of processes along vertical lines
2. Sequence of operations within a process
3. Interactions among processes
Which of the above statements are correct?
(a) 1, 2 and 3
(b) 1 and 2 only
(c) 1 and 3 only
(d) 2 and 3 only
(a) 1, 2 and 3
(b) 1 and 2 only
(c) 1 and 3 only
(d) 2 and 3 only
Answer: (c)
0 Comments
Post a Comment