Answer:
A lookaside buffer translation (TLB) is a memory cache that reduces the time it takes to access a user memory place. TLB includes the most lately used page table entries.
TLB is used to overcome the issue of sizes at the time of paging. Page Table Entry (PTE) is used for framing the memory ,but it uses two references one for finding the frame number
and the other for the address specified by frame number.
<u>Formula for finding effective memory access time-</u>
Effective Memory Access Time = (TLB access_time+Memory Access Time)*hit ratio + (TLB access_time+2*Memory Access Time)*(miss ratio)
Given in question,
Hit ratio = 0.90
Memory Access Time = 150ns
TLB access time= 5ns
Effective Memory Access Time = (TLB access_time+Memory Access Time)*hit ratio + (TLB access_time+2*Memory Access Time)*(miss ratio)
=(5+150) * 0.90 + (5+2*150)*(1-0.90)
=155 * 0.90 + (305*0.1)
=139.5 + 30.5
= 170ns
Answer:
c. All use SW3's database because SW3 has the highest revision number.
Explanation:
In this particular configuration, the three switches will definitely be connected to one another by the presence of some path with the specific trunks. As a result, the database with the most revision number will ultimately win. The process of the STP election does not have any influence on the selection of the VTP.
Answer: I imagine conservative is the correct answer.
Explanation: However it's not the answer I agree with. As long as you stay anonymous online, there's no punishment to being outgoing.