Q No. 3: (a) How MMU is used to address the physical and logical cache arrangement Explain the difference between Least recently used and least frequently used replacement algorithm?

1 Answer

Answer :

Q No. 3: (a) How MMU is used to address the physical and logical cache arrangement? Explain the difference between Least recently used and least frequently used replacement algorithm.

Related questions

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

Description : Suppose that the virtual Address space has eight pages and physical memory with four page frames. If LRU page replacement algorithm is used, .............. number of page faults occur with the reference string. 0 2 1 3 5 4 6 3 7 4 7 3 3 5 5 3 1 1 1 7 2 3 4 1 (A) 11 (B) 12 (C) 10 (D) 9

Last Answer : (A) 11

Description : State weather the following statement is true or false for Token Bus 1).It is a linear or tree- shaped cable onto which the stations are attached. 2). the token propagates around the logical ring, with only the token holder ... 3. false C. 1. false, 2. false, 3. false D. 1. true, 2. true, 3. false

Last Answer : D. 1. true, 2. true, 3. false

Description : Physical or logical arrangement of network is __________ a) Topology b) Routing c) Networking d) Control

Last Answer : a) Topology

Description : Which of the following characters is correct regarding network topologies: a) Network Topologies describe the ways in which the elements of a network are mapped. b) Network Topologies describe the physical and logical arrangement of the network nodes. c) Both of Above d) None of These

Last Answer : c) Both of Above

Description : MMU stands for: a) Motherboard Memory Unit b) Memory Management Unit c) Main Memory Unit d) None of These

Last Answer : c) Main Memory Unit

Description : Micro-orders generate the_ __ address of operand and execute instruction and prepare for fetching next instruction from the main memory: a. Physical b. Effective c. Logical d. all of above

Last Answer : b. Effective

Description : The sender is a router thathas receiveda datagram destinedfor a host on thesame network. The logical address that mustbe mapped to a physical address is ______. A) thedestination IP address in the datagram ... IP address of therouter found inthe routing table C) either a or b D) noneof the above

Last Answer : thedestination IP address in the datagram header

Description : If the sender is a host and wants tosend a packet toanotherhost on another network, the logical address that must be mapped to a physical address is ______. A) thedestination IP address in the datagram ... the IP address of therouter found inthe routing table C) either a or b D) noneof the above

Last Answer : the IP address of therouter found inthe routing table

Description : f the sender is a host and wants tosend a packet toanotherhost on the samenetwork, the logical address that must be mapped to a physical address is ______. A) thedestination IP address in the datagram ... the IP address of therouter found inthe routing table C) either a or b D) noneof the above

Last Answer : hedestination IP address in the datagram header

Description : A ________is a local address. Its jurisdiction is overa local network. A) physical B) logical C) a and b D) noneof the above

Last Answer : physical

Description : _______address is an internetwork address withuniversal jurisdiction. A) physical B) logical C) a and b D) noneof the above

Last Answer : logical

Description : The _______ is a dynamic mapping protocol in which a physical address is found for a given logical address. A. ARP B. RARP C. both a and b D. none of the above

Last Answer : B. RARP

Description : Which address is used to identify a process on a host by the transport layer? a) physical address b) logical address c) port address d) specific address

Last Answer : c) port address

Description : Point out the wrong statement. a) Load balancing virtualizes systems and resources by mapping a logical address to a physical address b) Multiple instances of various Google applications are running on different hosts c) Google uses hardware virtualization d) All of the mentioned

Last Answer : Google uses hardware virtualization

Description : Point out the wrong statement. a) Load balancing virtualizes systems and resources by mapping a logical address to a physical address b) Multiple instances of various Google applications are running on different hosts c) Google uses hardware virtualization d) All of the mentioned

Last Answer : Google uses hardware virtualization

Description : ____ is a dynamic mapping protocol in which a physical address is found for a given logical address

Last Answer : ARP

Description : A memory management system has 64 pages with 512 bytes page size. Physical memory consists of 32 page frames. Number of bits required in logical and physical address are respectively: (1) 14 and 15 (2) 14 and 29 (3) 15 and 14 (4) 16 and 32

Last Answer : (3) 15 and 14

Description : The most frequently used instructions of a computer program are likely to be fetched from ______ (A) Hard disk (B) ROM (C) RAM (D) Cache

Last Answer : (D) Cache

Description : Explain LRU page replacement algorithm for following reference string. 7 0 1 2 0 3 0 4 2 3 0 3 2 1 2 0 1 7 0 1 Calculate the page fault.

Last Answer : LRU: The Least Recently Used (LRU) page replacement policy replaces the page that has not been used for the longest period of time. LRU replacement associates with each page the time of that page's last use. ... in question so assume frame size as 3 or 4) LRU: Assume frame size=3

Description : A _____ contains specific rules and words that express the logical steps of an algorithm. 1) Syntax 2) Programming structure 3) Programming language 4) Logic chart 5) None of these

Last Answer : Answer :3

Description : What will backward chaining algorithm will return? a) Additional statements b) Substitutes matching the query c) Logical statement d) All of the mentioned

Last Answer : b) Substitutes matching the query

Description : Which are needed to compute the logical inference algorithm? a) Logical equivalence b) Validity c) Satisfiability d) All of the mentioned

Last Answer : d) All of the mentioned

Description : A mistake in an algorithm that causes incorrect results is called: a) Logical Error b) Syntax Error c) Procedural Error d) None of These

Last Answer : a) Logical Error

Description : A ______ contains specific rules and words t hat express the logical steps of an algorithm a) Programming language b) Syntax error c) Programming structure d) Logic chart e) None of these

Last Answer : a) Programming language

Description : A mistake in an algorithm that causes incorrect results is called a a) logical error b) syntax error c) procedural error d) compiler error e) None of these

Last Answer : b) syntax error

Description : A ...... contains specific rules and words that express the logical steps of an algorithm. 1) Programming Language 2) Programming Structure 3) Syntax 4) Logic chart

Last Answer : 3) Syntax

Description : .Which one is used for compute the logical inference algorithm? a. Validity b.Satisfiability c. Logical equivalence d.All of these

Last Answer : d.All of these

Description : In a logic circuit, the NOT gate function _____________. A. does not alter a logical input B. serves to amplify a given signal level C. must be accomplished with a common collector transistor arrangement D. reverses an input logic condition

Last Answer : Answer: D

Description : Which problem can frequently occur in backward chaining algorithm? a) Repeated states b) Incompleteness c) Complexity d) Both Repeated states & Incompleteness

Last Answer : d) Both Repeated states & Incompleteness

Description : Consider the reference string 0 1 2 3 0 1 4 0 1 2 3 4 If FIFO page replacement algorithm is used, then the number of page faults with three page frames and four page frames are .......... and ........... respectively. (A) 10, 9 (B) 9, 9 (C) 10, 10 (D) 9, 10

Last Answer : (D) 9, 10

Description : Joan recently changed employers within the same industry. At her old company, employees routinely took home company pens, pencils, and note pads, and they frequently made personal long -distance ... A)significant others. B)profit objectives. C)corporate culture. D)legal climate. E)corporate goals

Last Answer : D)legal climate

Description : Copy of data in cache memory is called. a. Datacache b. Execution cache c. Address cache d. Control cache

Last Answer : a. Datacache

Description : In cache memory hit rate indicates. a. Data from requested address is not available b. Data from requested address is available c. Control from requested address is available d. Address from requested address is not available

Last Answer : b. Data from requested address is available

Description : In cache memory miss rate indicates. a. Availability of requested data b. Availability of requested address c. Non-Availability of requested data d. Non-Availability of requested address

Last Answer : c. Non-Availability of requested data

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

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

Description : For this topic sentence, what is the best, most logical order for the following supporting sentencesTopic sentence: My friend Susan McCarthy, coauthor of When Elephants Weep, recently reminded me that reading bout eating can occasionally send one......?

Last Answer : III, I, II

Description : In RSA algorithm,if p=5,q=7,e=7and message=3. What will be the value of ciphertext ?

Last Answer : 17

Description : Using data p=3, q=11, n=pq, d=7 in RSA algorithm find the cipher text of the given plain text SUZANNE (A) BUTAEEZ (B) SUZANNE (C) XYZABCD (D) ABCDXYZ

Last Answer : (A) BUTAEEZ

Description : Using p=3, q=13, d=7 and e=3 in the RSA algorithm, what is the value of ciphertext for a plain text 5? (A) 13 (B) 21 (C) 26 (D) 33

Last Answer : Answer: Marks to all Explanation: p=3, q=13, d=7, e=3, M=5, C=? C = Me mod n n = p*q  = 3*13 = 39 C = 53 mod 39 = 8 Answer is 8.

Description : To display the page no. for each page on a report what would be the source & logical page no. or & of physical page no.?

Last Answer : & physical page no.

Description : A ……………… system in no more than idea. A) Conceptual B) Logical C) Physical D) None

Last Answer : A) Conceptual

Description : A …………. System is no more than idea A) Conceptual B) Logical C) Physical D) All of the above

Last Answer : A) Conceptual

Description : Eight persons P, Q, R, S, W, X, Y and Z in which 4 females are facing towards and 4 males facing away from the center. Males and females are seated alternately. I. X is male, W position is 3rd to the right of X and exactly opposite to Q. ... a) S, Q, R, W b) P, Q, Y, W c) P, Q, R, W d) P, Q, R, S

Last Answer : b) P, Q, Y, W

Description : The ____ namespace is based on a hierarchical and logical tree structure A. DNS B. Address C. table D. both a and b

Last Answer : A. DNS

Description : .................. is a facility that allows programmers to address memory from a logical point of view, without regard to the main memory, physically available. A) Visual memory B) Real memory C) Virtual memory D) Secondary memory

Last Answer : C) Virtual memory

Description : Which of the following sorting algorithm has the running time that is least dependant on the initial ordering of the input? a) Insertion sort b) Quick sort c) Merge sort d) Selection sort

Last Answer : d) Selection sort

Description : Which of the following algorithm pays the least attention to the ordering of the elements in the input list? a) Insertion sort b) Selection sort c) Quick sort d) None

Last Answer : b) Selection sort