Login
Register
Dark Mode
Brightness
Profile
Edit Profile
Messages
My favorites
My Updates
Logout
Filter
Profile
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
Questions by biranchi
9
votes
4
answers
1
Demand Paging
Suppose: TLB lookup time = 20 ns TLB hit ratio = 80% memory access time = 75 ns swap page time = 500,000 ns 75% of pages are dirty OS uses a 3 level page table What is the effective access time (EAT) if we assume the page fault rate is 15% ?
Suppose:TLB lookup time = 20 nsTLB hit ratio = 80%memory access time = 75 nsswap page time = 500,000 ns75% of pages are dirtyOS uses a 3 level page tableWhat is the effec...
4.8k
views
asked
Jan 25, 2017
Operating System
operating-system
demand-paging
memory-management
multilevel-paging
+
–
1
votes
0
answers
2
Loop invariants [GateBook]
532
views
asked
Jan 24, 2017
Programming in C
programming
datas
data-structures
algorithms
+
–
1
votes
0
answers
3
Set Counting [GateBook]
348
views
asked
Jan 24, 2017
Set Theory & Algebra
counting
set-theory&algebra
+
–
1
votes
0
answers
4
Functions fog, gof [GateBook]
644
views
asked
Jan 24, 2017
Set Theory & Algebra
functions
discrete-mathematics
+
–
5
votes
1
answer
5
Threading in OS [GateBook]
714
views
asked
Jan 24, 2017
Operating System
operating-system
threads
+
–
3
votes
0
answers
6
Set Associative Cache [GateBook]
410
views
asked
Jan 24, 2017
CO and Architecture
co-and-architecture
cache-memory
+
–
1
votes
2
answers
7
Data Hazards [GateBook]
2.1k
views
asked
Jan 24, 2017
CO and Architecture
pipelining
data-hazards
co-and-architecture
+
–
3
votes
3
answers
8
Packet Switched Network [GateBook]
1.1k
views
asked
Jan 24, 2017
Computer Networks
computer-networks
ip-packet
+
–
5
votes
1
answer
9
Packet Fragmentation on Routers [GateBook]
800
views
asked
Jan 24, 2017
Computer Networks
computer-networks
fragmentation
routing
+
–
2
votes
1
answer
10
TCP Sequence Number [GateBook]
694
views
asked
Jan 24, 2017
Computer Networks
computer-networks
sequencenumber
tcp
+
–
1
votes
1
answer
11
Ethernet Backoff Algorithm [GateBook]
529
views
asked
Jan 24, 2017
Computer Networks
ethernet
computer-networks
+
–
3
votes
1
answer
12
No. of injective functions ( TestBook Test Series 2 )
461
views
asked
Jan 23, 2017
Set Theory & Algebra
functions
discrete-mathematics
+
–
1
votes
2
answers
13
Minimum Spanning Tree ( TestBook Test Series 2)
675
views
asked
Jan 23, 2017
DS
minimum-spanning-tree
graph-algorithms
+
–
1
votes
1
answer
14
Regular and CFL (TestBook Test Series 2)
660
views
asked
Jan 22, 2017
Theory of Computation
theory-of-computation
regular-language
context-free-language
+
–
0
votes
1
answer
15
Demand Paging (TestBook Test Series 2)
477
views
asked
Jan 22, 2017
Operating System
operating-system
demandpaging
+
–
4
votes
1
answer
16
Demand Paging
Consider a demand-paging system with a paging disk that has average access and transfer time of 20 milliseconds. Addresses are translated through a page table in main memory, with an access time of 1 microsecond per memory access. Thus, each memory reference ... , 10 percent (or 2 percent of the total) cause page faults. What is the effective memory access time in milliseconds?
Consider a demand-paging system with a paging disk that has average access and transfer time of 20 milliseconds. Addresses are translated through a page table in main me...
10.1k
views
asked
Jan 22, 2017
Operating System
operating-system
demand-paging
memory-management
+
–
5
votes
1
answer
17
Acknowledgement Number in Selective Repeat protocol.
Consider a sliding window protocol that uses Selective Repeat , the sender sliding window size is 32 . The sequence number of the frame to be sent after sending 200 frames ______ After receiving first 100 frames the acknowledgement number that is piggybacked by the receiver along with data frame is _______
Consider a sliding window protocol that uses Selective Repeat , the sender sliding window size is 32 .The sequence number of the frame to be sent after sending 200 frames...
3.1k
views
asked
Nov 27, 2016
Computer Networks
computer-networks
selective-repeat
+
–
2
votes
2
answers
18
Pipelining and CPI
Consider a non-pipelined processor design which has a cycle time of 10ns and average CPI of 1.4. If each pipeline stage adds extra 20ps due to register setup delay. The pipeline stalls 20% of the time for 1 cycle and 5% of the time for 2 cycles (these occurrences are disjoint). What is the new CPI?
Consider a non-pipelined processor design which has a cycle time of 10ns and average CPI of 1.4. If each pipeline stage adds extra 20ps due to register setup delay. The p...
2.7k
views
asked
Nov 17, 2016
CO and Architecture
co-and-architecture
pipelining
bad-question
+
–
3
votes
2
answers
19
No. of Tag bits in Set Associative cache memory.
Consider the memory system in which the block size in cache and main memory are equal. Cache consists of 512 blocks and main memory consists of 8192 blocks. Cache is 4-way set associative ,calculate the number of tag bits in cache?
Consider the memory system in which the block size in cache and main memory are equal. Cache consists of 512 blocks and main memory consists of 8192 blocks. Cache is 4-wa...
4.9k
views
asked
Nov 16, 2016
CO and Architecture
co-and-architecture
cache-memory
memory-interfacing
+
–
1
votes
0
answers
20
Regular and Non Regular set
Consider the following subsets of {a,b,S}* A={xy| x,y∊{a,b}* , #a(x)=#b(y)} B={xSy| x,y∊{a,b}* , #a(x)=#b(y)} {where S=$} Which of the following statements are true ? (A) A and B are both regular (B) A is regular but B is not (C) A is not regular but B is regular (D) Both are non-regular
Consider the following subsets of {a,b,S}*A={xy| x,y∊{a,b}* , #a(x)=#b(y)}B={xSy| x,y∊{a,b}* , #a(x)=#b(y)}{where S=$}Which of the following statements are true ?(A) ...
1.1k
views
asked
May 24, 2016
Theory of Computation
theory-of-computation
regular-language
non-regular
+
–
Page:
1
2
next »
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register
