Question # 1 of 10 ( Start time: 07:24:13 AM ) Total Marks: 1 LRU page replacement algorithm can be implemented by counter stack linked list all of the given options Question # 2 of 10 ( Start time: 07:25:28 AM ) Total Marks: 1 The segment table maps the to physical addresses. Page addresses Shared page addresses One-dimensional logical addresses Two-dimensional logical addresses Question # 3 of 10 ( Start time: 07:26:28 AM ) Total Marks: 1 Assume a logical address space of 16 pages, each of 1024 words, each mapped into a physical memory of 32 frames. Each word consists of 2 bytes. What will be the total number of bits required for f (frames)? 5 6 7 8 Question # 4 of 10 ( Start time: 07:27:55 AM ) Total Marks: 1 In scheme free frames are equally divided among processes. Fixed Allocation Proportional Allocation Priority Allocation None of the given options Question # 5 of 10 (Start time: 07:28:37 AM) Total Marks: 1 Following schemes allow efficient implementations of page tables EXCEPT Hashed Page Table Hierarchical / Multilevel Inverted Page Table Binary Page Table
Question # 6 of 10 ( Start time: 07:29:25 AM ) Total Marks: 1 FIFO Page Replacement Algorithm has the lowest page fault rate True False Question # 7 of 10 ( Start time: 07:30:04 AM ) Total Marks: 1 The major criterion in the selection of a particular algorithm is that we want to minimize the number of page faults. increase efficiency. reduce running time of page replacement algorithm. maximize the number of page faults. Question # 8 of 10 ( Start time: 07:30:50 AM ) Total Marks: 1 In allocation scheme number of frames allocated to a process is proportional to its size. Fixed Allocation Proportional Allocation Priority Allocation None of the given options Question # 9 of 10 ( Start time: 07:31:21 AM ) Total Marks: 1 It is not possible to run a program whose size is greater than the size of the main memory. True False Question # 10 of 10 ( Start time: 07:31:37 AM ) Total Marks: 1 The address generated by the CPU, after any indexing or other addressing-mode arithmetic, is called a --------address, and the address it gets translated to by the MMU is called a --------- address. Virtual, physical Hexadecimal, Binary Valid, invalid Physical, Virtual Question # 1 of 10 ( Start time: 10:02:11 PM ) Total Marks: 1 Memory protection in paging is achieved by associating with each page. This bit indicates whether the page is in the process address space or not. protection bits counting bits paging table segment table
Question # 2 of 10 ( Start time: 10:02:53 PM ) Total Marks: 1 The main objective of LRU Page Replacement Algorithm is to replace that page which is referenced most frequently replace the page which is replaced most recently replace the page which is used urgently replace that page which was used most previously Question # 3 of 10 ( Start time: 10:03:42 PM ) Total Marks: 1 The high paging activity is called Page Fault Multiprogramming Thrashing Question # 4 of 10 ( Start time: 10:04:26 PM ) Total Marks: 1 For some page replacement algorithms, the page fault rate may increase as the number of allocated frames. constant decreased increased All of the given Question # 5 of 10 ( Start time: 10:05:08 PM ) Total Marks: 1 is the separation of user logical memory from physical memory. ROM Physical memory Virtual Memory None of the given options Question # 6 of 10 ( Start time: 10:05:58 PM ) Total Marks: 1 ---------------keep in memory only those instructions and data that are needed at any given time. Fragmentation Swapping Overlays
Question # 7 of 10 ( Start time: 10:06:23 PM ) Total Marks: 1 An optimal page-replacement algorithm has the lowest page fault rate of all algorithms. True False Question # 8 of 10 ( Start time: 10:06:48 PM ) Total Marks: 1 is a memory management scheme that supports? Programmer s view of memory System s view of memory Hardware s view of memory None of the given Question # 9 of 10 ( Start time: 10:07:17 PM ) Total Marks: 1 Address Binding will be in Multiprogramming with Variable Tasks (MVT) Dynamic Static Variable Fixed Question # 10 of 10 ( Start time: 10:07:42 PM ) Total Marks: 1 A system is similar to a paging system with swapping Context switching Demand paging Page fault None of the given options Question # 1 of 10 ( Start time: 11:12:21 PM ) Total Marks: 1 When the process tries to access locations that are not in memory, the hardware traps the operating system. This is called as. Page Fault Page replacement Question # 2 of 10 ( Start time: 11:13:16 PM ) Total Marks: 1 The main objective of LRU Page Replacement Algorithm is to replace that page which is referenced most frequently replace the page which is replaced most recently replace the page which is used urgently
replace that page which was used most previously Question # 3 of 10 ( Start time: 11:13:36 PM ) Total Marks: 1 In memory management programmer s view of memory representation is called. Logical address Physical address Offset Question # 4 of 10 ( Start time: 11:14:37 PM ) Total Marks: 1 The size of pages and frames are same in logical memory and physical memory respectively. True False Question # 5 of 10 ( Start time: 11:15:35 PM ) Total Marks: 1 Optimal Page Replacement Algorithm provides a benchmark in assessing other page replacement algorithms. True False Question # 6 of 10 ( Start time: 11:16:06 PM ) Total Marks: 1 ----------holds the smallest legal physical memory address for a process Base register Limit register Index register Stack pointers register Question # 7 of 10 ( Start time: 11:16:44 PM ) Total Marks: 1 is the separation of user logical memory from physical memory. ROM Physical memory Virtual Memory None of the given options Question # 8 of 10 ( Start time: 11:17:09 PM ) Total Marks: 1 We want a page replacement algorithm with the page fault rate. Highest Lowest
Normal None of the given Question # 9 of 10 ( Start time: 11:17:31 PM ) Total Marks: 1 In Swapping technique of Memory Management, the total amount transfer time is directly proportional to the. amount of memory swapped amount of space on backing store space on main memory all the given options are correct Question # 10 of 10 ( Start time: 11:18:55 PM ) Total Marks: 1 To eliminate external fragmentation in segmentation the scheme used is. Fixed size partition scheme Variable size partition scheme Fixed size paging scheme Variable size paging scheme Question # 10 of 10 ( Start time: 08:16:49 PM ) Total Marks: 1 The size of pages and frames are same in logical memory and physical memory respectively. True False Question # 9 of 10 ( Start time: 08:15:59 PM ) Total Marks: 1 In Overlay technique, we can overload any part of the program with the part of the program required needed recently. True False Question # 8 of 10 ( Start time: 08:15:19 PM ) Total Marks: 1 --------------refers to the situation when free memory space exists to load a process in the memory but the space is not contiguous. Internal fragmentation Swapping
External Fragmentation Question # 7 of 10 ( Start time: 08:14:27 PM ) Total Marks: 1 When the process tries to access locations that are not in memory, the hardware traps the operating system. This is called as. Page Fault Page replacement Question # 6 of 10 ( Start time: 08:13:44 PM ) Total Marks: 1 LRU page replacement algorithm can be implemented by counter stack linked list all of the given options Question # 5 of 10 ( Start time: 08:12:42 PM ) Total Marks: 1 Each page is a power of -------- bytes long in paging scheme. 2 3 4 5 Question # 4 of 10 ( Start time: 08:11:55 PM ) Total Marks: 1 ----------holds the smallest legal physical memory address for a process Base register Limit register Index register Stack pointers register Question # 3 of 10 ( Start time: 08:10:37 PM ) Total Marks: 1 In memory management programmer s view of memory representation is called.
Logical address Physical address Offset Question # 2 of 10 ( Start time: 08:10:00 PM ) Total Marks: 1 The main criteria for Page Replacement in Optimal Page Replacement Algorithm is to replace that page which will not be used for the longest period of time. replace that page which will be required most frequently in the execution of a process replace the page which is biggest in size replace the page which is smaller in size Question # 1 of 10 ( Start time: 08:09:29 PM ) Total Marks: 1 is caused due to un-used space in fixed size blocks/ pages. Internal fragmentation External fragmentation MVT Question # 10 of 10 ( Start time: 07:50:19 PM ) Total Marks: 1 In a UNIX system, system call can be used to request the operating system to memory map an opened file. mmap( ) fork ( ) exec( ) read( ) Question # 9 of 10 ( Start time: 07:49:42 PM ) Total Marks: 1 The logical address of Intel 80386 is. 36 bits 48 bits
64 bits 128 bits Question # 8 of 10 ( Start time: 07:49:25 PM ) Total Marks: 1 Memory protection in paging is achieved by associating with each page. This bit indicates whether the page is in the process address space or not. protection bits counting bits paging table segment table Question # 7 of 10 ( Start time: 07:49:04 PM ) Total Marks: 1 External Fragmentation takes place in Multiprogramming with Variable Tasks (MVT) Multiprogramming with Fixed Tasks (MFT) Multi-tasking Question # 6 of 10 ( Start time: 07:48:14 PM ) Total Marks: 1 For some page replacement algorithms, the page fault rate may increase as the number of allocated frames. constant decreased increased All of the given Question # 5 of 10 ( Start time: 07:47:53 PM ) Total Marks: 1 A process is if it is spending more time on paging Thrashing Demand paging Fixed Allocation Question # 4 of 10 ( Start time: 07:47:34 PM ) Total Marks: 1
In paged segmentation, we divide every segment in a process into pages. Fixed size Variable size Question # 3 of 10 ( Start time: 07:47:01 PM ) Total Marks: 1 ------------ register contains the size of the process Base register Index register Limit register Stack pointers register Question # 10 of 10 ( Start time: 07:46:06 PM ) Total Marks: 1 is caused due to un-used space in physical memory. Internal fragmentation External fragmentation MVT Question # 9 of 10 ( Start time: 07:45:09 PM ) Total Marks: 1 The main objective of LRU Page Replacement Algorithm is to replace that page which is referenced most frequently replace the page which is replaced most recently replace the page which is used urgently replace that page which was used most previously Question # 8 of 10 ( Start time: 07:44:36 PM ) Total Marks: 1 In paged segmentation, we divide every segment in a process into pages. Fixed size Variable size Question # 7 of 10 ( Start time: 07:43:42 PM ) Total Marks: 1
Following are the advantages of Virtual memory EXCEPT Efficient process creation Concept of memory mapped files Low CPU consumption Running large sized processes Question # 6 of 10 ( Start time: 07:42:39 PM ) Total Marks: 1 Intel is basically designed for following Operating Systems except. MULTICS OS/2 Windows Linux Question # 5 of 10 ( Start time: 07:41:57 PM ) Total Marks: 1 ----------holds the smallest legal physical memory address for a process Base register Limit register Index register Stack pointers register Question # 4 of 10 ( Start time: 07:41:20 PM ) Total Marks: 1 The main criteria for Page Replacement in Optimal Page Replacement Algorithm is to replace that page which will not be used for the longest period of time. replace that page which will be required most frequently in the execution of a process replace the page which is biggest in size replace the page which is smaller in size Question # 3 of 10 ( Start time: 07:40:31 PM ) Total Marks: 1 The segment table maps the to physical addresses. Page addresses Shared page addresses One-dimensional logical addresses
Two-dimensional logical addresses Question # 2 of 10 ( Start time: 07:39:48 PM ) Total Marks: 1 In case of thrashing if CPU utilization is too low the operating system the degree of multiprogramming. increases decreases sometimes increases and sometimes decreases None of the given options Question # 10 of 10 ( Start time: 09:59:57 PM ) Total Marks: 1 Assume a logical address space of 16 pages of 1024 words, each mapped into a physical memory of 32 frames. Each word consists of 2 bytes. What will be the total number of bits required for p (page number)? 4 bits 8 bits 16 bits 32 bits Question # 9 of 10 ( Start time: 09:59:28 PM ) Total Marks: 1 When the process tries to access locations that are not in memory, the hardware traps the operating system. This is called as. Page Fault Page replacement Question # 8 of 10 ( Start time: 09:58:37 PM ) Total Marks: 1 Following schemes allow efficient implementations of page tables EXCEPT Hashed Page Table Hierarchical / Multilevel Inverted Page Table Binary Page Table
Question # 7 of 10 ( Start time: 09:58:02 PM ) Total Marks: 1 Assume a logical address space of 16 pages, each of 1024 words, each mapped into a physical memory of 32 frames. Each word consists of 2 bytes. What will be the total number of bits required for f (frames)? 5 6 7 8 Question # 6 of 10 ( Start time: 09:57:29 PM ) Total Marks: 1 ----------holds the smallest legal physical memory address for a process Base register Limit register Index register Stack pointers register Question # 5 of 10 ( Start time: 09:57:02 PM ) Total Marks: 1 The high paging activity is called Page Fault Multiprogramming Thrashing Question # 4 of 10 ( Start time: 09:56:11 PM ) Total Marks: 1 The term pager is used in connection with. Demand Paged
Question # 3 of 10 ( Start time: 09:55:33 PM ) Total Marks: 1 A page table needed for keeping track of pages of the page table is called ----------- --- 2-level paging Page directory Page size Page table size Question # 2 of 10 ( Start time: 09:54:25 PM ) Total Marks: 1 A program cannot execute unless whole or necessary part of it resides in the main memory. True False Question # 1 of 10 ( Start time: 09:53:36 PM ) Total Marks: 1 The address generated by the CPU, after any indexing or other addressing-mode arithmetic, is called a --------address, and the address it gets translated to by the MMU is called a ---------address. Virtual, physical Hexadecimal, Binary Valid, invalid Physical, Virtual Question # 10 of 10 ( Start time: 09:49:55 PM ) Total Marks: 1 In case of thrashing if CPU utilization is too low the operating system the degree of multiprogramming. increases decreases sometimes increases and sometimes decreases None of the given options Question # 9 of 10 ( Start time: 09:49:20 PM ) Total Marks: 1
Following statement is NOT true about Virtual memory. Virtual memory help in executing bigger programs even greater in size that of main memory. Virtual memory makes the processes to stuck when the collective size of all the processes becomes greater than the size of main memory. Virtual memory also allows files and memory to be shared by several different processes through page sharing. Virtual memory makes the task of programming easier because the programmer need not worry about the amount of physical memory, Question # 8 of 10 ( Start time: 09:48:56 PM ) Total Marks: 1 Address Binding will be in Multiprogramming with Variable Tasks (MVT) Dynamic Static Variable Fixed Question # 7 of 10 ( Start time: 09:48:20 PM ) Total Marks: 1 In allocation scheme number of frames allocated to a process is proportional to its size. Fixed Allocation Proportional Allocation Priority Allocation None of the given options Question # 6 of 10 ( Start time: 09:47:37 PM ) Total Marks: 1 A system is similar to a paging system with swapping Context switching Demand paging Page fault None of the given options
Question # 5 of 10 ( Start time: 09:47:11 PM ) Total Marks: 1 Physical memory is broken down into fixed-sized blocks, called----------- and Logical memory is divided into blocks of the same size, called ----------- Frames, pages Pages, Frames Frames, holes Holes, segments Question # 4 of 10 ( Start time: 09:46:40 PM ) Total Marks: 1 A program can not execute unless whole or necessary part of it resides in the main memory. True False Question # 3 of 10 ( Start time: 09:46:09 PM ) Total Marks: 1 Each page is a power of -------- bytes long in paging scheme. 2 3 4 5 Question # 2 of 10 ( Start time: 09:45:47 PM ) Total Marks: 1 In paged segmentation, we divide every segment in a process into pages. Fixed size Variable size Question # 1 of 10 ( Start time: 09:45:16 PM ) Total Marks: 1 Memory protection in paging is achieved by associating with each page. This bit indicates whether the page is in the process address space or not. protection bits
counting bits paging table segment table Question # 10 of 10 ( Start time: 09:40:22 PM ) Total Marks: 1 The size of a page is defined by. CPU Page Table Physical Memory Logical Memory Question # 9 of 10 ( Start time: 09:40:04 PM ) Total Marks: 1 In paged segmentation, we divide every segment in a process into pages. Fixed size Variable size Question # 8 of 10 ( Start time: 09:39:46 PM ) Total Marks: 1 When the process tries to access locations that are not in memory, the hardware traps the operating system. This is called as. Page Fault Page replacement Question # 7 of 10 ( Start time: 09:39:28 PM ) Total Marks: 1 We want a page replacement algorithm with the page-fault rate. Highest Lowest Normal None of the given Question # 6 of 10 ( Start time: 09:38:46 PM ) Total Marks: 1
The term pager is used in connection with. Demand Paged Question # 5 of 10 ( Start time: 09:38:20 PM ) Total Marks: 1 ---------------keep in memory only those instructions and data that are needed at any given time. Fragmentation Swapping Overlays Question # 4 of 10 ( Start time: 09:37:44 PM ) Total Marks: 1 Following statement is NOT true about Virtual memory. Virtual memory help in executing bigger programs even greater in size that of main memory. Virtual memory makes the processes to stuck when the collective size of all the processes becomes greater than the size of main memory. Virtual memory also allows files and memory to be shared by several different processes through page sharing. Virtual memory makes the task of programming easier because the programmer need not worry about the amount of physical memory, Question # 3 of 10 ( Start time: 09:37:04 PM ) Total Marks: 1 Assume a logical address space of 16 pages of 1024 words, each mapped into a physical memory of 32 frames. Each word consists of 2 bytes. What will be the total number of bits required for p (page number)? 4 bits 8 bits 16 bits 32 bits
Question # 2 of 10 ( Start time: 09:36:35 PM ) Total Marks: 1 Physical memory is broken down into fixed-sized blocks, called----------- and Logical memory is divided into blocks of the same size, called ----------- Frames, pages Pages, Frames Frames, holes Holes, segments Question # 1 of 10 ( Start time: 09:36:11 PM ) Total Marks: 1 A process is if it is spending more time on paging Thrashing Demand paging Fixed Allocation