Question on Memory Management.

By -

Question Bank
4.1 What is the motivation for main memory management?
4.2 What is the impact of fixed partitioning on fragmentation?
4.3 Give the relative advantages and disadvantages of load time dynamic linking and run-time dynamic linking. Differentiate them from static linking.
4.4 Explain the process of linking and loading?
4.5 Give arguments to support variable partitioning for main memory management.
4.6 How would you classify the buddy system of memory allocation? Write a short critique on the scheme.
4.7 What is meant by virtual memory? With the help of a block diagram explain the data structures used.
4.8 Describe first-fit and best-fit strategies for disk space allocation, with their merits and demerits.
4.9 What is a page and what is a frame. How are the two related?
4.10 What is swapping? Why does one need to swap areas of memory?
4.11 Discuss virtual memory management scheme. Compare any two page replacement policies
4.12 Explain the software and hardware methods of implementing page lookup tables.
4.13 Explain how segmented memory management works. Also explain in details address translation and relocation segmented memory management
4.14 Give description of hard-ware support to paging.
4.15 What is thrashing? When does it happen and how does it affect performance?
4.16 What is a page fault? What action does the OS? take when a page fault occurs?
4.17 Write short notes on
a Segmentation
b Free space management
c Paging
4.18 What is the purpose of a TLB? Explain the TLB lookup with the help of a block diagram, explaining the hardware required.
4.19 Discuss the following page replacement algorithms with an example.
a Optimal
b LRU
4.20 Describe the actions taken by the operating system when a page fault occurs.
4.21 Compare and contrast the paging with segmentation. In particular, describe issues related to fragmentation.
4.22 What is portability? Differentiate between codes and object code portability.
4.23 Describe the first fit, best fit and worse fit strategies for disk space allocation.
4.24 Explain the following memory management techniques:
a Partitioned memory allocation
b Segmented allocation.
4.25 Describe any two page replacement algorithms giving examples.

Comments

Post a Comment

Popular posts from this blog

Input Output (IO) Management:HW/SW Interface and Management of Buffers.

By -
Image
5.3 HW/SW Interface IO management requires that a proper set-up is created by an application on computer system with an IO device. An IO operation is a combination of HW and SW instructions as shown in Figure 5.8. Following the issuance of an IO command, OS kernel resolves it, and then communicates Figure 5.8: Communication with IO devices. with the concerned device driver. The device drivers in turn communicate with IO devices. The application at the top level only communicates with the kernel. Each IO request from an application results in generating the following: Naming or identification of the device to communicate. Providing device independent data to communicate; The kernel IO subsystem arranges for the following: The identification of the relevant device driver. We discuss device drivers in Section 5.3.1. Allocation of buffers. We discuss buffer management in Section 5.4. Reporting of errors. Tracking the device usage (is the device free, who is the current u...
Read more

Introduction to Operating Systems:Early History: The 1940s and 1950s

By -
Early History: The 1940s and 1950s Operating systems have evolved over the last 60 years through several distinct phases or generations that correspond roughly to the decades (see the Operating Systems Thinking feature, Innovation).3 In the 1940s, the earliest electronic digital computers did not include operating systems.4, 5, 6 Machines of the time were so primitive that programmers often entered their machine-language programs one bit at a time on rows of mechanical switches. Eventually, programmers entered their machine-language programs on punched cards. Then, assembly languages—which used English-like abbreviations to represent the basic operations of the computer— were developed to speed the programming process. General Motors Research Laboratories implemented the first operating sys- tem in the early 1950s for its IBM 701 computer.7 The systems of the 1950s generally executed only one job at a time, using techniques that smoothed the transition between jobs to obtain maximu...
Read more

Input Output (IO) Management:IO Organization.

By -
Image
IO Organization In the previous section we discussed various issues that arise from the need to support a wide range of devices. To meet these varied requirements, a few well understood modalities have evolved over time. The basic idea is to select a mode of communication taking device characteristics into account or a need to synchronize with some event, or to just have a simple strategy to ensure a reliable assured IO. Computers employ the following four basic modes of IO operation: 1. Programmed mode 2. Polling mode 3. Interrupt mode 4. Direct memory access mode. We shall discuss each of these modes in some detail now. 5.2.1 Programmed Data Mode In this mode of communication, execution of an IO instruction ensures that a program shall not advance till it is completed. To that extent one is assured that IO happens before anything else happens. As depicted in Figure 5.1, in this mode an IO instruction is issued to an IO device and the program executes in “busy-waiting” (idli...
Read more