Week 3

Which of the following are not part of the layout of a process in memory?

Why do the heap and run-time stack not have a fixed size (during program execution) like the other parts of the process layout in memory?

Which of the following are true regarding reference counts?

1) Reclaims unused memory as soon as it is no longer needed.

2) Is periodically run, so some allocated but unused memory is taking up heap space at various times.

3) Prevents any other computations while it is reclaiming unused memory.

4) Compacts the memory currently being used as part of the process.

5) None of the above

Which of the following are true regarding the Mark and Sweep garbage collection algorithm?

1) Reclaims unused memory as soon as it is no longer needed.

2) Is periodically run, so some allocated but unused memory is taking up heap space at various times.

3) Prevents any other computations while it is reclaiming unused memory.

4) Compacts the memory currently being used as part of the process.

5) None of the above

Which of the following are true regarding copying algorithms for garbage collection?

1) Reclaims unused memory as soon as it is no longer needed.

2) Is periodically run, so some allocated but unused storage is taking up heap space at various times.

3) Prevents any other computations while it is reclaiming unused memory.

4) Compacts the memory currently being used as part of the process.

5) None of the above

Compilers differ from interpreters by

1) Producing program output directly from the compiler.

2) Creating either object code or an intermediate code version of the program source code.

3) Analyzing program input to perform code optimization.

4) Supporting recursion in source programs.

5) None of the above

Which of the following compilation stages are responsible for ensuring that the program adheres to the language meaning and that the program is unambiguous?

Which of the following compilation stages are responsible for creating code (in another language) that corresponds to the original program?

Which of the following compilation stages are responsible for issuing compilation errors in a source program?

The complete set of terminals in the following grammar is: [1] ::= "(" ")" [2] | ATOM [3] | NUMBER [4] ::= [5] | "." [6] | epsilon

Which of the following are parts of a BNF grammar:

Imperative "statements"

1) Cause a change in program state.

2) Are generally more efficient than "declarative" statements.

3) Define new variables, types, and functions.

4) Are more reliable than "declarative" statements.

5) None of the above

Declarative "statements"

1) Cause a change in program state.

2) Are generally more efficient than "imperative" statements.

3) Define new variables, types, and functions.

4) Are more reliable than "imperative" statements.

5) None of the above

Week 3

More Quizzes