Part II: Binary Semaphorestruct binary_semaphoreenum (zero, one} value;queueType queue;void semwaitB (binary_semaphore s)if (s.value -- one)s.value - zero;else {/* place this process in s.queue */;/* block this process */:void semsignalB (semaphore s)if (s.queue is empty ())s.value - one;else {/* remove a process P from s.queue/* place process P on ready list */;Figure 2. A simple program structure of binary semaphore primitives.Questions:3. Briefly explain the purpose of the semWaitB andsemSignalB functions in Figure 2.4. Based on Figures 1 and 2, which semaphorestructure is easier to implement and why?

According to our policy we can solve First one :…

Part II: Binary Semaphore struet binary_semaphorel enum (zero, one) value; queueType queue; void semlaitB (binary_semaphore s) if (s.value -- one) s.value - zero; else ( /* place this process in s.queue /; /* block this process */: void semsignalB (semaphore s) if (s.queue is empty()) - one: s.value else i /* remove a process P from s.queue */; /* place process P on ready list */: Figure 2. A simple program structure of binary semaphore primitives. Questions: 3. Briefly explain the purpose of the semWaitB and semSignalB functions in Figure 2.

Part II: Binary Semaphore struet binary_semaphorel enum (zero, one) value; queueType queue; void semlaitB (binary_semaphore s) if (s.value -- one) s.value - zero; else ( /* place this process in s.queue /; /* block this process /: void semsignalB (semaphore s) if (s.queue is empty()) - one: s.value else i / remove a process P from s.queue /; / place process P on ready list */: Figure 2. A simple program structure of binary semaphore primitives. Questions: 3. Briefly explain the purpose of the semWaitB and semSignalB functions in Figure 2.

C++ Programming: From Problem Analysis to Program Design

8th Edition

ISBN:9781337102087

Author:D. S. Malik

Publisher:D. S. Malik

Chapter18: Stacks And Queues

Section: Chapter Questions

Problem 21SA

See similar textbooks

Similar questions

Part II: Binary Semaphore struct binary_senaphore enum (zero, one) value; queueType quaue; void senklaite (binary_semaphore s1 if (8.value -- one) - 2aro; a.value else /* place this process in s.queue /: /* block this process */ void sensignalB(senaphore sl if (8. queue is enpty (1) a.value - one else i /* remova a process P from s- queue */: * place process P on ready 1ist */: Figure 2. A simple program structure of binary semaphore primitives. Questions: 3. Briefly explain the purpose of the semWaitB and semsignalB functions in Figure 2. 4. Based on Figures 1 and 2, which semaphore structure is easier to implement and why?
void pop()// Pre: size() > 0.// Post: The highest priority item has been removed from the// p_queue. (If several items have the equal priority,// then the implementation may decide which one to remove.)// void p_queue::pop() { cerr << "pop() not implemented yet" << endl; }
Find the output of the following program code if the following values have been inserted into abcQ: 1 2 4 5
Q/ In java language Create a Queue (capacity of 10 Students) of 6 different students according to their ID number De-queue one students and En-queue two Students by displaying their Front and Rear Values.
Part I: Counting Semaphore struct semaphore int count: queoetype queue void semkait (semaphore a) .count-- if (s.count < 0) I /* place this process in a.queue /: /* block this process /: void sensignal (semaphore s) s.count++; if (s.count< 0) /* remove a process P from s.queue / /* place process P on ready 1ist /: Figura t.Asope.oogastutued.coutog.serophaeatostes. Part II: Binary Semaphore struct binary_semaphore enum (zero, one) value; queueType queue; void semkaitl (binary_semaphore s) if (a.value - one) s.value - zero else /* place this process in s.queue /1 /* block this process /: void sensignalB(semaphore s) if (a.queue is enpty ()) S.value- one else /* remove a process P from s.queue */ /* place process P on ready list "/; Figura.2.Asiopie.oogamstuctuedobay.seaosatotices 2. Based on Figures 1 and 2, which semaphore structure is easier to implement and why?
Note : addqueue works like Enqueue and deleteQueue works like Dequeue Consider the following statements: (8, 9) queueType queue; int num; Show what is output by the following segment of code num = 7; queue.addQueue (6); queue.addQueue (num); num = queue.front (); queue.deleteQueue(); queue.addQueue (num + 5); queue.addQueue (14); queue.addQueue (num queue.addQueue (25); queue.deleteQueue (); 2); cout <« "Queue elements: "; while (!queue.isEmptyQueue ()) { cout <« queue.front () << " "; queue.deleteQueue(); } cout <« endl; Queue elements: 14 14 4 25 Queue elements: 11 14 4 4 Queue elements: 11 14 4 25 Queue elements: 11 14 25 25
Suppose the following operations are performed on an empty queue:enqueue(5);enqueue(?);dequeue();enqueue(9);enqueue ( 12);dequeue();enqueue(10);Insert numbers in the following diagram to show what will be stored in the staticqueue after the operations have executed .front rear
Queue abcQ = new Queue (); Queue out = new Queue (); //statements to insert value 1, 2, 3, 4, 5 into abcQ for (int i = 0; i < 5; i++) { int a = Integer.parseInt (abcQ.dequeue ().tostring ()); int b = Integer.parseInt (abcQ.dequeue ().tostring ()); abcQ.enqueue (a); abcQ.enqueue (b); out.enqueue (a + b); for (int i = 0; i < 5; i++) System.out.print (abcQ.dequeue () + " "); System.out.println ("\n") ; for (int i = 0; i < 5; i++) System.out.print (out.dequeue () + " "); (- ks)
class PrintManager def initialize @queue = Queue.new end def queue_print_job (document) @queue. enqueue (document) end def run # Each time this Loop runs, we read the document # at the front of the queue: while @queue.read #We dequeue the document and print it: print (@queue.dequeue) end end private end def print (document) # Code to run the actual printer goes here. # For demo purposes, we'll print to the terminal: puts document end We can then utilize this class as follows: print_manager PrintManager.new print_manager.queue_print_job("First Document") print_manager.queue_print_job ( "Second Document") print_manager.queue_print_job("Third Document") print_manager.run
Explain how a queue works along with the enqueue and dequeue operations with front and rear pointers.
java data structure Queue: Q4: A program performs the following operations on an empty queue Q: Q.enqueue(24) Q.enqueue(74) Q.enqueue(34) Q.first() Q.dequeue() Q.enqueue(12) Q.dequeue() Please show the queue contents at the end of these operations. Clearly show the front of the queue.
linkedQueueType queue; queue.addQueue(10); queue.addQueue(20); cout << queue.front() << endl; queue.deleteQueue(); queue.addQueue(2 * queue.back()); queue.addQueue(queue.front()); queue.addQueue(5); queue.addQueue(queue.back() - 2); linkedQueueType tempQueue; tempQueue = queue; while (!tempQueue.isEmptyQueue()) { cout << tempQueue.front() << " "; tempQueue.deleteQueue(); } cout << endl; cout << queue.front() << " " << queue.back() << endl;