edited by
5,826 views
21 votes
21 votes

The correct matching for the following pairs is
$$\begin{array}{ll|ll} \text{(A)}&\text{Activation record} & \text{(1)} &\text{Linking loader} \\
  \text{(B)} &\text{Location counter} & \text{(2)} &\text{Garbage collection} \\
  \text{(C)}& \text{Reference counts} & \text{(3)} &\text{Subroutine call} \\
 \text{(D)}& \text{Address relocation} & \text{(4)}& \text{Assembler}  \\ \end{array}$$

  1. $\text{A-3 B-4 C-1 D-2}$

  2. $\text{A-4 B-3 C-1 D-2}$

  3. $\text{A-4 B-3 C-2 D-1}$

  4. $\text{A-3 B-4 C-2 D-1}$

edited by

1 Answer

Best answer
63 votes
63 votes

(D) Option

Each time a sub routine is called, its activation record is created.

An assembler uses location counter value to give address to each instruction which is needed for relative addressing as well as for jump labels.

Reference count is used by garbage collector to clear the memory whose reference count becomes $0$.

Linker Loader is a loader which can load several compiled codes and link them together into a single executable. Thus it needs to do relocation of the object codes.

edited by
Answer:

Related questions

23 votes
23 votes
1 answer
1
Kathleen asked Oct 9, 2014
5,625 views
A critical section is a program segmentwhich should run in a certain amount of timewhich avoids deadlockswhere shared resources are accessedwhich must be enclosed by a pa...
19 votes
19 votes
4 answers
2
Kathleen asked Oct 9, 2014
9,047 views
What is the equivalent Boolean expression in product-of-sums form for the Karnaugh map given in Fig $B\overline{D} + \overline{B}D$$(B + \overline{C} +D) (\overline{B} + ...
24 votes
24 votes
2 answers
3
Kathleen asked Oct 9, 2014
8,368 views
Consider the circuit in figure. $f$ implements$\overline{A} \overline{B}C + \overline{A}B \overline{C} + ABC$$A + B + C$$A \oplus B \oplus C$$AB + BC + CA$
26 votes
26 votes
5 answers
4
Kathleen asked Oct 9, 2014
30,459 views
A binary search tree is generated by inserting in order the following integers:$$50, 15, 62, 5, 20, 58, 91, 3, 8, 37, 60, 24$$The number of nodes in the left subtree and ...