around a table with one chopstick between each of them. Let the Philosophers be numbered from 0 to n-1 and be represented by separate threads. Each Philosopher executes Dine(i), where "i" is the Philosopher's number. Assume that there is an array of semaphores, Chop[i] that represents the chopstich to the left of Philosopher i. These semaphores are initialized to 1. void Dine(int i) { /* Grab left chopstick*/ /* Grab right chopstick*/ Chop[i).P(); Chop[(i+1)%n].P(); EatAsMuchAs YouCan(); Chopſi).V(); Chop[(i+1)%n].V(): } Find whether this solution lead to deadlock: Explain the four conditions of deadlock. /* Release left chopstick*/ /* Release right chopstick*/-

around a table with one chopstick between each of them. Let the Philosophers be numbered from 0 to n-1 and be represented by separate threads. Each Philosopher executes Dine(i), where "i" is the Philosopher's number. Assume that there is an array of semaphores, Chop[i] that represents the chopstich to the left of Philosopher i. These semaphores are initialized to 1. void Dine(int i) { /* Grab left chopstick/ / Grab right chopstick/ Chop[i).P(); Chop[(i+1)%n].P(); EatAsMuchAs YouCan(); Chopſi).V(); Chop[(i+1)%n].V(): } Find whether this solution lead to deadlock: Explain the four conditions of deadlock. / Release left chopstick/ / Release right chopstick*/-

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

Write a program CubeSum.java that prints outall integers of the form a3 + b3 where a and b are integers between 0 and N in sortedorder, without using excessive space. That is, instead of computing an array of the N2sums and sorting them, build a minimum-oriented priority queue, initially containing(03, 0, 0), (13, 1, 0), (23, 2, 0), . . . , (N3, N, 0). Then, while the priority queue is nonempty,remove the smallest item(i3 + j3, i, j), print it, and then, if j < N, insert the item (i3 + (j+1)3,i, j+1). Use this program to find all distinct mintegers a, b, c, and d between 0 and 106such that a3 + b3 = c3 + d3
Consider a Circular Queue implemented using an array of length 5. Show the contents of the queue after executing each of the following segments of code in order. Follow this ID(201920090) important, solve only (d,e and f) ,thanks
4) Given that a queue is being represented by the following circular representation in an array (front is currently 4 and back is currently 7): array component: 0 1 2 4 5 6 7 8 | | | | 37 | 41 | 12 | 34 | | a) Show what this representation would like after the following sequence of operations are performed: deq(q, i); deq(q, j); enq(q, 81); enq(q, 72); enq(q, 38); deq(q, k); (indicate the current position of front and back for each operation) b) What is an advantage of this implementation of a queue? c) What is a disadvantage of this implementation of a queue?
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
Give answers to the following.1. Show the contents of a (linear) queue and position of front and rear markers (at each step) once thefollowing sequence of statements is executed,Assume array size = 4.Queue Q; 1. Q.Ins_q(10); 2. Q.Ins_q(20); 3. Q.Ins_q(30); 4. Q.del_q(); 5. Q.del_q(); 6. Q.Ins_q(40); 7. Q.del_q(); 8. Q.del_q();
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 there are two singly linked lists both of which intersect at some point and become a single linked list. The head or start pointers of both the lists are known, but the intersecting node is unknown. Also, the number of nodes in each of the list before they intersect are unknown and both the list may have it different. List1 may have n nodes before it reaches intersection point and List2 might have m nodes before it reaches intersection point where m and n may be m = n, m > n or m < n. Give an algorithm for finding the merging point. Hints: A brute force approach would be to compare every pointer in one list with every pointer in another list. But in this case the complexity would be O(mn)
Develop an implementation of Page that represents B-tree nodes astext files on web pages, for the purposes of indexing (building a concordance for) theweb. Use a file of search terms. Take web pages to be indexed from standard input. Tokeep control, take a command-line parameter m, and set an upper limit of 10m internalnodes (check with your system administrator before running for large m). Use an mdigit number to name your internal nodes. For example, when m is 4, your nodes namesmight be BTreeNode0000, BTreeNode0001, BTreeNode0002, and so forth. Keep pairsof strings on pages. Add a close() operation to the API, to sort and write. To test yourimplementation, ook for yourself and your friends on your university’s website.
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 the current elements and its indexes in the queue of size 15: {index[00]=102, index[01]=165, index[02]=115, index[03]=384, index[04]=248, index[05]=111}, draw a table (like shown below) the sequence of elements using the operations listed from number 1 to 26 using the queue approach (A) - in shifting the elements one position forward every time an element is deleted. The following are the description of other operations to be used that would result in a QUEUE that contains the elements. IsTopValue – returns the value at the TOP of the queue. IsRearValue – returns the value at the REAR of the queue. IsTopIndex – returns the index of the value at the TOP of the queue. IsRearIndex – returns the index of the value at the REAR of the queue. IsIndexOf – returns the index of the specific value. IsValueOf – returns the value of the specific index. Insert (Q, 12) Dequeue (Q) Dequeue (Q) Insert (Q, 65) Insert (Q, 100) Insert (Q, 43) Dequeue (Q) IsTopValue (Q) Insert (Q, 61) Dequeue…
Suppose a biking environment consists of n ≥ 3 landmarks,which are linked by bike route in a cyclical manner. That is, thereis a bike route between landmark 1 and 2, between landmark 2 and 3,and so on until we link landmark n back to landmark 1. In the centerof these is a mountain which has a bike route to every single landmark.Besides these, there are no other bike routes in the biking environment.You can think of the landmarks and the single mountain as nodes, andthe bike routes as edges, which altogether form a graph G. A path is asequence of bike routes.What is the number of paths of length 2 in the graph in termsof n?What is the number of cycles of length 3 in the graph in termsof n?What is the number of cycles in the graph in terms of n?
1. Consider an open hash (that is, one that deals with collisions by using a linked list) with a million entries. The hash algorithm takes 200ns to run, each comparison of objects takes 10ns, and everything else involved in the lookup takes trivial time. How large does the hash table need to be to use less time on chained comparisons than on the initial hash lookup? (Remember that you always have to compare once.)