Translation Look-aside Buffer(TLB) is (A) a cache-memory in which item to be searched is compared one-by-one with the keys. (B) a cache-memory in which item to be searched is compared with all the keys simultaneously. (C) an associative memory in which item to be searched is compared one-by-one with the keys. (D) an associative memory in which item to be searched is compared with all the keys simultaneously.

Translation Look-aside Buffer(TLB) is (A) a cache-memory in which item to be searched is compared one-by-one with the keys. (B) a cache-memory in which item to be searched is compared with all the keys simultaneously. (C) an associative memory in which item to be searched is compared one-by-one with the keys. (D) an associative memory in which item to be searched is compared with all the keys simultaneously.
by

1 Answer

Answer :

(D) an associative memory in which item to be searched is compared with all the keys simultaneously.
by

Related questions

The virtual address generated by a CPU is 32 bits. The Translation Lookaside Buffer (TLB) can hold total 64 page table entries and a 4-way set associative (i.e. with 4- cache lines in the set). The page size is 4 KB. The minimum size of TLB tag is (A) 12 bits (B) 15 bits (C) 16 bits (D) 20 bits

Description : The virtual address generated by a CPU is 32 bits. The Translation Lookaside Buffer (TLB) can hold total 64 page table entries and a 4-way set associative (i.e. with 4- cache lines in the set). The page size is 4 KB. The minimum size of TLB tag is (A) 12 bits (B) 15 bits (C) 16 bits (D) 20 bits

Last Answer : (C) 16 bits Explanation: VirtualAddress = 32 bits PageSize = 4KB = 12 bits therefore : VPNTag = 20 bits, OffsetTag = 12 bits TLBEntryLength = VPNTag = 20 bits TotalTLBEntries = 64, 4-way implies ... therefore : TLBIndex = 4 bits TLBTag = TLBEntryLength - TLBIndex = 20 - 4 = 16 bits

In a paging system, it takes 30 ns to search translation Look-aside Buffer (TLB) and 90 ns to access the main memory. If the TLB hit ratio is 70%, the effective memory access time is: (1) 48 ns (2) 147 ns (3) 120 ns (4) 84 ns

Description : In a paging system, it takes 30 ns to search translation Look-aside Buffer (TLB) and 90 ns to access the main memory. If the TLB hit ratio is 70%, the effective memory access time is: (1) 48 ns (2) 147 ns (3) 120 ns (4) 84 ns

Last Answer : Answer: 2

What is the most appropriate function of Memory Management Unit (MMU) ? (A) It is an associative memory to store TLB (B) It is a technique of supporting multiprogramming by creating dynamic partitions (C) It is a chip to map virtual address to physical address (D) It is an algorithm to allocate and deallocate main memory to a process

Description : What is the most appropriate function of Memory Management Unit (MMU) ? (A) It is an associative memory to store TLB (B) It is a technique of supporting multiprogramming by creating dynamic partitions ... to physical address (D) It is an algorithm to allocate and deallocate main memory to a process 

Last Answer : (C) It is a chip to map virtual address to physical address

Define Translation-Lookaside Buffer (TLB)?

Description : Define Translation-Lookaside Buffer (TLB)?

Last Answer : Most commercial virtual memory systems incorporate a mechanism that can avoid the bulk of the main memory access called for by the virtual to physical addresses translation buffer. This may be done with a cache memory called a translation buffer, which retains the results of the recent translation.

Function of memory management unit is : (A) Address translation (B) Memory allocation (C) Cache management (D) All of the above

Description : Function of memory management unit is : (A) Address translation (B) Memory allocation (C) Cache management (D) All of the above

Last Answer : Answer: A

In IT, associative memory is called as (1) Virtual memory (2) Cache memory (3) Content addressable memory (4) Main memory

Description : In IT, associative memory is called as (1) Virtual memory (2) Cache memory (3) Content addressable memory (4) Main memory

Last Answer : Content addressable memory

The average case occurs in the Linear Search Algorithm when: (A) The item to be searched is in some where middle of the Array (B) The item to be searched is not in the array (C) The item to be searched is in the last of the array (D) The item to be searched is either in the last or not in the array

Description : The average case occurs in the Linear Search Algorithm when: (A) The item to be searched is in some where middle of the Array (B) The item to be searched is not in the array (C) The item to be searched is in the last of the array (D) The item to be searched is either in the last or not in the array

Last Answer : (A) The item to be searched is in some where middle of the Array

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: Image 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 (C) 1020, 3012, 6120, 8100 (D) 2021, 4050, 5112, 7100

Description : 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 ... 1234, 4012, 5000, 6200 (C) 1020, 3012, 6120, 8100 (D) 2021, 4050, 5112, 7100

Last Answer : Answer: C Explanation: The pages which are not in main memory are: 1020 will not cause page fault (1024-2047) 3012 will not cause page fault (3072-4095) 6120 will not cause page fault (4096-5119) 8100 will not cause page fault (6144-7167)

What is the name of a memory buffer used to accommodate a speed differential ? (1) Cache (2) Stack Pointer (3) Accumulator (4) Disc

Description : What is the name of a memory buffer used to accommodate a speed differential ? (1) Cache (2) Stack Pointer (3) Accumulator (4) Disc

Last Answer : Cache

In ............. method, the word is written to the block in both the cache and main memory, in parallel. (A) Write through (B) Write back (C) Write protected (D) Direct mapping

Description : In ............. method, the word is written to the block in both the cache and main memory, in parallel. (A) Write through (B) Write back (C) Write protected (D) Direct mapping

Last Answer : (A) Write through 

A specific editor has 200 K of program text, 15 K of initial stack, 50 K of initialized data, and 70 K of bootstrap code. If five editors are started simultaneously, how much physical memory is needed if shared text is used ? (A) 1135 K (B) 335 K (C) 1065 K (D) 320 K

Description : A specific editor has 200 K of program text, 15 K of initial stack, 50 K of initialized data, and 70 K of bootstrap code. If five editors are started simultaneously, how much physical memory is needed if shared text is used ? (A) 1135 K (B) 335 K (C) 1065 K (D) 320 K

Last Answer : (B) 335 K

How would you go about increasing the buffer cache hit ratio?

Description : How would you go about increasing the buffer cache hit ratio?

Last Answer : Use the buffer cache advisory over a given workload and then query the v$db_cache_advice table. If a change was necessary then I would use the alter system set db_cache_size command.

What is DB Buffer Cache Advisor?

Description : What is DB Buffer Cache Advisor?

Last Answer : The Buffer Cache Advisor provides advice on how to size the Database Buffer Cache to obtain optimal cache hit ratios. Member of Performance Advisors --> Memory Advisor pack.

What is kept in the Database Buffer Cache?

Description : What is kept in the Database Buffer Cache?

Last Answer : The database buffer cache is the portion of the SGA that holds copies of data blocks read from datafiles. All user processes concurrently connected to the instance share access to the database buffer cache.

______ are words that a programming language has set aside for its own use: a) Control Words b) Control Structure c) Reserved Words d) Reserved Keys e) None of The Above

Description : ______ are words that a programming language has set aside for its own use: a) Control Words b) Control Structure c) Reserved Words d) Reserved Keys e) None of The Above

Last Answer : c) Reserved Words

The directory can be viewed as .................... that translates filenames into their directory entries. (A) Symbol table (B) Partition (C) Swap space (D) Cache

Description : The directory can be viewed as .................... that translates filenames into their directory entries. (A) Symbol table (B) Partition (C) Swap space (D) Cache

Last Answer : (A) Symbol table

Pipelining improves performance by: (A) decreasing instruction latency (B) eliminating data hazards (C) exploiting instruction level parallelism (D) decreasing the cache miss rate

Description : Pipelining improves performance by: (A) decreasing instruction latency (B) eliminating data hazards (C) exploiting instruction level parallelism (D) decreasing the cache miss rate

Last Answer : (C) exploiting instruction level parallelism

What is a Buffer and what is its use?

Description : What is a Buffer and what is its use?

Last Answer : A: Buffer is a temporary memory used for efficient input and output operations.

In Unix operating system, special files are used to : (A) buffer data received in its input from where a process reads (B) provide a mechanism to map physical device to file names (C) store list of file names plus pointers associated with i-nodes (D) store information entered by a user application program or utility program

Description : In Unix operating system, special files are used to : (A) buffer data received in its input from where a process reads (B) provide a mechanism to map physical device to file names (C ... pointers associated with i-nodes (D) store information entered by a user application program or utility program

Last Answer : (B) provide a mechanism to map physical device to file names 

What is the scientific basis of associative memory?

Description : What is the scientific basis of associative memory?

Last Answer : We don’t know how memories are stored let alone how they associate. Neuroscience is fairly young. It has made a lot of interesting discoveries, but it has a long way to go. Figuring out the organization of billions neurons is no small task.

Which of the following is not a component of a production system? a.Control System b.Associative Memory c.Primary Memory d.Secondary Memory

Description : Which of the following is not a component of a production system? a.Control System b.Associative Memory c.Primary Memory d.Secondary Memory

Last Answer : b.Associative Memory

Given the following statements : S1 : SLR uses follow information to guide reductions. In case of LR and LALR parsers, the look-aheads are associated with the items and they make use of the left context available to the parser. S2 : LR grammar is a larger sub-class of context free grammar as compared to that SLR and LALR grammars. Which of the following is true ? (A) S1 is not correct and S2 is not correct. (B) S1 is not correct and S2 is correct. (C) S1 is correct and S2 is not correct. (D) S1 is correct and S2 is correct.

Description : Given the following statements : S1 : SLR uses follow information to guide reductions. In case of LR and LALR parsers, the look-aheads are associated with the items and they make use of the left context available to ... (C) S1 is correct and S2 is not correct. (D) S1 is correct and S2 is correct.

Last Answer : (D) S1 is correct and S2 is correct.

What's the best item you've found in a cache?

Description : What's the best item you've found in a cache?

Last Answer : …anyone who hasn’t heard of this will want to check it out here :)

With ................ only one process can execute at a time; meanwhile all other process are waiting for the processer. With .............. more than one process can be running simultaneously each on a different processer. A) Multiprocessing, Multiprogramming B) Multiprogramming, Uniprocessing C) Multiprogramming, Multiprocessing D) Uniprogramming, Multiprocessing

Description : With ................ only one process can execute at a time; meanwhile all other process are waiting for the processer. With .............. more ... . A) Multiprocessing, Multiprogramming B) Multiprogramming, Uniprocessing C) Multiprogramming, Multiprocessing D) Uniprogramming, Multiprocessing

Last Answer : C) Multiprogramming, Multiprocessing

Which of the following conditions does not hold good for a solution to a critical section problem ? (A) No assumptions may be made about speeds or the number of CPUs. (B) No two processes may be simultaneously inside their critical sections. (C) Processes running outside its critical section may block other processes. (D) Processes do not wait forever to enter its critical section.

Description : Which of the following conditions does not hold good for a solution to a critical section problem ? (A) No assumptions may be made about speeds or the number of CPUs. (B) No two processes ... critical section may block other processes. (D) Processes do not wait forever to enter its critical section.

Last Answer : (C) Processes running outside its critical section may block other processes. 

Which of the following keys is used to move the cursor to the end of the paragraph. A. } B. { C. | D. $ E. None of the above

Description : Which of the following keys is used to move the cursor to the end of the paragraph. A. } B. { C. | D. $ E. None of the above

Last Answer : A. }

Which of the following keys is used to replace a single character with new text? A. S B. s C. r D. C E. None of the above

Description : Which of the following keys is used to replace a single character with new text? A. S B. s C. r D. C E. None of the above

Last Answer : B. s

The relational model is based on the concept that data is organized and stored in two-dimensional tables called ………………………A) Fields B) Records C) Relations D) Keys

Description : The relational model is based on the concept that data is organized and stored in two-dimensional tables called ………………………A) Fields B) Records C) Relations D) Keys

Last Answer : C) Relations

On the upper layer of SSL, a protocol for initial authentication and transfer of encryption keys, called the ………………… A) SSL handshake protocol B) SSL authentication protocol C) SSL record protocol D) SSL cipher protocol

Description : On the upper layer of SSL, a protocol for initial authentication and transfer of encryption keys, called the ………………… A) SSL handshake protocol B) SSL authentication protocol C) SSL record protocol D) SSL cipher protocol

Last Answer : A) SSL handshake protocol

What will be the output? d = {"john":40, "peter":45} print(list(d.keys())) a) [“john”, “peter”]. b) [“john”:40, “peter”:45]. c) (“john”, “peter”) d) (“john”:40, “peter”:45)

Description : What will be the output? d = {"john":40, "peter":45} print(list(d.keys())) a) [“john”, “peter”]. b) [“john”:40, “peter”:45]. c) (“john”, “peter”) d) (“john”:40, “peter”:45)

Last Answer : a) [“john”, “peter”].

Read the code shown below carefully and pick out the keys? d = {"john":40, "peter":45} a) “john”, 40, 45, and “peter” b) “john” and “peter” c) 40 and 45 d) d = (40:”john”, 45:”peter”)

Description : Read the code shown below carefully and pick out the keys? d = {"john":40, "peter":45} a) “john”, 40, 45, and “peter” b) “john” and “peter” c) 40 and 45 d) d = (40:”john”, 45:”peter”)

Last Answer : b) “john” and “peter”

Assuming there are n keys and each keys is in the range [0, m-1]. The run time of bucket sort is (A) O(n) (B) O(n lgn) (C) O(n lgm) (D) O(n+m)

Description : Assuming there are n keys and each keys is in the range [0, m-1]. The run time of bucket sort is (A) O(n) (B) O(n lgn) (C) O(n lgm) (D) O(n+m)

Last Answer : (D) O(n+m)

Find the false statement: (A) In Modern Cryptography, symmetric key algorithms use same key both for Encryption and Decryption. (B) The Symmetric cipher DES (Data Encryption Standard) was widely used in the industry for security product. (C) The AES (Advanced Encryption Standard) cryptosystem allows variable key lengths of size 56 bits and 124 bits. (D) Public key algorithms use two different keys for Encryption and Decryption.

Description : Find the false statement: (A) In Modern Cryptography, symmetric key algorithms use same key both for Encryption and Decryption. (B) The Symmetric cipher DES (Data Encryption Standard) was widely used ... and 124 bits. (D) Public key algorithms use two different keys for Encryption and Decryption.

Last Answer : (C) The AES (Advanced Encryption Standard) cryptosystem allows variable key lengths of size 56 bits and 124 bits.

For any B-tree of minimum degree t ≥2, every node other than the root must have atleast ............... keys and every node can have at most .............. keys. (A) t-1, 2t+1 (B) t+1, 2t+1 (C) t-1, 2t-1 (D) t+1, 2t-1

Description : For any B-tree of minimum degree t ≥2, every node other than the root must have atleast ............... keys and every node can have at most .............. keys. (A) t-1, 2t+1 (B) t+1, 2t+1 (C) t-1, 2t-1 (D) t+1, 2t-1

Last Answer : (C) t-1, 2t-1 

Based on the cardinality ratio and participation ............... associated with a relationship type, choose either the Foreign Key Design, the Cross Referencing Design or Mutual Referencing Design. (A) Entity (B) Constraints (C) Rules (D) Keys

Description : Based on the cardinality ratio and participation ............... associated with a relationship type, choose either the Foreign Key Design, the Cross Referencing Design or Mutual Referencing Design. (A) Entity (B) Constraints (C) Rules (D) Keys

Last Answer : (B) Constraints

If h is chosen from a universal collection of hash functions and is used to hash n keys into a table of size m, where n ≤ m, the expected number of collisions involving a particular key K is (A) less than 1 (B) less than lg n (C) greater than 1 (D) greater than lg n

Description : If h is chosen from a universal collection of hash functions and is used to hash n keys into a table of size m, where n ≤ m, the expected number of collisions involving a particular key K is (A) less than 1 (B) less than lg n (C) greater than 1 (D) greater than lg n

Last Answer : (A) less than 1

Fact-less fact table in a data warehouse contains (A) only measures (B) only dimensions (C) keys and measures (D) only surrogate keys

Description : Fact-less fact table in a data warehouse contains (A) only measures (B) only dimensions (C) keys and measures (D) only surrogate keys

Last Answer : (D) only surrogate keys

Which of the following statements is FALSE about weak entity set ? (A) Weak entities can be deleted automatically when their strong entity is deleted. (B) Weak entity set avoids the data duplication and consequent possible inconsistencies caused by duplicating the key of the strong entity. (C) A weak entity set has no primary keys unless attributes of the strong entity set on which it depends are included. (D) Tuples in a weak entity set are not partitioned according to their relationship with tuples in a strong entity set.

Description : Which of the following statements is FALSE about weak entity set ? (A) Weak entities can be deleted automatically when their strong entity is deleted. (B) Weak entity set avoids the data ... weak entity set are not partitioned according to their relationship with tuples in a strong entity set.

Last Answer : (D) Tuples in a weak entity set are not partitioned according to their relationship with tuples in a strong entity set.

The number of disk pages access in B-tree search, where h is height, n is the number of keys, and t is the minimum degree, is: (A) θ(logn h*t) (B) θ(logt n*h) (C) θ(logh n) (D) θ(logt n)

Description : The number of disk pages access in B-tree search, where h is height, n is the number of keys, and t is the minimum degree, is: (A) θ(logn h*t) (B) θ(logt n*h) (C) θ(logh n) (D) θ(logt n)

Last Answer : Answer: D

If there are N people in the world and are using secret key encryption/decryption for privacy purpose, then number of secret keys required will be: (A) N (B) (N-1) (C) N(N-1)/2 (D) N(N+1)/2

Description : If there are N people in the world and are using secret key encryption/decryption for privacy purpose, then number of secret keys required will be: (A) N (B) (N-1) (C) N(N-1)/2 (D) N(N+1)/2

Last Answer : (C) N(N-1)/2 

Consider the following database table having A, B, C and D as its four attributes and four possible candidate keys (I, II, III and IV) for this table: Image I: {B} II: {B, C} III: {A, D} IV: {C, D} If different symbols stand for different values in the table (e.g., d1 is definitely not equal to d2), then which of the above could not be the candidate key for the database table? (A) I and III only (B) III and IV only (C) II only (D) I only

Description : Consider the following database table having A, B, C and D as its four attributes and four possible candidate keys (I, II, III and IV) for this table: I: {B} II: {B, C} III: {A, D} IV: {C, D} If ... the database table? (A) I and III only (B) III and IV only (C) II only (D) I only

Last Answer : (C) II only

If h is chosen from a universal collection of hash functions and is used to hash n keys into a table of size m, where n≤m, the expected number of collisions involving a particular key x is less than ................... (1) 1 (2) 1/n (3) 1/m (4) n/m

Description : If h is chosen from a universal collection of hash functions and is used to hash n keys into a table of size m, where n≤m, the expected number of collisions involving a particular key x is less than ................... (1) 1 (2) 1/n (3) 1/m (4) n/m

Last Answer : Answer: 1

The following protocols and system are commonly used to provide various degrees of security services in computer network. i) IP filtering ii) Reverse Address Translation iii) IP security Architecture (IPsec) iv) Firewalls v) Socks A) i, ii, iii and iv only B) i, iii, iv and v only C) ii, iii, iv and v only D) All i, ii, iii, iv and v

Description : The following protocols and system are commonly used to provide various degrees of security services in computer network. i) IP filtering ii) Reverse Address Translation iii) IP security Architecture (IPsec) iv) Firewalls v) Socks ... only C) ii, iii, iv and v only D) All i, ii, iii, iv and v

Last Answer : B) i, iii, iv and v only

A segment is any object described by GKS commands and data that start with CREATE SEGMENT and Terminates with CLOSE SEGMENT command. What functions can be performed on these segments? (1) Translation and Rotation (2) Panning and Zooming (3) Scaling and Shearing (4) Translation, Rotation, Panning and Zooming

Description : A segment is any object described by GKS commands and data that start with CREATE SEGMENT and Terminates with CLOSE SEGMENT command. What functions can be performed on these segments? (1) Translation ... 2) Panning and Zooming (3) Scaling and Shearing (4) Translation, Rotation, Panning and Zooming

Last Answer : Translation, Rotation, Panning and Zooming

What is the fuel consumption rate for a jcb tlb?

Description : What is the fuel consumption rate for a jcb tlb?

Last Answer : Feel Free to Answer

There is a bomb on top of a computer. Around the computer there is a phone, a hairbrush, keys and a cup. When the explosion comes which item is destroyed first? -Riddles

Description : There is a bomb on top of a computer. Around the computer there is a phone, a hairbrush, keys and a cup. When the explosion comes which item is destroyed first? -Riddles

Last Answer : The bomb.

Hi, can anyone please identify this 'insect'? I've searched everywhere online and can't find anything that looks like it. I found it on my bed and it really does look odd.

Description : Hi, can anyone please identify this 'insect'? I've searched everywhere online and can't find anything that looks like it. I found it on my bed and it really does look odd.

Last Answer : answer:A link to a picture would be good. Right now it’s what we call a “no-see-um”.

Inserting an item into the stack when stack is not full is called …………. Operation and deletion of item form the stack, when stack is not empty is called ………..operation. A) push, pop B) pop, push

Description : Inserting an item into the stack when stack is not full is called …………. Operation and deletion of item form the stack, when stack is not empty is called ………..operation. A) push, pop B) pop, push

Last Answer : A) push, pop