Register

UGC NET CSE | November 2017 | Part 3 | Question: 50

• edited by
345 views
1 votes
1 votes

Consider a virtual page reference string $7,0,1,2,0,3,0,4,2,3,0,3,2,1,2,0,1,7,0,1$. Suppose a demand paged virtual memory system running on a computer system such that the main memory has $3$ page frames. Then ______ page replacement algorithm has minimum number of page faults.

  1. FIFO
  2. LIFO
  3. LRU
  4. Optimal
• edited by
User Avatar

Please log in or register to answer this question.

Voting & Accepting an answer helps improve the community
Answer:
← PreviousNext →
← Previous in categoryNext in category →

Related questions

1 votes
1 votes
3 answers
1
Arjun asked Nov 5, 2017
870 views
UGC NET CSE | November 2017 | Part 3 | Question: 74
Which of the following routing technique / techniques is/are used in distributed systems? Fixed Routing Virtual Routing Dynamic Routing (a) only (a) and (b) only (c) only All (a), (b), (c)
Which of the following routing technique / techniques is/are used in distributed systems?Fixed RoutingVirtual RoutingDynamic Routing(a) only(a) and (b) only(c) onlyAll (a...
User Avatar
1 votes
1 votes
2 answers
3
Arjun asked Nov 5, 2017
954 views
UGC NET CSE | November 2017 | Part 3 | Question: 72
The Sigmoid activation function $f(t)$ is defined as $\dfrac{1}{\text{exp} (t) + \text{exp} (-t)}$ $t \text{ exp}(-t)$ $\dfrac{1}{1+ \text{exp} (t)}$ $\dfrac{1}{1+ \text{exp} (-t)}$
The Sigmoid activation function $f(t)$ is defined as$\dfrac{1}{\text{exp} (t) + \text{exp} (-t)}$$t \text{ exp}(-t)$$\dfrac{1}{1+ \text{exp} (t)}$$\dfrac{1}{1+ \text{exp...
User Avatar
Link Copied!