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

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 
by

1 Answer

Answer :

(C) It is a chip to map virtual address to physical address
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.

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

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.

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

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

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

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)

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

Which of the following algorithm design technique is used in the quick sort algorithm? a) Dynamic programming b) Backtracking c) Divide-and-conquer d) Greedy method

Description : Which of the following algorithm design technique is used in the quick sort algorithm? a) Dynamic programming b) Backtracking c) Divide-and-conquer d) Greedy method

Last Answer : Which of the following algorithm design technique is used in the quick sort algorithm? a) Dynamic programming b) Backtracking c) Divide-and-conquer d) Greedy method

In ............. generation of operating system, operating system designers develop the concept of multiprogramming in which several jobs are in main memory at once. A) First B) Second C) Third D) Fourth

Description : In ............. generation of operating system, operating system designers develop the concept of multiprogramming in which several jobs are in main memory at once. A) First B) Second C) Third D) Fourth

Last Answer : C) Third

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

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

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

A process that execute only in main memory is referred to as ……………… and that allocated in disk is referred to a ……………. A) virtual memory, true memory B) virtual memory, real memory C) real memory, virtual memory D) imaginary memory, real memory

Description : A process that execute only in main memory is referred to as ……………… and that allocated in disk is referred to a ……………. A) virtual memory, true memory B) virtual memory, real memory C) real memory, virtual memory D) imaginary memory, real memory

Last Answer : C) real memory, virtual memory

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

The travelling salesman problem can be solved in: (A) Polynomial time using dynamic programming algorithm (B) Polynomial time using branch-and-bound algorithm (C) Exponential time using dynamic programming algorithm or branch-andbound algorithm. (D) Polynomial time using backtracking algorithm.

Description : The travelling salesman problem can be solved in: (A) Polynomial time using dynamic programming algorithm (B) Polynomial time using branch-and-bound algorithm (C) Exponential time using dynamic programming algorithm or branch-andbound algorithm. (D) Polynomial time using backtracking algorithm.

Last Answer : (C) Exponential time using dynamic programming algorithm or branch-andbound algorithm.

Dijkstra’s algorithm is based on (1) Divide and conquer paradigm (2) Dynamic Programming (3) Greedy Approach (4) Backtracking paradigm

Description : Dijkstra’s algorithm is based on (1) Divide and conquer paradigm (2) Dynamic Programming (3) Greedy Approach (4) Backtracking paradigm

Last Answer : 3

Distance vector routing algorithm is a dynamic routing algorithm. The routing tables in distance vector routing algorithm are updated ........... (1) automatically (2) by server (3) by exchanging information with neighbour nodes. (4) with back up database

Description : Distance vector routing algorithm is a dynamic routing algorithm. The routing tables in distance vector routing algorithm are updated ........... (1) automatically (2) by server (3) by exchanging information with neighbour nodes. (4) with back up database

Last Answer : Answer: 3

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.

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

Java servlets are an efficient and powerful solution for creating ………….. for the web. A) Dynamic content B) Static content C) Hardware D) Both a and b

Description : Java servlets are an efficient and powerful solution for creating ………….. for the web. A) Dynamic content B) Static content C) Hardware D) Both a and b

Last Answer : A) Dynamic content

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

What is the output of the following program ? (Assume that the appropriate pre-processor directives are included and there is no syntax error) main() { char S[ ] = "ABCDEFGH"; printf ("%C",* (& S[3])); printf ("%s", S+4); printf ("%u", S); /* Base address of S is 1000 */ } (A) ABCDEFGH1000 (B) CDEFGH1000 (C) DDEFGHH1000 (D) DEFGH1000

Description : What is the output of the following program ? (Assume that the appropriate pre-processor directives are included and there is no syntax error) main() { char S[ ] = "ABCDEFGH"; printf ("%C",* (& ... Base address of S is 1000 */ } (A) ABCDEFGH1000 (B) CDEFGH1000 (C) DDEFGHH1000 (D) DEFGH1000

Last Answer : (D) DEFGH1000

The two central themes of modern operating system are ............... A) Multiprogramming and Distributed processing B) Multiprogramming and Central Processing C) Single Programming and Distributed processing D) None of above

Description : The two central themes of modern operating system are ............... A) Multiprogramming and Distributed processing B) Multiprogramming and Central Processing C) Single Programming and Distributed processing D) None of above

Last Answer : A) Multiprogramming and Distributed processing

A thread is usually defined as a light weight process because an Operating System (OS) maintains smaller data structure for a thread than for a process. In relation to this, which of the following statement is correct? (A) OS maintains only scheduling and accounting information for each thread. (B) OS maintains only CPU registers for each thread. (C) OS does not maintain a separate stack for each thread. (D) OS does not maintain virtual memory state for each thread.

Description : A thread is usually defined as a light weight process because an Operating System (OS) maintains smaller data structure for a thread than for a process. In relation to this, which of the following ... separate stack for each thread. (D) OS does not maintain virtual memory state for each thread.

Last Answer : (B) OS maintains only CPU registers for each thread.

Which of the following is incorrect for virtual memory? (1) Large programs can be written (2) More I/O is required (3) More addressable memory available (4) Faster and easy swapping of process

Description : Which of the following is incorrect for virtual memory? (1) Large programs can be written (2) More I/O is required (3) More addressable memory available (4) Faster and easy swapping of process

Last Answer : Answer: 2

Rearranging and allocating space in memory to provide for multiple computing tasks is called (1) Networking (2) Multiprogramming (3) Multitasking (4) Memory Management

Description : Rearranging and allocating space in memory to provide for multiple computing tasks is called (1) Networking (2) Multiprogramming (3) Multitasking (4) Memory Management

Last Answer : Memory Management

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

The map colouring problem can be solved using which of the following technique? (A) Means-end analysis (B) Constraint satisfaction (C) AO* search (D) Breadth first search

Description : The map colouring problem can be solved using which of the following technique? (A) Means-end analysis (B) Constraint satisfaction (C) AO* search (D) Breadth first search

Last Answer : (B) Constraint satisfaction

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

The most important and common protocols associated TCP/IP internetwork layer are. i) Internet protocol(IP) ii) Internet control Message Protocol(ICMP) iii) Bootstrap Protocol (BooTP) iv) Dynamic Host Configuration Protocol (DHCP) v) Address Resolution Protocol (ARP) 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 most important and common protocols associated TCP/IP internetwork layer are. i) Internet protocol(IP) ii) Internet control Message Protocol(ICMP) iii) Bootstrap Protocol (BooTP) iv) Dynamic Host Configuration Protocol (DHCP) v) ... C) ii, iii, iv and v only D) All i, ii, iii, iv and v

Last Answer : D) All i, ii, iii, iv and v

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

The most important and common protocols associated TCP/IP internetwork layer are. i) Internet Protocol (IP) ii) Internet Control Message Protocol (ICMP) iii) Bootstrap Protocol (BOOTP) iv) Dynamic Host Configuration Protocol (DHCP) V) Address Resolution Protocol (ARP) A) i, ii, iii, and iv only B) ii, iii, iv and v only C) i, iii, iv and v only D) All i, ii, iii, iv and v only

Description : The most important and common protocols associated TCP/IP internetwork layer are. i) Internet Protocol (IP) ii) Internet Control Message Protocol (ICMP) iii) Bootstrap Protocol (BOOTP) iv) Dynamic Host Configuration Protocol (DHCP) V) ... C) i, iii, iv and v only D) All i, ii, iii, iv and v only

Last Answer : D) All i, ii, iii, iv and v only

Which of the following routing technique / techniques is / are used in distributed systems ? A. Fixed Routing B. Virtual Routing C. Dynamic Routing a. A Only b. A and B only c. C only d. All A,B,C

Description : Which of the following routing technique / techniques is / are used in distributed systems ? A. Fixed Routing B. Virtual Routing C. Dynamic Routing a. A Only b. A and B only c. C only d. All A,B,C

Last Answer : a. A Only

Which of the following is not a congestion policy at network layer? (A) Flow Control Policy (B) Packet Discard Policy (C) Packet Lifetime Management Policy (D) Routing Algorithm

Description : Which of the following is not a congestion policy at network layer? (A) Flow Control Policy (B) Packet Discard Policy (C) Packet Lifetime Management Policy (D) Routing Algorithm

Last Answer : (A) Flow Control Policy

Which statement is wrong according to linear decoding : a. Address map is not contiguous. b. Confects occur if two of the select lines become active at the same time c. If all unused address lines are not used as chip selectors then these unused lines become don’t cares d. None of these

Description : Which statement is wrong according to linear decoding : a. Address map is not contiguous. b. Confects occur if two of the select lines become active at the same time c. If all unused address lines are not used as chip selectors then these unused lines become don’t cares d. None of these

Last Answer : d. None of these

Which of the following characteristics of constructor are true. i) They should be declared in the public section. ii) They are invoked automatically when the objects are created. iii) They do not have return type and void also. iv) We cannot refer their address. v) Constructors cannot virtual. A) Only i, ii, iii and v B) Only ii, iii, iv, and v C) Only i, iii, iv and v D) All i, ii, iii, iv and v

Description : Which of the following characteristics of constructor are true. i) They should be declared in the public section. ii) They are invoked automatically when the objects are created. iii) They do not have return type and void also. ... and v C) Only i, iii, iv and v D) All i, ii, iii, iv and v

Last Answer : D) All i, ii, iii, iv and v

A dynamic RAM has refresh cycle of 32 times per msec. Each refresh operation requires 100 nsec and a memory cycle requires 250 nsec. What percentage of memory’s total operating time is required for refreshes? (A) 0.64 (B) 0.96 (C) 2.00 (D) 0.32

Description : A dynamic RAM has refresh cycle of 32 times per msec. Each refresh operation requires 100 nsec and a memory cycle requires 250 nsec. What percentage of memory’s total operating time is required for refreshes? (A) 0.64 (B) 0.96 (C) 2.00 (D) 0.32

Last Answer : Answer: D Explanation: in 1ms : refresh = 32 times Memory cycle = 1ms/250ns = 106ns/250ns = 4000 times Therefore, % of refresh time = (32 x 100ns)/(4000 x 250ns) = 3200ns/1000000 x 100% = 0.32%

Which of the following is not typically a benefit of dynamic linking? I. Reduction in overall program execution time. II. Reduction in overall space consumption in memory. III. Reduction in overall space consumption on disk. IV. Reduction in the cost of software updates. (A) I and IV (B) I only (C) II and III (D) IV only

Description : Which of the following is not typically a benefit of dynamic linking? I. Reduction in overall program execution time. II. Reduction in overall space consumption in memory. III. Reduction in overall space consumption on disk. IV. ... updates. (A) I and IV (B) I only (C) II and III (D) IV only

Last Answer : (B) I only 

A Responsibility Assignment Matrix (RAM) can be used to: a. define the terms of reference of the project manager. b. define the limits of the project sponsor’s responsibilities. c. allocate risk management response activities to project personnel. d. allocate work packages to those responsible for project work.

Description : A Responsibility Assignment Matrix (RAM) can be used to: a. define the terms of reference of the project manager. b. define the limits of the project sponsor's responsibilities. c ... response activities to project personnel. d. allocate work packages to those responsible for project work.

Last Answer : d. allocate work packages to those responsible for project work.

A Responsibility Assignment Matrix (RAM) can be used to: a. define the terms of reference of the project manager. b. define the limits of the project sponsor’s responsibilities. c. allocate risk management response activities to project personnel. d. allocate work packages to those responsible for project work.

Description : A Responsibility Assignment Matrix (RAM) can be used to:  a. define the terms of reference of the project manager.  b. define the limits of the project sponsor's responsibilities.  ... response activities to project personnel.  d. allocate work packages to those responsible for project work.

Last Answer : d. allocate work packages to those responsible for project work.

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

..................... provides a larger sized of virtual memory but require virtual memory which provides multidimensional memory. A) Paging method B) Segmentation method C) Paging and segmentation method D) None of these

Description : ..................... provides a larger sized of virtual memory but require virtual memory which provides multidimensional memory. A) Paging method B) Segmentation method C) Paging and segmentation method D) None of these

Last Answer : B) Segmentation method

The advantage of memory mapped I/O over I/O mapped I/O is, a) Faster b) Many instructions supporting memory mapped I/O c) Require a bigger address decoder d) All the above

Description : The advantage of memory mapped I/O over I/O mapped I/O is, a) Faster b) Many instructions supporting memory mapped I/O c) Require a bigger address decoder d) All the above

Last Answer : d) All the above

How much space will be required to store the bit map of a 1.3 GB disk with 512 bytes block size ? (A) 332.8 KB (B) 83.6 KB (C) 266.2 KB (D) 256.6 KB

Description : How much space will be required to store the bit map of a 1.3 GB disk with 512 bytes block size ? (A) 332.8 KB (B) 83.6 KB (C) 266.2 KB (D) 256.6 KB

Last Answer : (A) 332.8 KB

Consider f(N) = g(N) + h(N) Where function g is a measure of the cost of getting from the start node to the current node N and h is an estimate of additional cost of getting from the current node N to the goal node. Then f(N) = h(N) is used in which one of the following algorithms ? (A) A* algorithm (B) AO* algorithm (C) Greedy best first search algorithm (D) Iterative A* algorithm

Description : Consider f(N) = g(N) + h(N) Where function g is a measure of the cost of getting from the start node to the current node N and h is an estimate of additional cost of getting from the current ... ? (A) A* algorithm (B) AO* algorithm (C) Greedy best first search algorithm (D) Iterative A* algorithm

Last Answer : (C) Greedy best first search algorithm

The different types of tables maintained by the operating system are ............. A) memory, logical , I/O file B) memory, I/O, file, physical C) memory, I/O, file, process D) memory, logical, I/O, physical

Description : The different types of tables maintained by the operating system are ............. A) memory, logical , I/O file B) memory, I/O, file, physical C) memory, I/O, file, process D) memory, logical, I/O, physical

Last Answer : C) memory, I/O, file, process