Reference no: EM13952899
1. The _______ of a variable is its ________.
a. address; l-value
b. value; r-value
c. address; r-value
d. value; l-value
e. a and b
f. c and d
2. When a variable's type is determined through default conventions, the type declaration is:
a. omitted.
b. implicit.
c. explicit.
d. required.
3. The goto statement is the basis for the:
a. break statement in a C switch structure.
b. exit statement in an FORTRAN 90 loop structure.
c. last statement in a Perl loop structure.
d. All of the above.
e. None of the above.
4. An advantage of dynamic scoping is that access to nonlocal variables is considerably faster than accesses to nonlocals when static scoping is used.
a. True
b. False
5. The idea of providing a few basic data types and methods for programmers to design data structures to meet their needs was introduced with:
a. FORTRAN
b. COBOL
c. PL/I
d. ALGOL 68
6. In JavaScript, an incorrect RHS data type:
a. can be detected and reported at runtime.
b. cannot be detected, resulting in aberrant execution.
c. results in the type of the LHS being changed to match.
d. none of the above.
7. A given variable's storage bindings are determined at runtime but its data type is bound prior to runtime. This type of variable is termed:
a. static.
b. dynamic.
c. heap-dynamic.
d. stack-dynamic.
8. ALGOL 60 introduced __________, which has been copied by most imperative languages and many non-imperative languages.
a. static scope
b. dynamic scope
c. stack-dynamic scope
d. heap-dynamic scope
9. _________ is based on the calling sequence of subprograms.
a. Dynamic scope
b. Static scope
c. Stack-dynamic scope
d. Heap-dynamic scope
10. A(n) __________ is the collection of attributes of a variable.
a. abstract data type
b. structure
c. record
d. descriptor
11. Associativity in common imperative languages is left to right.
a. True
b. False
12. Programmers can alter associativity and precedence rules by:
a. overloading operators.
b. defining constants.
c. managing heap allocation/deallocation.
d. using parenthesis.
13. The simplest of all data types is:
a. integer.
b. Boolean.
c. bit.
d. character.
14. When an array's subscript ranges are determined at compile time, but the allocation is done at runtime, the array is:
a. static.
b. fixed stack-dynamic.
c. stack-dynamic.
d. heap-dynamic.
15. If every element of a list must be processed, a(n) ___________ is more efficient than a(n) __________.
a. hash; array
b. array; hash
c. record; array
d. hash; record
16. A pointer that contains the address of a heap-dynamic variable that has been deallocated is called:
a. a dangling pointer.
b. garbage.
c. lost pointer.
d. inaccessible variable.
17. Selection statements fall into two general categories, two-way and n-way, or single-way selection.
a. True
b. False
18. When the result of an expression is determined without evaluating all of the operands or operators, the evaluation is said to be:
a. short-sight.
b. short-hand.
c. short-circuit.
d. none of the above.
19. When selection must be based on a Boolean expression, the best approach is a(n) ___________ control structure.
a. if..then
b. case
c. switch
d. b or c, depending on the language
20. An iterative statement is one that causes a statement or collection of statements to be executed one or more times.
a. True
b. False
21. When the number of iterations is dependent on the number of elements in a data structure, JavaScript programmers may use the _______ control structure.
a. do...until
b. for
c. foreach
d. while
22. Using the precedence rules of APL, the value of the expression 24 x 3 + 1 is 73.
a. True
b. False
23. When two pointer variables point to the same memory location, they are said to be:
a. identical.
b. commingled.
c. conflicted.
d. aliases.
24. The association of an entity and an attribute that is done before runtime and does not change during execution is a:
a. dynamic binding.
b. dynamic linking.
c. static binding.
d. static linking.
25. If a mathematical operation is associative, then the corresponding floating-point operation is associative.
a. True
b. False