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. Absolute, Relative.
B. Human, Absolute.
C. Controllable, Natural.
D. Relative, Controllable.
A. it is necessary to retranslate the users program and check everytime it is run
B. a portion of memory is wasted because the case occupied by the assembler is unavailable to the object program
C. all of these
D. it is very difficult to handle multiple segments, especially if the source programs are in different languages and to produce orderly modular programs
A. assign storage to all temporary locations that are necessary for intermediate results
B. assign storage to all variables referenced in the source program
C. all of these
D. assign storage to literals, and to ensure that the storage is allocated and appropriate locations are initialized
A. syntax directed translations can be written for intermediate code generation
B. it makes implementation of lexical analysis and syntax analysis easier
C. it is not possible to generate code for real machines directly from high level language programs
D. it enhances the portability of the front end of the compiler
A. run test, prog
B. compile prog 1, prog 2
C. 1001000010101
D. load R1 , A
A. removing loop invariant computation
B. replacing run-time computation by compile time computation
C. replacing a costly operation by a relatively cheaper one
D. removing common sub-expressions
A. linker
B. relocating loader itself
C. macro processor
D. assembler
A. the order in which computations are performed
B. the way the registers and addressing modes are used
C. all of these
D. the usage of machine idioms
A. entire data to be displayed
B. a part of data to be displayed .
C. no data to be displayed
D. full data display on full area of screen
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
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).