An operating system follows a variable memory partitioning model. The system keeps track of empty blocks in a linked list in the order of their address, where each node stores the size of next empty block in the memory. Say that current state of the memory is hold by the linked list shown below, which tells that there are currently four empty blocks in the memory, and the size of first block is 12 byte etc.

An operating system follows a variable memory partitioning model. The system keeps track of empty blocks in a linked list in the order of their address, where each node stores the size of next empty block in the memory. Say that current state of the memory is hold by the linked list shown below, which tells that there are currently four empty blocks in the memory, and the size of first block is 12 byte etc.

Programming Logic & Design Comprehensive

9th Edition

ISBN:9781337669405

Author:FARRELL

Publisher:FARRELL

Chapter8: Advanced Data Handling Concepts

Section: Chapter Questions

Problem 20RQ

See similar textbooks

Similar questions

Suppose that a disk drive has 6,000 cylinders, numbered 0 to 5,999. The drive is currently serving a request at cylinder 3,250, and the previous request was at cylinder 4,805. The queue of pending requests, in FIFO order, is:1515, 1212, 1296, 3800, 544, 618, 356, 2523, 5965, 4681Starting from the current head position, what is the total distance (in cylinders) that thedisk arm moves to satisfy all the pending requests for each of the following diskscheduling algorithms?a. FCFSb. SSTFc. SCANd. LOOK
Suppose that a disk drive has 7,000 cylinders, numbered 0 to 6,999. The drive is currently serving a request at cylinder 1,958, and the previous request was at cylinder 1,807. The queue of pending requests, in FIFO order, is: 2,069, 1,212, 2,296, 2,800, 544, 1,618, 356, 1,523, 4,965, 3681 Starting from the current head position, what is the total distance (in cylinders) that the disk arm moves to satisfy all the pending requests with First Come First Serverd(FCFS) alogrithim?
Consider a 1GByte memory that can be managed by either a bitmap or a linked list. The memory allocation unit is in units of n bytes, which is some power of 2. Memory in the linked list is either marked as free or used (i.e. holes and segments). Assume that each node in the list requires 64 total bits (including a memory address, a length, and a pointer to the next linked list element). Also, make the (unrealistic) assumption that holes and segments are all 32KB (215 bytes) and that they alternate so that there is no coalescing of adjacent holes. It also means that each linked list element covers either a 32KB hole or a 32KB segment. Determine how much memory each data structure uses (the bitmap will be in terms of n)
Suppose that a disk drive has 6,000 cylinders, numbered 0 to 5999. The drive is currently serving a request at cylinder 2225, and the previous request was at cylinder 5195 (Hint: this indicates the reading head’s moving direction). The queue of pending requests, in FIFO order, is: 5962,2876,5452,1369,3594,5046,866,3269,409,1744 Starting from the current head position, what is the total distance (in cylinders) that the disk arm moves to satisfy all the pending requests for each of the following disk-scheduling algorithms? a. FCFS SSTF SCAN LOOK C-SCAN C-LOOK
A common implementation of sequential files on disk has each block point to its successor, which may be any block on the disk. This method requires a constant amount of time to write a block (as the file is originally written), to read the first block in the file, and to read the ith block, once you have read the 1 - 1” block. Reading the lth block therefore requires time proportional to 1. Show how by adding just one additional pointer per node, you can keep all the other properties, but allow the lth block to be read in time proportional to log I. [Hint: heaps have implicit pointers from node I to what other nodes?] Explain what the algorithm for reading the th block has in common with an algorithm for raising a number to the ith power in time proportional to log 1.
write two functions: insertNode and forwardTraverse, for an XOR linkedlist, a.k.a, memory efficient doubly linked list (DLL) in C PL. Ordinary DLLs requires space for two addresses(one pointing to previous node and one to next node). However, XOR LLs use bitwise XOR operation tosave space for one address. Consider the below ordinary DLL.
The inclusion property of a stack page replacement technique asserts that the set of memory pages for n frames is always a subset of the set for n + 1 frames given the same sequence of accesses. OPT/LRU (recently)
On a 32-bit processor, a baggy bounds scheme is expected to set all of the bounds table entries to 31 at initialization time. Assume that a buggy implementation with a slot size of 32 bytes performs bounds table initialization inappropriately, resulting in random entries being incorrectly set to 1. Assume that a networked server processes network messages using an uninstrumented library. Assume that this library does not include some buffer overflow bugs (i.e., it never calls unsafe functions such as gets()). However, the server suffers from the above-mentioned bounds table initialization issue, and an attacker may submit messages to the server that force the library to dynamically assign and write memory in an attacker-controlled amount using uninstrumented code that looks like this: / N is the size of the buffer that the intruder gets to choose.for (int I = 0; I N/4; i++, p += 4) char *p = malloc(N); *p = 'a'; *(p+1) = 'b'; *(p+2) = 'c'; *(p+3) = 'd'; Assume the server is using a…
To index (create a concordance for) the web, provide an implementation of Page that displays B-tree nodes as text files on web pages. Utilise a list of keywords. Take the normal input of web pages to be indexed. Take the command-line argument m and establish an upper maximum of 10m internal nodes to maintain control (before executing for big m, consult with your system administrator). When naming your internal nodes, use an m-digit number. Your nodes' names, for instance, may be BTreeNode0000, BTreeNode0001, BTreeNode0002, and so on when m is 4. Keep strings in pairs on the pages. Add the sort and write operations close() to the API.
Some applications require two types of accesses to the critical section-read access and write access. For these applications, it is reasonable for multiple read accesses to happen concurrently. However, a write access cannot happen concurrently with either a read access or a write access. Example: For a sequence [R1, R2, W1, R3] of requests, R1 and R2 should be able to access the critical section concurrently while W1 and R3 wait in the queue. Once R1 and R2 leave the critical section, W1 can enter the critical section while R3 waits in the queue. (a) Modify Lamport's algorithm for such applications. (b) Modify Ricart and Agrawala's algorithm for such applications.
Suppose that a disk drive has 40 cylinders, numbered 0 to 40. The drive is currently serving a requestat cylinder 20 (the previous request served was at cylinder 19) when the last of these requests is madewith none of these requests yet served. The queue of pending requests, in FIFO order, is 5, 25, 18, 3,39, 8, and 35. A seek takes 5ms per cylinder movement. Starting from the current head position, whatis the total distance (in cylinders) that the disk arm moves to satisfy all the pending request and alsocalculate the total seek time needed to serve these requests, for each of the following disk-schedulingalgorithms? Explain with the help of a diagram in each case. a. FCFSb. SSTFc. SCANd. LOOK
The MWT introduced in class has an array of pointers to children nodes in each node, and the index is used to indicate the letter on the edge. If instead we use a BST (each BST node contains a letter, a corresponding child MWT node pointer) in each MWT node, explain the advantages and disadvantages of this new “MWT” compared to the one introduced in class.