B5) bak from executionn ) The table below provides information on five Jobs (P1, P2, P3, P4, and P5) which have been passed into the ready queue for execution. ea cammyng wat homay (i) (iii) Processes PI P2 P3 P4 P5 Execution time (ms) 55 25 30 15 10 FCFS SIN SRP BR - no 20 Pre Fifs 6 PRE ~upracticfals I Draw the resulting time line diagram if the operating system uses the FCFS, SJN (non-preemptive), and Round Robin scheduling algorithms. Calculate the average service time, average waiting time, response time, average turn around time, and throughput for each scheduling algorithm. (Assume preemptive scheduling for the Round Robin scheduling with a quantum time of 10ms). Determine which of the algorithms gives the best results.

B5) bak from executionn ) The table below provides information on five Jobs (P1, P2, P3, P4, and P5) which have been passed into the ready queue for execution. ea cammyng wat homay (i) (iii) Processes PI P2 P3 P4 P5 Execution time (ms) 55 25 30 15 10 FCFS SIN SRP BR - no 20 Pre Fifs 6 PRE ~upracticfals I Draw the resulting time line diagram if the operating system uses the FCFS, SJN (non-preemptive), and Round Robin scheduling algorithms. Calculate the average service time, average waiting time, response time, average turn around time, and throughput for each scheduling algorithm. (Assume preemptive scheduling for the Round Robin scheduling with a quantum time of 10ms). Determine which of the algorithms gives the best results.

Database System Concepts

7th Edition

ISBN:9780078022159

Author:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Publisher:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Chapter1: Introduction

Section: Chapter Questions

Problem 1PE

See similar textbooks

Similar questions

17-14 C++ Instructions Write the definition of the function moveNthFront that takes as a parameter a positive integer, n. The function moves the nth element of the queue to the front. The order of the remaining elements remains unchanged. For example, suppose: queue = {5, 11, 34, 67, 43, 55} and n = 3. After a call to the function moveNthFront: queue = {34, 5, 11, 67, 43, 55} Add this function to the class queueType. Also, write a program (in main.cpp) to test your method.
Assume the following list of keys: 16, 38, 54, 80, 22, 65, 55, 48, 64, 95, 5,100, 58, 25, 36 This list is to be sorted using quicksort as discussed in this chapter. Use pivot as the middle element of the list. a.) Give the resulting list after one call to the partition b.) Give the resulting list after two calls to the partition
Q__3.. ...Design a data structure that follows the constraints of a Least Recently Used (LRU) cache. Implement the LRUCache class: LRUCache(int capacity) Initialize the LRU cache with positive size capacity. int get(int key) Return the value of the key if the key exists, otherwise return -1. void put(int key, int value) Update the value of the key if the key exists. Otherwise, add the key-value pair to the cache. If the number of keys exceeds the capacity from this operation, evict the least recently used key. The functions get and put must each run in O(1) average time complexity. Example 1: Input ["LRUCache", "put", "put", "get", "put", "get", "put", "get", "get", "get"] [[2], [1, 1], [2, 2], [1], [3, 3], [2], [4, 4], [1], [3], [4]] Output [null, null, null, 1, null, -1, null, -1, 3, 4]... Code inly--+).
2.2.14 Combining sorted queues. Create a static function that accepts two sorted queues as parameters and returns a queue formed by merging the queues into sorted order. 2.2.15 Mergesort from the bottom of the queue. Create a bottom-up mergesort implementation using the following method: Create N queues, each containing one of the things, given N items. Make a queue out of the N queues. Then, repeat Exercise 2.2.14's merging process on the first two queues, and finally, reinsert the combined queue.Repeat until there is just one queue in the queue of queues.
Python help Choose the right data structure (Stack, Queue, Deque) and create a function that takes two file (first_file, updated_file) where first_file has alot of duplicated strings, and updated_files is file that takes out any duplicated string from first_file and write it to update_files
8. The following sequence of operations essentially leaves a queue unchanged. Group of answer choices enqueue followed by dequeue dequeue followed by enqueue two enqueues followed by two dequeues two isEmptys followed by two isFulls 9. Recall that within the ArrayBoundedQueue the front variable and the rear variable hold the indices of the elements array where the current front and rear elements, respectively, of the queue are stored. Which of the following code sequences could be used to correctly enqueue element into the queue, assuming that enqueue is called on a non-full queue and that the code also correctly increments numElements? Group of answer choices rear++; elements[rear] = element; front++; elements[front] = element; rear = (rear + 1) % elements.length; elements[rear] = element; front = (front + 1) % elements.length; elements[front] = element; 10. Assume you are using the text's array-based queue and have just instantiated a queue of capacity 10. You…
2.2.14 Sorted queues being combined. Create a static function that receives two queues of sorted items as inputs and returns a queue formed by combining the two queues into a single sorted order queue. 2.2.15 Bottom-up mergesort of a queue. Create an implementation of the bottom-up mergesort using the following strategy: Make N queues, each holding one of the N things, given N items. assemble the N queues into a queue. Apply Exercise 2.2.14's merging process to the first two queues several times, and at the conclusion, reinsert the combined queue.Continue until there is just one queue left in the queue of queues.
A.) This script, named build.sh gets as argument the path to a folder where to find a source file and builds the executable. B.) This script named script02.sh and take two arguments: a string to look for, and a path to the root folder to start the search from. The script should then explore recursively the folder hierarchy starting from the folder located at the path given as argument. At each folder encountered through the recursive search, the script should build a list of all text files in the folder and send this list, along with the target and the folder’s path, in a call to prog02 ( c program). The output of your script should have the following format: Recursive search for target <target> starting at <path> Search depth: <depth> Total number of folders: <number> Total number of text files: <number> <output produced by the C program>
Assignment Assuming these values are codes foe specific tasks to be performed in the order ofimportance, the higher the value the higher the importance of the work. a. With the value below illustrate how priority queues are implemented using heapsort: 87, 36, 22, 15, 56, 85, 48, 90, 72, 6b.Perform one of the linear sorts on the data set. 2. Given these codes: 40, 12, 62,10, 15, 54, 85,105 a. Create a balanced binary tree from these nodes. b. Delete the node 62 and recreate the tree to meet the binary tree standards.Traverse the tree in Pre-Order 3. The OS which is a very important component of the computers system, is responsiblefor managing and sharing computer resources among incoming tasks for the computerto process. CPU time and memory allocation are very important for the smooth runningof the computer. However, there is the basic understanding that the CPU does notmultitask but adopts various mechanisms to keep the operations in order. a.Analyse the problem given and identify the…
OPERATING SYSTEM Suppose, there are three producers P1, P2, and P3 who want to produce and put items in the buffer. And, there are four consumers C1, C2, C3, and C4 who want to consume items from the buffer. No process takes more than 5 units of time to complete unless the process goes to the waiting queue(S->list) of semaphore. At a certain point of the execution, following are the values of the semaphores: mutex=1 , countEmpty=8, countFull=2 Find the output of the following sequence of commands. At time 0 : C1 started At time 0: C2 started At time 10: C3 started a) What is the Value of countEmpty? What is the Value of countFull? What are the Processes in the waiting queue of the semaphore? At time 15 : P1 started At time 20 : P2 started b) What is the Value of countEmpty? What is the Value of countFull? What are the Processes in the waiting queue of the semaphore? At time 25 : C4 started At time 30 : P3 started c) What is the Value of countEmpty? What is the Value of…
Can you finish the code pleaseaccording to the instruction For the stack, perform the following operations in order - Push seven (7) objects starting from the array index 13 onwards to the stack. Peek the top of the stack - print the result. Perform three (3) pops in succession. Print the contents of the stack. Push five (5) more objects from the start of the objects array to the stack. Pop twice in succession. Print the contents of the stack. For the queue, perform the following operations in order - Enqueue the seven (7) objects at odd indexes starting from index 5 in the array. Peek the front and end of the queue - print the results. Perform two (2) dequeues in succession. Print the contents of the queue. Enqueue five (5) more objects from the index 10 in the array. Dequeue three times in succession. Print the contents of the queue. End the program with a leaving message of your choice. Remember to clean up before the program ends. Restrict all your input / output…
Use C++ Programming Language. Objective Define a circular buffer data structure and test it. Problem Description: A circular buffer (also called a circular queue) is circular list of nodes where data items are added on one end of the buffer and removed from the other end. Because the nodes form a circular list, the list has no end or beginning: the tail node points to the head node, creating a ring of nodes. You may think of the nodes as containers or slots that are all initially empty but can be assigned a value in their data field info. Every time a new data item is inserted (inserting to a buffer is often referred as Writing), one slot is filled and the buffer has one less empty slot. Every time a data item is removed (referred to as Reading), the buffer has one more empty slot. Since the list has no beginning and no end, a pointer (writeIndex) is used to mark the next empty slot to write to and a second pointer (readIndex) is used to mark the next node to read from. The…