A method “firstToLast()” Program plan: In a file “CircularArrayQueue.java”, import necessary package, and create a class “CircularArrayQueue”, Declare the necessary array. Declare the necessary variables. Define the constructor to create the empty queue. Define the method “empty()” to check whether the queue is empty. Define the method “add()” to insert the element at rear end of the queue, Call the method “growBufferIfNecessary()”. Increment the size. Assign the new element to the rear of the queue. Update the rear value. Define the method “remove()” to remove the element from front end of the queue, Check whether the current size is “0”, Throw an exception. Declare and initialize the object. Update the front value. Decrement the size. Return the object properties. Define the method “growBufferIfNecessary()”, Check the condition, If it is true, create an object for “Object”. Create a loop, Fill the object array. Assign the new buffer. Set the front of the queue to “0”. Set the value of the rear of the queue. Define the method “firstToLast()” to move the head of the queue to the tail of the queue, Check whether the size is greater than “0”, Assign the value obtained from “remove()”. Call the method “add()”. In a file “QueueTest.java”, create a class “QueueTest”, Define the “main()” method. Create “CircularArrayQueue” object. Add the element “Jerry” to the rear end of the queue. Add the element “Daniel” to the rear end of the queue. Add the element “John” to the rear end of the queue. Call the method “firstToLast()”. Execute loop till queue becomes empty, Print the element removed from the queue. Print new line. Print the expected output.

Question

Want to see the full answer?

Answer 1

Question

Chapter 16, Problem 15PE

Program Plan Intro

A method “firstToLast()”

Program plan:

In a file “CircularArrayQueue.java”, import necessary package, and create a class “CircularArrayQueue”,

Declare the necessary array.

Declare the necessary variables.

Define the constructor to create the empty queue.

Define the method “empty()” to check whether the queue is empty.

Define the method “add()” to insert the element at rear end of the queue,

Call the method “growBufferIfNecessary()”.

Increment the size.

Assign the new element to the rear of the queue.

Update the rear value.

Define the method “remove()” to remove the element from front end of the queue,

Check whether the current size is “0”,

Throw an exception.

Declare and initialize the object.

Update the front value.

Decrement the size.

Return the object properties.

Define the method “growBufferIfNecessary()”,

Check the condition,

If it is true, create an object for “Object”.

Create a loop,

Fill the object array.

Assign the new buffer.

Set the front of the queue to “0”.

Set the value of the rear of the queue.

Define the method “firstToLast()” to move the head of the queue to the tail of the queue,

Check whether the size is greater than “0”,

Assign the value obtained from “remove()”.

Call the method “add()”.

In a file “QueueTest.java”, create a class “QueueTest”,

Define the “main()” method.

Create “CircularArrayQueue” object.

Add the element “Jerry” to the rear end of the queue.

Add the element “Daniel” to the rear end of the queue.

Add the element “John” to the rear end of the queue.

Call the method “firstToLast()”.

Execute loop till queue becomes empty,

Print the element removed from the queue.

Print new line.

Print the expected output.

Expert Solution & Answer

Want to see the full answer?

Check out a sample textbook solution

See solution

Students have asked these similar questions

Good mrng, please solve this trying to follow this criteria. (use Keil) Abstract describing the requirements and goals of the assignment. List file with no errors or warnings. Brief description of your implementation design and code. Debugging screen shots for different scenarios with your reference and comments. Conclusion (and please give me the code without errors, make sure it is working)

#include <stdio.h> #include <stdlib.h> #include <unistd.h> int global_var = 42; // int* function(int *a) { int local_var = 10; // *a = *a + local_var; int *local_pointer = (int *)malloc (size of (int) * 64); // Allocated array with 64 integers return local_pinter; } int main() { int local_main[1024*1024*1024*1024*1024] = {0}; // initialize an array and set all items as 0 int *heap_var = (int *)malloc(size of(int) * 16); // Allocated array with 16 integers *heap_var = 100; function(heap_var); printf(“the value is %d\n”, *heap_var); free(heap_var); // release the memory return 0; } 1) draw the memory layout of the created process, which should include text, data, heap and stack [2 marks]. 2) Indicate which section the variables are allocated [2 marks]: global_var local_var, local_pointer local_main heap_var, *heap_var (the data that it points to) 3) Does this code have memory leaking (heap memory is not released)? [2 marks] 4) The…

8. List three HDD scheduling algorithms. [2 marks] 9. True or False? The NVM has the same scheduling algorithms with HDD. Explain why? [2 marks] 10. Why the modern mouses use polling to detect movements instead of interrupts? [2 marks] 11. What is thrashing? How does it happen? [2 marks] 12. Given a reference string of page numbers 7, 0, 1, 2, 0, 3, 0, 4, 2, 3, 0, 3, 0, 3, 2, 1, 2, 0, 1, 7, 0, 1 and 4 frames show how the page replacement algorithms work, and how many page faults? [6 marks], 1) FIFO algorithm? [2 marks] 2) Optimal algorithm? [2 marks] 3) LRU algorithm? [2 marks] 13. List at least three file systems that you know. [2 marks] 14. In C programming, how the seek to a specific position in the file by offset? [2 marks]