Bissoy.com
Doctors Medicines MCQs Q&A

Related Questions

Consider a system with 2 level caches. Access times of Level 1 cache, Level 2 cache, and main memory are 1 ns, 10 ns, and 500 ns, respectively. The hit rates of Level 1 and Level 2 caches are 0.8 and 0.9, respectively. What is the average access time of the system ignoring the search time within the cache? 
Assume a two-level inclusive cache hierarchy, L1 and L2, where L2 is the larger of the two. Consider the following statements. S1: Read misses in a write through L1 cache do not result in writebacks of dirty lines to the L2. S2: Write allocate policy must be used in conjunction with write through caches and no-write allocate policy is used with writeback caches. Which of the following statements is correct? 
Mr.Rohan while helping the students of Class IV in adding and subtracting fractions observed that several students are not able to complete the addition of two improper fractions. He gave a small test with questions from the addition of proper fractions (one item of addition of two similar fractions, three items from the addition of proper and improper fractions, and four items from the addition of improper fractions). He analyzed the responses of each student and found that nearly 45% of students were not clear in adding proper with improper fractions which were affecting their performance in adding two improper fractions. He, therefore, focused on developing the understanding of improper fractions and their addition with proper fractions after which he proceeded to teach the addition of two improper fractions. Which kind of assessment is depicted by this situation?
Terracotta is different than most clustered caches today because it has no visible API
Consider a fully-associative data cache with 32 blocks of 64 bytes each. The cache uses LRU (Least Recently Used) replacement. Consider the following C code to sum together all of the elements of a 64 by 64 two-dimensional array of 64-bit double-precision floating point numbers. double sum (double A [64] [64] ) { int i, j ; double sum = 0 ; for (i = 0 ; i < 64; i++) for (j = 0; j < 64; j++) sum += A [i] [j] ; return sum ; } Assume all blocks in the cache are initially invalid. How many cache misses will result from the code?
Consider a computer with 8 Mbytes of main memory and a 128K cache. The cache block size is 4 K. It uses a direct mapping scheme for cache management. How many different main memory blocks can map onto a given physical cache block?
In a group, 29 people like to watch movies, 35 people like to watch web series and 34 people like to watch YouTube videos. Also, 13 people like to watch only movies, 21 people like to watch only web series and 15 people like to watch only YouTube videos. 4 of them like to watch only movies and web series. 3 of them like to watch movies, web series and YouTube videos as well. How many people like to watch both movies and YouTube videos?
Assume a memory access to main memory on a cache "miss" takes 30 ns and a memory access to the cache (on a cache "hit") takes 3 ns. If 80% of the processor's memory requests results in a cache "hit", what is the average memory access time?
What will happen when the data of the jQuery.cache is read from an element? b) Data is read from jQuery.cache c) Unique number is retrieved as elem & Data is read from jQuery.cache d) Data is cleared from jQuery.cache
Fact 1: All dogs like to run.
Fact 2: Some dogs like to swim.
Fact 3: Some dogs look like their masters.

If the first three statements are facts, which of the following statements must also be a fact?
I: All dogs who like to swim look like their masters.
II: Dogs who like to swim also like to run.
III: Dogs who like to run do not look like their masters.