Here In this post we will discuss the important questions of the Memory management. These questions will help you in your mid semesters exams or the semester exams or any other competitive exams. And this will also help in your upcoming AKTU semester exam.
The topics cover in it are:-
Basics of memory management, Multiprogramming with fixed
partitions, Multiprogramming with variable partitions, Protection schemes
********************************************************************************************************
1. CPU fetches the instruction from memory according to the value of ____________
a) program counter
b) status register
c) instruction register
d) program status word
Answer: a
2. A memory buffer used to accommodate a speed differential is called ____________
a) stack pointer
b) cache
c) accumulator
d) disk buffer
Answer: b
3. Which one of the following is the address generated by CPU?
a) physical address
b) absolute address
c) logical address
d) none of the mentioned
Answer: c
4. Run time mapping from virtual to physical address is done by ____________
a) Memory management unit
b) CPU
c) PCI
d) None of the mentioned
Answer: a
5. Memory management technique in which system stores and retrieves data from secondary storage for use in main memory is called?
a) fragmentation
b) paging
c) mapping
d) none of the mentioned
Answer: b
7. Program always deals with ____________
a) logical address
b) absolute address
c) physical address
d) relative address
Answer: a
8. The main memory accommodates ____________
a) operating system
b) cpu
c) user processes
d) all of the mentioned
Answer: a
9. What is the operating system?
a) in the low memory
b) in the high memory
c) either low or high memory (depending on the location of interrupt vector)
d) none of the mentioned
Answer: c
10. In contiguous memory allocation ____________
a) each process is contained in a single contiguous section of memory
b) all processes are contained in a single contiguous section of memory
c) the memory space is contiguous
d) none of the mentioned
Answer: a
11. The relocation register helps in ____________
a) providing more address space to processes
b) a different address space to processes
c) to protect the address spaces of processes
d) none of the mentioned
Answer: c
12. With relocation and limit registers, each logical address must be _______ the limit register.
a) less than
b) equal to
c) greater than
d) none of the mentioned
Answer: a
13. The operating system and the other processes are protected from being modified by an already running process because ____________
a) they are in different memory spaces
b) they are in different logical addresses
c) they have a protection algorithm
d) every address generated by the CPU is being checked against the relocation and limit registers
Answer: d
14. When memory is divided into several fixed sized partitions, each partition may contain ________
a) exactly one process
b) at least one process
c) multiple processes at once
d) none of the mentioned
Answer: a
15. In fixed size partition, the degree of multiprogramming is bounded by ___________
a) the number of partitions
b) the CPU utilization
c) the memory size
d) all of the mentioned
Answer: a
16.The first fit, best fit and worst fit are strategies to select a __
a) process from a queue to put in memory
b) processor to run the next process
c) free hole from a set of available holes
d) all of the mentioned
Answer: c
17. In internal fragmentation, memory is internal to a partition and ____________
a) is being used
b) is not being used
c) is always used
d) none of the mentioned
Answer: b
18. A solution to the problem of external fragmentation is ____________
a) compaction
b) larger memory space
c) smaller memory space
d) none of the mentioned
Answer: a
19. Another solution to the problem of external fragmentation problem is to ____________
a) permit the logical address space of a process to be noncontiguous
b) permit smaller processes to be allocated memory at last
c) permit larger processes to be allocated memory at last
d) all of the mentioned
Answer: a
20. When the memory allocated to a process is slightly larger than the process, then ____________
a) internal fragmentation occurs
b) external fragmentation occurs
c) both internal and external fragmentation occurs
d) neither internal nor external fragmentation occurs
Answer: a
21. __________ is generally faster than _________ and _________
a) first fit, best fit, worst fit
b) best fit, first fit, worst fit
c) worst fit, best fit, first fit
d) none of the mentioned
Answer: a
22. External fragmentation exists when?
a) enough total memory exists to satisfy a request but it is not contiguous
b) the total memory is insufficient to satisfy a request
c) a request cannot be satisfied even when the total memory is free
d) none of the mentioned
Answer: a
23. External fragmentation will not occur when?
a) first fit is used
b) best fit is used
c) worst fit is used
d) no matter which algorithm is used, it will always occur
Answer: d
24. The base register is also known as the ____________
a) basic register
b) regular register
c) relocation register
d) delocation register
Answer: c
25. The address loaded into the memory address register of the memory is referred to as ____________
a) Physical address
b) Logical address
c) Neither physical nor logical
d) None of the mentioned
Answer: a
Recommended Post:
- c program to convert specified days into years weeks and days
- Print Reverse Hollow Pyramid
- Update the booking ID | Wipro previous year question paper
- Pages in PDF | Wipro previous year question paper
- Sparse Matrix in data structure
- Find the location ID | Wipro previous year Coding question
- find the odd digits | Wipro Coding question
- Find the product id | Wipro Coding question
- Difference between static and dynamic memory allocation
- What is asymptotic Notation
Hackerearth Problems:-
- Very Cool numbers | Hacker earth solution
- Vowel Recognition | Hackerearth practice problem solution
- Birthday party | Hacker earth solution
- Most frequent | hacker earth problem solution
- program to find symetric difference of two sets
- cost of balloons | Hacker earth problem solution
- Chacha o chacha | hacker earth problem solution
- jadu and dna | hacker earth solution
- Bricks game | hacker earth problem
- Anti-Palindrome strings | hacker earth solution
- connected components in the graph | hacker earth data structure
- odd one out || hacker earth problem solution
- Minimum addition | Hackerearth Practice problem
- The magical mountain | Hackerearth Practice problem
- The first overtake | Hackerearth Practice problem
Hackerrank Problems:-
- Playing With Characters | Hackerrank practice problem solution
- Sum and Difference of Two Numbers | hackerrank practice problem solution
- Functions in C | hackerrank practice problem solution
- Pointers in C | hackerrank practice problem solution
- Conditional Statements in C | Hackerrank practice problem solution
- For Loop in C | hackerrank practice problem solution
- Program to find cycle in the graph
- Implementation of singly link list
- Implementation of queue by using link list
- Algorithm of quick sort
- stack by using link list
- program to find preorder post order and inorder of the binary search tree
- Minimum weight of spanning tree
- Preorder, inorder and post order traversal of the tree
- How to set limit in the floating value in python
- What is boolean data type
- How to print any character without using format specifier
