Match List I with List II. List I: (A) Activation record, (B) Location counter, (C) Reference count, (D) Address relocation. List II: (I) Linker/loader, (II) Garbage collection, (III) Subroutine call, (IV) Assembler.
Pick an option to check yourself, or open the answer below.
Show answer & explanation
Correct answer: C. (A)-(IV), (B)-(III), (C)-(II), (D)-(I)
Explanation
An activation record is built for each subroutine call; the location counter is maintained by the assembler; reference counting is a garbage-collection technique; address relocation is done by the linker/loader.
Note on the official key: the official key says option A. Official/PW key is C. Activation records are created by subroutine calls and the location counter is maintained by the assembler, which is option A.
More Theory of Computation and Compilers questions
- Consider the grammar S → SbS | a. The string abababa has (A) two parse trees (B) two leftmost derivations (C) two rightmost derivations. Wh…
- Match List I with List II. List I: (A) Type 0, (B) Type 1, (C) Type 2, (D) Type 3. List II: (I) Finite automata, (II) Turing machine, (III)…
- Statement I: The LALR parser is more powerful than the canonical LR parser. Statement II: The SLR parser is more powerful than LALR. Which…
- Statement I: CFLs are closed under homomorphism. Statement II: CFLs are closed under complement. Which is correct?
- Assertion (A): A load-and-go assembler avoids the overhead of writing the object program out and reading it back in. Reason (R): This can b…
- Which of the following languages are not regular? A. L = {(01)ⁿ0ᵏ | n > k, k ≥ 0} B. L = {cⁿbᵏaⁿ⁺ᵏ | n ≥ 0, k ≥ 0} C. L = {0ⁿ1ᵏ | n ≠ k}