adplus-dvertising
341. Which of the following is a dangling reference?
a. Accessing a variable, that is developed but not initialized
b. Accessing a storage that in already disposed at the request of the processor
c. Accessing a storage that is already disposed at the request of the uses
d. All of these
Answer: (d).All of these

342. The language accepted by finite automata is
a. Context – free
b. Regular
c. Non – regular
d. None of these
Answer: (b).Regular

343. According to Brooks, if n is the number if programs in a project team, then the number of Communication path is
a. n(n-1)/2
b. n logn
c. n
d. n(n+1)/2
Answer: (a).n(n-1)/2

344. Top – down does not require
a. Step – wise refinement
b. loop invariants
c. flow charting
d. Modularity
Answer: (b).loop invariants

345. Which of the following is case required by top – down design?
a. flow charting
b. step – wise refinement
c. Modularity
d. All of these
Answer: (d).All of these

346. Regarding software requirements specifications, the case that is hardest to “fix” is
a. How user – friendly the system should be?
b. How fast the software system should run?
c. What the software system is to do?
d. How accurate the outputs should be?
Answer: (c).What the software system is to do?

347. BNF is a meta – language for
a. Specifying the syntax of a language
b. Describing how programs works
c. Shell programming
d. Real – time programming
Answer: (a).Specifying the syntax of a language

348. The principle, a function can always be replaced by its value ⁄ irrespective of the contexts, Without changing the meaning is called
a. Unbinding
b. Orthogonaeality
c. Context – free
d. Referential transparency
Answer: (d).Referential transparency

349. Use of recursion
a. Enhances logical clarity and reduces code size
b. Makes debugging easier
c. Reduces execution time
d. Makes software bug free
Answer: (a).Enhances logical clarity and reduces code size