Can you help me with question 1 13.Identify all bugs, if any exist.A. Lines 2-3B. Lines 3-4C. Lines 5-6D. Lines 11-12E. No bugs Consider the following multi-threaded pseudocode.1. get_msg () {2. lock (& mutex);3. sem_wait();4. msg = queue .pop();5. unlock (& mutex);6. return msg;7.}8. add_msg () {9. lock (& mutex);10. queue. push (msg);11. unlock (& mutex);12. sem_post();13.]Identify all bugs, if any exist.

B. Lines 3-4 (Issues with queue and semaphore function calls)Explanation:Approach to solving the…

Answered: 13. Identify all bugs, if any exist. A.…

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

Find the output of the following program code if the following values have been inserted into abcQ: 1 2 4 5
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; }
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
BankCustomerQueueADT Implement in C++ a BankCustomer QueueADT that does the following: 1. gets the input about a customer (first name, last name, Bank Account Number, Money to be withdrawn/deposited, etc.) from the user (from the keyboard) 2. inserts (enqueues) the Customer as a record into the BankCustomerQueueADT (your Queue ADT must be able to have a maximum of 20 customer records) 3. removes (dequeues) the Customer record from the BankCustomerQueueADT 4. your BankCustomerQueueADT must also have the behavior of retrieving and displaying the Queue info on the screen after each event (either entry of a Bank Customer into the queue, OR leaving of the Bank customer from the queue). NOTE: Please make sure you debug, run, test and see the program working correctly before submitting. Make sure all the code statements are commented. Make sure your program is indented properly.
Part I: Counting Semaphore struct semaphore { int count; queueType queue; }; void semWait (semaphore s) s.count--; if (s.count < 0) { /* place this process in s.queue */; /* block this process */; void semSignal (semaphore s) s.count++; if (s.count<= 0) ( /* remove a process P from s.queue */; /* place process P on ready list */; Figure 1. A simple program structure of counting semaphore primitives. Questions: 1. In your perspective, what makes counting semaphore primitives a good concurrency mechanism? 2. How does the structure of counting semaphore primitives differ from binary semaphore primitives?
Part II: Binary Semaphore struct binary_semaphore enum (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 and semSignalB functions in Figure 2. 4. Based on Figures 1 and 2, which semaphore structure is easier to implement and why?
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
Assume that a queue is implemented in C programming language using an array with size 15. At some point the front is at index 9 and rear (the last element) is 14. If an element is dequeued, front and rear indexes are: a) Front:9 Rear:15 b) Front:9 Rear: 0 c) Front:10 Rear: 0 d) Front:10 Rear:14
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.
In a queue implementation using array of size 5, the array index starts with 0 where head and tail values are 3 and 4 respectively. Determine the array index at which the insertion of the next element will take place. 0 5 1 2
A queue and a deque data structure are related concepts. Deque is an acronym meaning "double-ended queue." With a deque, you may insert, remove, or view from either end of the queue, which distinguishes it from the other two. Use arrays to implement a deque
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.

SEE MORE QUESTIONS

Recommended textbooks for you

C++ Programming: From Problem Analysis to Program…

Computer Science

ISBN:

9781337102087

Author:

D. S. Malik

Publisher:

Cengage Learning