Login
Register
@
Dark Mode
Profile
Edit my Profile
Messages
My favorites
Register
Activity
Q&A
Questions
Unanswered
Tags
Subjects
Users
Ask
Previous Years
Blogs
New Blog
Exams
Dark Mode
Institute of Technology, GNCTD
rsansiya111
asked
in
Operating System
Feb 25, 2022
280
views
1
vote
1
vote
If the average page-fault service time of 20 πs, a πAT of 80 πs and the probability of a page fault is 10 %. An effective access time will be:
2,000,672 πs
2,000,072 πs
2,000,036 πs
2,000,006 πs
virtual-memory
normal
rsansiya111
asked
in
Operating System
Feb 25, 2022
by
rsansiya111
280
views
answer
comment
Follow
share this
share
0 Comments
Please
log in
or
register
to add a comment.
Please
log in
or
register
to answer this question.
1
Answer
1
vote
1
vote
Effective memory access time = $0.9*80 + 0.1*20*10^6$ ns
= $2,000,072$ ns
Shoto
answered
Feb 25, 2022
by
Shoto
comment
Follow
share this
0 Comments
Please
log in
or
register
to add a comment.
← Previous
Next →
← Previous in category
Next in category →
Related questions
1
vote
1
vote
2
answers
1
Rishav Kumar Singh
asked
in
Algorithms
Jul 29, 2018
695
views
Massachusetts Institute of Technology Professors Ronald L. Rivest and Sivan Toledo
Suppose that you implement Dijkstra's algorithm using a priority queue algorithm that requires O(V ) time to initialize, worst-case f(V, E) time for each EXTRACT-MIN operation and worst-case g(V, E) time for each DECREASE- ... (worst-case) time does it take to run Dijkstra's algorithm on an input graph G = (V, E)?.
Rishav Kumar Singh
asked
in
Algorithms
Jul 29, 2018
by
Rishav Kumar Singh
695
views
greedy-algorithm
dijkstras-algorithm
1
vote
1
vote
0
answers
2
Rishav Kumar Singh
asked
in
Algorithms
Jul 29, 2018
347
views
Massachusetts Institute of Technology Professors Ronald L. Rivest and Sivan Toledo
Suppose you want to get from s to t on weighted graph G with nonnegative edge weights, but you would like to stop by u if it isn't too inconvenient. (Here too inconvenient means that it increases the length of ... It should either return the shortest path from s to t, or the shortest path from s to t containing u.
Rishav Kumar Singh
asked
in
Algorithms
Jul 29, 2018
by
Rishav Kumar Singh
347
views
greedy-algorithm
1
vote
1
vote
1
answer
3
Rishav Kumar Singh
asked
in
Algorithms
Jul 29, 2018
289
views
Massachusetts Institute of Technology Professors Ron Rivest and Srini Devadas
There exists a comparison sort of 5 numbers that uses at most 6 comparisons in the worst case. True or False and Why?
Rishav Kumar Singh
asked
in
Algorithms
Jul 29, 2018
by
Rishav Kumar Singh
289
views
algorithms
sorting
true-false
1
vote
1
vote
2
answers
4
gatecse
asked
in
Operating System
Sep 15, 2014
5,019
views
Page tables are stored in memory , which has access time of 100 ns.
Page tables are stored in memory , which has access time of 100 ns. The TLB holding 8 page table entries, has an access time of 10 ns. Using execution of process , it is found that 85 % of the time, a required page table ... requires 2 memory accesses and TLB requires one memory access. A) 38120 ns B) 40000 ns C) 40120 ns D) None
gatecse
asked
in
Operating System
Sep 15, 2014
by
gatecse
5.0k
views
operating-system
virtual-memory
normal
Subscribe to GATE CSE 2024 Test Series
Subscribe to GO Classes for GATE CSE 2024
Quick search syntax
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
Recent Posts
Post GATE 2024 Guidance [Counseling tips and resources]
GATE CSE 2024 Result Responses
[Project Contest] Pytorch backend support for MLCommons Cpp Inference implementation
Participating in MLCommons Inference v4.0 submission (deadline is February 23 12pm IST)
IIITH PGEE 2024 Test Series by GO Classes
Subjects
All categories
General Aptitude
(3.5k)
Engineering Mathematics
(10.4k)
Digital Logic
(3.6k)
Programming and DS
(6.2k)
Algorithms
(4.8k)
Theory of Computation
(6.9k)
Compiler Design
(2.5k)
Operating System
(5.2k)
Databases
(4.8k)
CO and Architecture
(4.0k)
Computer Networks
(4.9k)
Artificial Intelligence
(79)
Machine Learning
(48)
Data Mining and Warehousing
(25)
Non GATE
(1.4k)
Others
(2.7k)
Admissions
(684)
Exam Queries
(1.6k)
Tier 1 Placement Questions
(17)
Job Queries
(80)
Projects
(11)
Unknown Category
(870)
64.3k
questions
77.9k
answers
244k
comments
80.0k
users
Recent Blog Comments
category ?
Hi @Arjun sir, I have obtained a score of 591 in ...
download here
Can you please tell about IIT-H mtech CSE self...
Please add your admission queries here:...
Twitter
WhatsApp
Facebook
Reddit
LinkedIn
Email
Link Copied!
Copy