UGC(Dec 2015 P2)
closed

Amandeep Singh 1 asked Mar 3, 2017 • closed Mar 4, 2017 by Sanjay Sharma

461 views

0 votes

closed with the note: duplicate https://gateoverflow.in/62266/ugcnet-dec2015-ii-26?show=62276#a62276

A virtual memory has a page size of 1K words. There are eight pages and four blocks. The associative memory page table contains the following entries:

Which of the following list of virtual addresses (in decimal) will not cause any page fault if referenced by the CPU?

(A) 1024, 3072, 4096, 6144 (B) 1234, 4012, 5000, 6200

Operating System
operating-system

+ –

Amandeep Singh 1 asked Mar 3, 2017 • closed Mar 4, 2017 by Sanjay Sharma

Amandeep Singh 1

461 views

See all

0 Please log in or register to add a comment.

0 Answers

Voting & Accepting an answer helps improve the community

← Previous Next →

← Previous in category Next in category →

Related questions

0 votes

1 answer

kamogelommoyane asked Mar 10

211 views

Three process P1, P2 and P3 arrive at time zero. Their total execution time is 10ms, 20ms, and 30ms respectively. They spent first 20% of their execution time in doing I/O, next 70% in CPU processing and the last 10% again doing I/O. For what percentage of time was the CPU free? Using SRTF algorithm

kamogelommoyane

211 views

kamogelommoyane asked Mar 10

Operating System
operating-system

+ –

0 votes

2 answers

syncronizing asked Jan 6, 2019

4,896 views

the processes P1, P2, and P3. The S1, S2 and S3 are counting semaphore variables
Consider the following synchronization construct used by the processes P1, P2, and P3. The S1, S2 and S3 are counting semaphore variables: S1 = 3, S2 = 2, S3 = 1; P(S1); P(S2); P(S3); Critical Section V(S3); V(S2); V(S1); Does it satisfy mutual exclusion, progress and bounded waiting?

Consider the following synchronization construct used by the processes P1, P2, and P3. The S1, S2 and S3 are counting semaphore variables:S1 = 3, S2 = 2, S3 = 1;P(S1);P(S...

syncronizing

4.9k views

syncronizing asked Jan 6, 2019

Operating System
made-easy-test-series
semaphore
operating-system

+ –

4 votes

1 answer

kanikool asked Sep 9, 2014

5,083 views

Consider two processors P1 and P2 executing the same instruction set.
Consider two processors P1 and P2 executing the same instruction set. Assume that under identical conditions, for the same input, a program running on P2 takes 25% less time but incurs 20% more CPI (clock cycles per instruction) ... of P1 is 1GHz, then the clock frequency of P2 (in GHz) is _________. please do explain also

Consider two processors P1 and P2 executing the same instruction set. Assume that under identical conditions, for the same input, a program running on P2 takes 25% less t...

kanikool

5.1k views

kanikool asked Sep 9, 2014

Operating System
operating-system
normal

+ –

0 votes

1 answer

Mukesh_Kumar asked Dec 30, 2023

633 views

Let there are 4 processes P1, P2, P3 and P4 whose arrival time is 0 milliseconds and CPU burst time are 6, 8, 7 and 3 milliseconds respectively. If the operating system uses shortest job first scheduling algorithm, then the difference between waiting time of process P3 and P₁ is 1) 3 milliseconds 2) 6 milliseconds 3) 9 milliseconds 4) 12 milliseconds

Mukesh_Kumar

633 views

Mukesh_Kumar asked Dec 30, 2023

tags	tag:apple
author	user:martin
title	title:apple
content	content:apple
exclude	-tag:apple
force match	+apple
views	views:100
score	score:10
answers	answers:2
is accepted	isaccepted:true
is closed	isclosed:true

0 reply

Please log in or register to add a comment.

0 Answers

Related questions

0