questions

A. Absolute, Relative.
B. Human, Absolute.
C. Controllable, Natural.
D. Relative, Controllable.
A. At q = 0.
B. At q = fourth root of 14.
C. Never; w(q) is always concave up.
D. Never; w(q) is always concave down.
A. Yes, at (2, -2).
B. Yes, at (-2, -2).
C. No.
D. Yes, at (8, -2).
A. the constant of anti-differentiation.
B. the constant of differentiation.
C. the constant of death and taxes.
D. the constant of integration.
A. x3
B. 6x
C. 6x C
D. x3 C
A. g ''(p) > 0
B. g ''(p) = 0
C. There's no way to tell without first knowing what the specific function is.
D. g ''(p) < 0
A. A word used a lot on a popular medical television series.
B. A gear box on the back end of your car.
C. A method of directly relating how changes in a dependent variable affect changes in an independent variable
D. A method of directly relating how changes in an independent variable affect changes in a dependent variable.
A. The concavity must be negative.
B. The concavity must also be positive.
C. The concavity must be imaginary
D. The concavity must be neutral (0).
A. make an inquiry
B. add a new name
C. all of above
D. add a new name and make an inquiry
A. C0 = 1, C1 = -21
B. C0 = -1, C1 = 21
C. C0 = 0, C1 = 1
D. C0 = -1, C1 = 19
A. Flow graph
B. DAG
C. Hamiltonion graph
D. control graph
A. A boundary condition.
B. A lot of luck.
C. Its real world application
D. What its value is at (0, 0).
A. loop optimization
B. local optimization
C. data flow analysis
D. constant folding
A. is used to remember which of the following general purpose registers are currently available as base registers, and what base addresses they contain
B. allows the programmer to write base registers and displacements explicitly in the source program
C. is a term that refers to control programs of an O.S
D. allows multiple programs to reside in separate areas of care at the same time
A. protection of storage area allocated to a program from illegal access by othere programs in the system
B. allocation/ deallocation of storage to programs
C. both ( a ) and ( b )
D. the status of each program
A. if left hand side of a production is a single terminal
B. if terminal set and non-terminal set are not disjoint
C. all of these
D. if left hand side of a production has no non ­terminal
A. at the most 3 address
B. exactly 3 address
C. none of these
D. no unary operators
A. a compiler cannot be written for L ; an interpreter must be used
B. a compiler using static memory allocation can be written for L
C. None of above
D. a compiler using dynamic memory allocation can be written for L
A. it never gets into an infinite loop
B. it is simple to implement
C. none of these
D. both ( and (
A. syntax trees
B. postfix notation
C. all of these
D. three address codes