Assume you have a stack and a queue implemented using an array of size 4. show...

Assume you have a stack and a queue implemented using an array of size 4. show the content of the array for the stack (then the queue) for the following operations: (for the queue replace push by add and pop by remove; keep in mind that the queue uses a circular array): push(-3), push(-5), push(-9), push(-10), pop(), pop(), push(-13), pop(), push( -15), push(-17).

java code

Expert Solution

Please find the answer below.
Please do comments in case of any issue. Also, don't forget to rate the question. Thank You So Much.

push(-3) stack would be -3
push(-5) stack would be -3 -5
push(-9) stack would be -3 -5 -9
push(-10) stack would be -3 -5 -9 -10
pop() stack would be -3 -5 -9
pop() stack would be -3 -5
push(-13) stack would be -3 -5 -13
pop() stack would be -3 -5
push( -15) stack would be -3 -5 -15
push(-17). stack would be -3 -5 -15 -17

Hence stack would be like below from top to bottom

-17
-15
-5
-3

add(-3) queue would be -3
add(-5) queue would be -3 -5
add(-9) queue would be -3 -5 -9
add(-10) queue would be -3 -5 -9 -10
remove() queue would be -5 -9 -10
remove() queue would be -9 -10
add(-13) queue would be -9 -10 -13
remove() queue would be -10 -13
add( -15) queue would be -10 -13 -15
add(-17). queue would be -10 -13 -15 -17

Hence queue would be like below from head to tail

-10
-13
-15
-17

venereology answered 1 year ago

Implement a stack using a single queue. In particular, you are given a queue Q that...

Implement a stack using a single queue. In particular, you are given a queue Q that provides the method Q.size() to return its size at any point and the standard methods of queues (i.e, Q.enqueue(x) and Q.dequeue()). The requirement is to use such methods of Q to implement two methods S.push(x) and S.pop() for a stack S. What are the running times of your methods? Kindly answer using python programming

Implement a Priority Queue (PQ) using an UNSORTED LIST. Use an array size of 10 elements....

Implement a Priority Queue (PQ) using an UNSORTED LIST. Use an array size of 10 elements. Use a circular array: Next index after last index is 0. Add the new node to next available index in the array. When you add an element, add 1 to index (hit max index, go to index 0). Test if array in full before you add. When you remove an element, from the list, move the following elements to the left to fill in...

In this lab, using C++, you will create two data structures: a stack and a queue....

In this lab, using C++, you will create two data structures: a stack and a queue. You will use STL containers to demonstrate basic ADTs. Queue For the queue, you will simulate a buffer. Remember it is first-in-first-out. The user will enter a number for the number of rounds to run your simulation. You need one function that randomly generates a number. You will also have a user specified percentage, and the function uses this percentage to randomly put the...

Discuss the relative efficiency of the enqueue and dequeue operations for an array-based queue implemented with...

Discuss the relative efficiency of the enqueue and dequeue operations for an array-based queue implemented with a fixed-front approach as opposed to a floating-front approach.

in C++ For this program, you are going to implement a stack using an array and...

in C++ For this program, you are going to implement a stack using an array and dynamic memory allocation. A stack is a special type of data structure that takes in values (in our case integers) one at a time and processes them in a special order. Specifically, a stack is what's called a first-in-last-out (FILO) data structure. That is to say, the first integer inserted into the stack is the last value to be processed. The last value in...

You will design a program to keep track of a restaurants waitlist using a queue implemented...

You will design a program to keep track of a restaurants waitlist using a queue implemented with a linked list. Make sure to read pages 1215-1217 and 1227-1251 1. Create a class named waitList that can store a name and number of guests. Use constructors to automatically initialize the member variables. 2. Add the following operations to your program: a. Return the first person in the queue b. Return the last person in the queue c. Add a person to...

C++ Data Structures: Implement a Stack and a Queue using Linked list In this lab you...

C++ Data Structures: Implement a Stack and a Queue using Linked list In this lab you will implement the functionality of a stack and a queue using a linked list. Your program must use of the declaration of the Stack and Queue class in Stack.h and Queue.h You have to implement the functionalities of queue (enq, deq, displayQueue) in a file called Queue.cpp. All the functions in Queue.cpp should follow the prototypes declared in Queue.h. Your code should make use...

Are you able to implement a stack using just one queue? If yes, please provide the...

Are you able to implement a stack using just one queue? If yes, please provide the pop(only) algorithm to simulate the stack operations with just one queue. If yes, please provide the pop(only) algorithm to simulate the stack operations with just one queue. If no, explain.

In Java or C++, implement a stack and a queue using a linkedlist data structure. You may...

In Java or C++, implement a stack and a queue using a linkedlist data structure. You may not use any standard Java or C++ libraries. Assume your data structure only allows Strings. Implement the following operations for the data structure: Queue: enqueue, dequeue, create, isEmpty (10 points) Stack: push, pop, create, isEmpty (10 points) Here is a link to get started on transferring from Java to C++ http://www.horstmann.com/ccj2/ccjapp3.html (Links to an external site.) Upload a zip file with one implementation for...

Requirements Both the stack and queue were implemented correctly according data structure and java standard practices....

Requirements Both the stack and queue were implemented correctly according data structure and java standard practices. The stack was used to implement a post-fix calculator using push, pop, peek and other stack concepts. The queue was used to implement the palindrome using add, remove, insert and other queue concepts. Both implementations produced the expected output. All submission requirements were followed. Test Harness for the first part: public class StackCalcTest { public static void main(String[] args) { StackCalc stackCalc = new...

Question