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

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

1 Answer

Answer :

Answer: A
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

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.

Description : 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 ... keys. (D) an associative memory in which item to be searched is compared with all the keys simultaneously.

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

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

Which of the following is not a mechanism that DHCP supports for IP address allocation? A) Automatic allocation B) Static allocation C) Dynamic allocation D) Manual allocation

Description : Which of the following is not a mechanism that DHCP supports for IP address allocation? A) Automatic allocation B) Static allocation C) Dynamic allocation D) Manual allocation

Last Answer : B) Static allocation

Which of the following is not a mechanism that DHCP supports for IP address allocation? A) Automatic allocation B) Static allocation C) Dynamic allocation D) Manual allocation

Description : Which of the following is not a mechanism that DHCP supports for IP address allocation? A) Automatic allocation B) Static allocation C) Dynamic allocation D) Manual allocation

Last Answer : A) Automatic allocation

Which of the following information not included in memory table? A) The allocation of main memory to process. B) The allocation of secondary memory to process C) Any information needed to manage virtual memory D) Any information about the existence of file

Description : Which of the following information not included in memory table? A) The allocation of main memory to process. B) The allocation of secondary memory to process C) Any information needed to manage virtual memory D) Any information about the existence of file

Last Answer : D) Any information about the existence of file

Which of the following statements is not true about disk-arm scheduling algorithms ? (A) SSTF (shortest seek time first) algorithm increases performance of FCFS. (B) The number of requests for disk service are not influenced by file allocation method. (C) Caching the directories and index blocks in main memory can also help in reducing disk arm movements. (D) SCAN and C-SCAN algorithms are less likely to have a starvation problem.

Description : Which of the following statements is not true about disk-arm scheduling algorithms ? (A) SSTF (shortest seek time first) algorithm increases performance of FCFS. (B) The number of requests for disk ... arm movements. (D) SCAN and C-SCAN algorithms are less likely to have a starvation problem.

Last Answer : (B) The number of requests for disk service are not influenced by file allocation method.

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 

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 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

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

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

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

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

Last Answer : a. Datacache

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

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

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

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

Which of the following is not the function of Microkernel? A) File management B) Low-level memory management C) Inter-process communication D) I/O interrupts management

Description : Which of the following is not the function of Microkernel? A) File management B) Low-level memory management C) Inter-process communication D) I/O interrupts management

Last Answer : A) File management

C++ actually supports the following two complete dynamic allocation systems: (A) One defined by C++ and the other not defined by C. (B) One defined by C and one specific to C++. (C) Both are specific to C++ (D) Both of them are improvements of C.

Description : C++ actually supports the following two complete dynamic allocation systems: (A) One defined by C++ and the other not defined by C. (B) One defined by C and one specific to C++. (C) Both are specific to C++ (D) Both of them are improvements of C.

Last Answer : (B) One defined by C and one specific to C++. 

................. maintains the list of free disk blocks in the Unix file system. (A) I-node (B) Boot block (C) Super block (D) File allocation table

Description : ................. maintains the list of free disk blocks in the Unix file system. (A) I-node (B) Boot block (C) Super block (D) File allocation table

Last Answer : (C) Super block 

In ............ allocation method for disk block allocation in a file system, insertion and deletion of blocks in a file is easy. (A) Index (B) Linked (C) Contiguous (D) Bit Map

Description : In ............ allocation method for disk block allocation in a file system, insertion and deletion of blocks in a file is easy. (A) Index (B) Linked (C) Contiguous (D) Bit Map

Last Answer : (B) Linked

Suppose there are four processes in execution with 12 instances of a Resource R in a system. The maximum need of each process and current allocation are given below: Image With reference to current allocation, is system safe? If so, what is the safe sequence? (A) No (B) Yes, P1 P2 P3 P4 (C) Yes, P4 P3 P1 P2 (D) Yes, P2 P1 P3 P4

Description : Suppose there are four processes in execution with 12 instances of a Resource R in a system. The maximum need of each process and current allocation are given below: With reference to current allocation, is system safe? If so, ... B) Yes, P1 P2 P3 P4 (C) Yes, P4 P3 P1 P2 (D) Yes, P2 P1 P3 P4

Last Answer : (C) Yes, P4 P3 P1 P2

In 3G network, W-CDMA is also known as UMTS. The minimum spectrum allocation required for W-CDMA is .......... (1) 2 MHz (2) 20 KHz (3) 5 KHz (4) 5 MHz

Description : In 3G network, W-CDMA is also known as UMTS. The minimum spectrum allocation required for W-CDMA is .......... (1) 2 MHz (2) 20 KHz (3) 5 KHz (4) 5 MHz

Last Answer : Answer: 4

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

Which unit acts as the brain of the computer which control other peripherals and interfaces: a. Memory unit b. Cache unit c. Timing and control unit d. None of these

Description : Which unit acts as the brain of the computer which control other peripherals and interfaces: a. Memory unit b. Cache unit c. Timing and control unit d. None of these

Last Answer : c. Timing and control unit

.................. 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

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

The advantage of ............... is that it can reference memory without paying the price of having a full memory address in the instruction. (A) Direct addressing (B) Indexed addressing (C) Register addressing (D) Register Indirect addressing

Description : The advantage of ............... is that it can reference memory without paying the price of having a full memory address in the instruction. (A) Direct addressing (B) Indexed addressing (C) Register addressing (D) Register Indirect addressing

Last Answer : (D) Register Indirect addressing

Consider an array A[20, 10], assume 4 words per memory cell and the base address of array A is 100. What is the address of A[11, 5] ? Assume row major storage. (A) 560 (B) 565 (C) 570 (D) 575

Description : Consider an array A[20, 10], assume 4 words per memory cell and the base address of array A is 100. What is the address of A[11, 5] ? Assume row major storage. (A) 560 (B) 565 (C) 570 (D) 575

Last Answer : (A) 560

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

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

function select takes op code in IR translating to function of ALU and it may be compact binary code or one line per ALU: a ALU b CPU c. Memory d. Cache

Description : function select takes op code in IR translating to function of ALU and it may be compact binary code or one line per ALU: a ALU b CPU c. Memory d. Cache

Last Answer : a ALU

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

The ……………. Determines when a page should be brought into main memory. A) Fetch policy B) Placement policy C) Replacement policy D) Resident set management

Description : The ……………. Determines when a page should be brought into main memory. A) Fetch policy B) Placement policy C) Replacement policy D) Resident set management

Last Answer : A) Fetch policy

………. Involves treating main memory as a resource to be allocated to and shared among a number of active processes. A) Partition management B) Memory management C) Disk management D) All of the above

Description : ………. Involves treating main memory as a resource to be allocated to and shared among a number of active processes. A) Partition management B) Memory management C) Disk management D) All of the above

Last Answer : B) Memory management

State true of false. i) With paging, each process is divided into relatively small, fixed-size pages. ii) Segmentation provides for the use of pieces of varying size. A) Partition management B) Memory management C) Disk management D) All of the above

Description : State true of false. i) With paging, each process is divided into relatively small, fixed-size pages. ii) Segmentation provides for the use of pieces of varying size. A) Partition management B) Memory management C) Disk management D) All of the above

Last Answer : B) Memory management

........... is a large kernel, including scheduling file system, networking, device drivers, memory management and more. A) Monolithic kernel B) Micro kernel C) Macro kernel D) Mini kernel

Description : ........... is a large kernel, including scheduling file system, networking, device drivers, memory management and more. A) Monolithic kernel B) Micro kernel C) Macro kernel D) Mini kernel

Last Answer : A) Monolithic kernel

........... is a large kernel containing virtually the complete operating system, including, scheduling, file system, device drivers and memory management. A) Multilithic kernel B) Monolithic kernel C) Micro kernel D) Macro kernel

Description : ........... is a large kernel containing virtually the complete operating system, including, scheduling, file system, device drivers and memory management. A) Multilithic kernel B) Monolithic kernel C) Micro kernel D) Macro kernel

Last Answer : B) Monolithic kernel

Working set model is used in memory management to implement the concept of (A) Swapping (B) Principal of Locality (C) Segmentation (D) Thrashing

Description : Working set model is used in memory management to implement the concept of (A) Swapping (B) Principal of Locality (C) Segmentation (D) Thrashing

Last Answer : (B) Principal of Locality

A virtual memory based memory management algorithm partially swaps out a process. This is an example of (A) short term scheduling (B) long term scheduling (C) medium term scheduling (D) mutual exclusion

Description : A virtual memory based memory management algorithm partially swaps out a process. This is an example of (A) short term scheduling (B) long term scheduling (C) medium term scheduling (D) mutual exclusion

Last Answer : (C) medium term scheduling

A part of Windows 2000 operating system that is not portable is (A) Device Management (B) Virtual Memory Management (C) Processor Management (D) User Interface

Description : A part of Windows 2000 operating system that is not portable is (A) Device Management (B) Virtual Memory Management (C) Processor Management (D) User Interface

Last Answer : (B) Virtual Memory Management

Which of the following condition is true for an object used as a function argument. i) A copy of the entire objects is passed to the function. ii) Only the address of the object is transferred to the function. A) Only i B) Only ii C) Both i and ii D) None of them

Description : Which of the following condition is true for an object used as a function argument. i) A copy of the entire objects is passed to the function. ii) Only the address of the object is transferred to the function. A) Only i B) Only ii C) Both i and ii D) None of them

Last Answer : C) Both i and ii

Find out the components of DHCP: 1) A protocol that delivers host-specific configuration parameters from a server to a host. 2) The client determines its own hardware address; this is normally in a ROM on the hardware. 3) A mechanism for the allocation of temporary or permanent network addresses to hosts. A. 1,2 B. 1,3 C. 2,3 D. 1,2,3

Description : Find out the components of DHCP: 1) A protocol that delivers host-specific configuration parameters from a server to a host. 2) The client determines its own hardware address; this is normally in a ROM on the hardware. 3) ... or permanent network addresses to hosts. A. 1,2 B. 1,3 C. 2,3 D. 1,2,3

Last Answer : B. 1,3

Which of the following is not a mechanism that DHCP supports for IP address allocation? A) Automatic allocation B) Static allocation C) Dynamic allocation D) Manual allocation

Description : Which of the following is not a mechanism that DHCP supports for IP address allocation? A) Automatic allocation B) Static allocation C) Dynamic allocation D) Manual allocation

Last Answer : B) Static allocation

Which of the following is not a mechanism that DHCP supports for IP address allocation? A) Automatic allocation B) Static allocation C) Dynamic allocation D) Manual allocation

Description : Which of the following is not a mechanism that DHCP supports for IP address allocation? A) Automatic allocation B) Static allocation C) Dynamic allocation D) Manual allocation

Last Answer : B) Static allocation

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?

Description : 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?

Last 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.

File management function of the operating system includes i) File creation and deletion ii) Disk scheduling iii) Directory creation iv) Mapping file in secondary storage. A) i, ii and iii only B) i, iii and iv only C) ii, iii and iv only D) All i, ii, iii and iv

Description : File management function of the operating system includes i) File creation and deletion ii) Disk scheduling iii) Directory creation iv) Mapping file in secondary storage. A) i, ii and iii only B) i, iii and iv only C) ii, iii and iv only D) All i, ii, iii and iv

Last Answer : B) i, iii and iv only

Process Management function of an operating system kernel includes. A) Process creation and termination. B) Process scheduling and dispatching C) Process switching D) All of the above

Description : Process Management function of an operating system kernel includes. A) Process creation and termination. B) Process scheduling and dispatching C) Process switching D) All of the above

Last Answer : D) All of the above

Why do i get a memory allocation error in Joomla 1.5?

Description : Why do i get a memory allocation error in Joomla 1.5?

Last Answer : answer:The error is generated by PHP, so the variables would be there instead. Here's an article for Drupal specifically From that: ------------- That indicates that Drupal needed more memory than PHP was ... root ------------- On your own box, for development, probably go with the top option.

Compare the memory organization schemes of contiguous memory allocation, pure segmentation, and pure paging with respect to the following issues External fragmentation?

Description : Compare the memory organization schemes of contiguous memory allocation, pure segmentation, and pure paging with respect to the following issues External fragmentation?

Last Answer : 1. Compare the memory organization schemes of contiguous memory allocation, pure segmentation, and pure paging with respect to the following issues: a. External fragmentationb. Internal fragmentation

What does DMA stand for? A) Distinct Memory Access B) Direct Memory Access C) Direct Module Access D) Direct Memory Allocation

Description : What does DMA stand for? A) Distinct Memory Access B) Direct Memory Access C) Direct Module Access D) Direct Memory Allocation

Last Answer : Answer : B

DMA stands for ________ 1) Direct Memory Access 2) Distinct Memory Access 3) Direct Module Access 4) Direct Memory Allocation

Description : DMA stands for ________ 1) Direct Memory Access 2) Distinct Memory Access 3) Direct Module Access 4) Direct Memory Allocation

Last Answer : 1) Direct Memory Access