Aspire Faculty ID #18807 · Topic: UGC NET Computer Science Sep 2022 (Paper II) · Just now
UGC NET Computer Science Sep 2022 (Paper II)

Given below are two statements: one is labelled as Assertion (A) and the other is labelled as Reason (R):

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 be done with either one-pass or two pass assembler.

In the light of the above statements, choose the correct answer from the options given below:

Solution

Assertion (A):

A load-and-go assembler directly loads the translated machine code into memory for execution.

It does not create a separate object program file first.

So, it avoids two extra steps:

Writing the object program out

Reading the object program back in

Therefore, Assertion (A) is true.

Reason (R):

A load-and-go assembler can be implemented using one-pass assembler or two-pass assembler technique.

So, Reason (R) is also true.

But Reason (R) only tells that load-and-go can be done using one-pass or two-pass assembler.

It does not explain why the overhead of writing and reading the object program is avoided.

The overhead is avoided because the object code is loaded directly into memory.

Therefore, both (A) and (R) are true, but (R) is not the correct explanation of (A).

Previous 10 Questions — UGC NET Computer Science Sep 2022 (Paper II)

Nearest first
1
Of the following, which is NOT a logical error?
Topic: UGC NET Computer Science Sep 2022 (Paper II)
2
Given below are two statements: one is labelled as Assertion (A) and the other is labelled as Reason (R):Assertion (A):…
Topic: UGC NET Computer Science Sep 2022 (Paper II)
3
A good software requirement specification does NOT have the characteristic
Topic: UGC NET Computer Science Sep 2022 (Paper II)
4
Consider the following in Boolean Algebra$X:a\lor(b\land(a\lor c))=(a\lor b)\land(a\lor c)$$Y:a\land(b\lor(a\land c))=(…
Topic: UGC NET Computer Science Sep 2022 (Paper II)
5
Consider the following statements about Context Free Language (CFL):Statement I: CFL is closed under homomorphism.State…
Topic: UGC NET Computer Science Sep 2022 (Paper II)
6
Consider the following statements:Statement I: LALR parser is more powerful than canonical LR Parser.Statement II: SLR …
Topic: UGC NET Computer Science Sep 2022 (Paper II)
7
A top down approach to programming calls for:Statement I: Working from the general to the specific.Statement II: Postpo…
Topic: UGC NET Computer Science Sep 2022 (Paper II)
8
Consider the following statements:Statement I: Composite attributes cannot be divided into smaller subparts.Statement I…
Topic: UGC NET Computer Science Sep 2022 (Paper II)
9
Consider the following statements:Statement I: Conservative 2 PL is a deadlock-free protocol.Statement II: Thomas's wri…
Topic: UGC NET Computer Science Sep 2022 (Paper II)
10
Consider the following statements of approximation algorithm:Statement I: Vertex-cover is a polynomial time 2-approxima…
Topic: UGC NET Computer Science Sep 2022 (Paper II)

Next 10 Questions — UGC NET Computer Science Sep 2022 (Paper II)

Ascending by ID
Ask Your Question or Put Your Review.

loading...