edited by
12,866 views

4 Answers

Best answer
45 votes
45 votes

The answer is (A) and (B).

Virtual memory concept is independent of size of main memory and depends only on the availability of the secondary storage.

MAR holds the address generated by CPU and this obviously limits the total virtual memory address space.

edited by
14 votes
14 votes

By "Virtual Memory system", they mean "process or program which we store in RAM" (Physical memory system means RAM itself)

A) is TRUE because if MAR size is 32 bits ..then we cannot have a process of size more than 232 addressable units (say Bytes)... If we have (232 +1) bytes then one of the byte cannot be accessed  by CPU as MAR has only 32 bits instead of 33 bits ...

B) is TRUE because though we can have process of size more than the RAM size using Virtual Memory concept.. we cannot have a process of size more than Hard-disk size ... 

C) is FALSE because we can have a process of size more than RAM as we saw ... 

edited by
3 votes
3 votes
Yes, it does. Say if 'n' address lines are there.. then a process can generate virtual address in the range from 0 to 2^n - 1 . So, this address space for a process is always limited by length of MAR. And if you consider as a whole, the total virtual address space must be a proper subset of Secondary Storage for obvious reasons that you cant create and save more pages than external storages, though it is flexible.
Answer:

Related questions

11.2k
views
4 answers
43 votes
Kathleen asked Sep 12, 2014
11,161 views
Indicate all the false statements from the statements given below:The amount of virtual memory available is limited by the availability of the secondary ... fit techniques for memory allocation ensures that memory will never be fragmented.
11.9k
views
6 answers
33 votes
Kathleen asked Sep 12, 2014
11,942 views
Let $r=1(1+0)^*, s=11^*0 \text{ and } t=1^*0 $ be three regular expressions. Which one of the following is true?$L(s) \subseteq L(r)$ ... \subseteq L(r)$L(t) \subseteq L(s)$ and $L(s) \subseteq L(r)$None of the above
9.7k
views
11 answers
42 votes
Kathleen asked Sep 12, 2014
9,695 views
If $F_1$, $F_2$ and $F_3$ are propositional formulae such that $F_1 \land F_2 \rightarrow F_3$ ... $F_1 \land F_2$ is not satisfiableNeither is tautologousNeither is satisfiableNone of the above
6.5k
views
2 answers
29 votes
Kathleen asked Sep 12, 2014
6,536 views
A link editor is a program that:matches the parameters of the macro-definition with locations of the parameters of the macro callmatches external names of ... text editor and the useracts as a link between compiler and the user program