Match the descriptions with the methods provided for the Java implementation of the producer-consumer problem if the array is full, wait until a spot becomes available if the array has space, put an item in it and awaken all therads if the array is empty, wait until it contains an item if the array has items, obtain an item and awaken all threads keep on depositing new items into a queue keep on fetching items from a queue run in Producer run in Consumer run in Consumer run in Producer deposit in Queue fetch in Queue

Match the descriptions with the methods provided for the Java implementation of the producer-consumer problem if the array is full, wait until a spot becomes available if the array has space, put an item in it and awaken all therads if the array is empty, wait until it contains an item if the array has items, obtain an item and awaken all threads keep on depositing new items into a queue keep on fetching items from a queue run in Producer run in Consumer run in Consumer run in Producer deposit in Queue fetch in Queue

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 16PE: The implementation of a queue in an array, as given in this chapter, uses the variable count to...

See similar textbooks

Similar questions

Implement a simple stack in java using the scenario below. A company wishes to keep track of the order in which it employed staff. Users can enter either "f" to fire, "h" to hire or "e" to end the program. When a member of staff is employed, their employee number is added to the top of a stack when someone has to be made redundant, the last person to join the company is removed from the top of the stack. Hint: Use ArrayList
The main thread of a Java program can generate additional threads. true or false It is possible to implement an unbounded queue using an array-based approach. true or false
The implementation of a queue in an array, as given in this chapter, uses the variable count to determine whether the queue is empty or full. You can also use the variable count to return the number of elements in the queue. On the other hand, class linkedQueueType does not use such a variable to keep track of the number of elements in the queue. Redefine the class linkedQueueType by adding the variable count to keep track of the number of elements in the queue. Modify the definitions of the functions addQueue and deleteQueue as necessary. Add the function queueCount to return the number of elements in the queue. Also, write a program to test various operations of the class you defined.
Turtle Hare Race - Multithreading Use Java multithreading to implement the turtle hare race program. You are not allowed to use Timer events. Your program should have one thread for turtle, one thread for hare, and one dedicated thread for periodic painting.
Develop a class ResizingArrayQueueOfStrings that implements the queueabstraction with a fixed-size array, and then extend your implementation to use arrayresizing to remove the size restriction.Develop a class ResizingArrayQueueOfStrings that implements the queueabstraction with a fixed-size array, and then extend your implementation to use arrayresizing to remove the size restriction.
Determine if the following are true or false A "glass" queue allows an application to peek at the front or rear values of a queue. The enqueue and dequeue queue operations are inverses of each other. Therefore, performing an enqueue followed by a dequeue is always equivalent to performing a dequeue followed by an enqueue. A "glass" queue allows an application to peek at any value in a queue. A java interface can inherit from at most one other interface.
For the Queue use the java interface Queue with the ArrayDeque classFor the Stack use the java Deque interface with the ArrayDeque classFor the LinkedList, use the java LinkedList class Also, when you are asked to create and use a Queue, you can use only those methods pertaining to the general operations of a queue (Enqueue: addLast, Dequeue: removeFirst, and peek() Similarly, when you are asked to create and/or use a stack, you can use only those methods pertaining to the general operations of a Stack (push: addFirst, pop:removeFirst, and peek() ) Your code should not only do the job, but also it should be done as efficiently as possible: fast and uses no additional memory if at all possible Questions Write a method “int GetSecondMax(int[] array)” . this method takes an array of integers and returns the second max value Example: if the array contains: 7, 2, 9, 5, 4, 15, 6, 1}. It should return the value: 9
Create a new Java class in a file named "ListPQ.java" that implements the Queue interface and uses the LinkedList provided by the JCF to implement a priority queue. Note that LinkedList does not automatically order values based on priority, so it will be up to you to make sure that values are removed in priority order. You should try to implement your priority queue as efficiently as possible - basic operations should run in constant or linear time. Your priority queue need only work with integers. Do not modify any of the provided code. //This is ArrayHeap (provided code) import java.util.Arrays; public class ArrayHeap implements Heap { private int[ ] array; private int size; public ArrayHeap() { array = new int[3]; size = 0; } @Override public void add(int value) { // add pt 1 if(size == array.length) { array = Arrays.copyOf(array, size*2); } array[size] = value; // sifting up int child = size; int parent = (child - 1) / 2; while(array[parent] > array[child]) { swap(parent,…
Explain why synchronization is necessary in the following situation:You have modeled a bank as an array of BankAccountobjects. Each BankAccount object has an associated thread, which transfers money from this bank account to another, randomly selected bank account in the same bank. The amount to transfer is the same for all transactions. The threads work in parallel.
Write a complete Program in Java to implement circular queue using array for the following tasks: 1. Method to insert the new element in the circular queue 2. Method to delete an element from the circular queue 3. Method to display all the elements of the circular queue 4. Create the test class to perform the operations on circular queue in the following sequence: a. Add a new element 10 b. Add a new element 20 c. Add a new element 30 d. Add a new element 40 e. Display all elements f. Delete from the circular queue g. Delete from the circular queue h. Add a new element 50 i. Add a new element 60 j. Add a new element 70 Please screenshot of the output
Write a program in the Java language that includes: 1. A class for books, taking into account the encapsulation and getter, setter. 2. Entering books by the user using Scanner 3. LinkedList class for: (Adding a new book - Inserting a book- Searching for a book using the ISBN Number - Viewing all books,delete book). 4. Serial number increases automatically with each book that is entered. 5. Printing the names of books is as follows: Serial - ISBN - Name - PubYear - Price - Notes. 6-Design a main menu that includes: • Add Book • Insert Book • Delete Book • Search . Display . Exit
Define a class MyData that holds an instance variable x, a function to increment x by 5, and a getter to return the value of x. In a MyUtil class, define an aggregate relationship where MyUtil holds a MyData reference. MyUtil should extend Thread and provide an implementation for run that contains a for loop that iterates 100000 times calling the increment function of the myData reference. Define the main method in MyUtil that creates the instance of MyData. Define a data collection for storing MyUtil objects. In three separate for loops, (1) create and add five instances of MyUtil to the data collection previously defined. (2) Call the start function on each thread. (3) Ensure each thread completes before main completes. Print out the value of x from myData. In a brief comment, describe what is happening when you execute the program several times. Also in the comment, what keyword could be used where to prevent the issue seen?