1. Define a stack in terms of a queue, that is; create a class class StackQ ( Queue pool - new Queue(); public void push(Object el) { pool.enqueue (el); Define a queue in terms of a stack. (a) Define a class StackQ, which uses one or more queues to implement a stack. Write a main class that tests this class also. (b) Define a class QueueS, which uses one or more stacks to implement a queue. Write a main class that tests this class also.

1. Define a stack in terms of a queue, that is; create a class class StackQ ( Queue pool - new Queue(); public void push(Object el) { pool.enqueue (el); Define a queue in terms of a stack. (a) Define a class StackQ, which uses one or more queues to implement a stack. Write a main class that tests this class also. (b) Define a class QueueS, which uses one or more stacks to implement a queue. Write a main class that tests this class also.

Database System Concepts

7th Edition

ISBN:9780078022159

Author:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Publisher:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Chapter1: Introduction

Section: Chapter Questions

Problem 1PE

See similar textbooks

Similar questions

Problem Description: 1. Suppose that we want to add a method to a class of queues that will splice two queues together. This method adds to the end of a queue all items that are in a second queue. The header of the method could be as follows: public void splice (QueueInterface anotherQueue) Write this method in such a way that it will work in any class that implements QueueInterface.
please convert this into c++ import java.util.Iterator;import java.util.NoSuchElementException; public class Queue<Item> implements Iterable<Item> { private int n; // number of elements on queue private Node first; // beginning of queue private Node last; // end of queue // helper linked list class private class Node { private Item item; private Node next; } /** * Initializes an empty queue. */ public Queue() { first = null; last = null; n = 0; } /** * Returns true if this queue is empty. * * @return {@code true} if this queue is empty; {@code false} otherwise */ public boolean isEmpty() { return first == null; } /** * Returns the number of items in this queue. * * @return the number of items in this queue */ public int size() { return n; } /** * Returns the number of items in this queue. * * @return the…
Please use Python for this question: Question 1. Inheritance: You MUST use inheritance for this problem. A stack is a sequence container type that, like a queue, supports very restrictive access methods: all insertions and removals are from one end of the stack, typically referred to as the top of the stack. A stack is often referred to as a last-in first-out (LIFO) container because the last item inserted is the first removed. Implement a Stack class using inheritance. inherit the following methods below: a. Constructor/_init__ - Can construct either an empty stack, or initialized with a list of items, the first item is at the bottom, the last is at the top. b. push() - take an item as input and push it on the top of the stack c. pop() - remove and return the item at the top of the stack d. isEmpty() - returns True if the stack is empty, False otherwise e. [] - return the item at a given location, [0] is at the bottom of the stack f. len() - return length of…
Define a stack class called DLStack, in such a way that it can store any type of data. All data in a DLStack must be stored in a DoublyLinkedList instance. Implement the following member methods: push – Pushes a new element into the stack. pop – Removes the top element from the stack. top – Retrieves the top element from the stack. IsEmpty – Returns true if the stack is empty, and false otherwise. Note: These operations should add or remove the element from the head of the DoublyLinkedList instance. Q1) Implement the following non-member function which reverses a given string. String reversal must be done using stack-based logic. void ReverseString(string &); Q2) Implement the following function which determines whether a given string is the reverse of the second one; for example “test string” is the reverse of “gnirts tset”. Reverse detection must be done using stack-based logic. bool IsReverse(const string &, const string &);…
Add the following operation to the Class StackClass: void reverseStack(StackClass<T> otherStack); This operation copies the elements of a stack in reverse order onto another stack. Consider the following statements: StackClass<T> stack1; StackClass<T> stack2; The statement stack1.reverseStack(stack2); copies the elements of stack1 onto stack2 in the reverse order. That is, the top element of stack1 is the bottom element of stack2, and so on. The old contents of stack2 are destroyed and stack1 is unchanged. Write the definition of the method to implement the operation reverseStack. Also write a program to test the method reverseStack. In StackClass.java, please finish method - public void reverseStack(StackClass<T> otherStack) and testing main program public class Problem53{public static void main(String[] args){StackClass<Integer> intStack = new StackClass<Integer>();StackClass<Integer> tempStack = new StackClass<Integer>(); //Please…
Add the following operation to the Class StackClass: void reverseStack(StackClass<T> otherStack); This operation copies the elements of a stack in reverse order onto another stack. Consider the following statements: StackClass<T> stack1; StackClass<T> stack2; The statement stack1.reverseStack(stack2); copies the elements of stack1 onto stack2 in the reverse order. That is, the top element of stack1 is the bottom element of stack2, and so on. The old contents of stack2 are destroyed and stack1 is unchanged. Write the definition of the method to implement the operation reverseStack. Also write a program to test the method reverseStack. In StackClass.java, please finish method - public void reverseStack(StackClass<T> otherStack) and testing main program – Problem53.java. Note: java programming, please use given outline code public class Problem53{ publicstaticvoidmain(String[] args){ StackClass<Integer> intStack = newStackClass<Integer>();…
Design a class named Queue for storing integers. Like a stack, a queue holds elements. In a stack, the elements are retreived in a last-in-first-out fashion. In a queue, the elements are retrieved in a first-in-first-out fashion. The class contains: An int[] data field named elements that stores the int values in the queue A data field named size that stores the number of elements in the queue A constructor that creates a Queue object with defult capacity 8 The method enqueue(int v) that adds v into the queue The method empty () that returns true if the queue is empty The method getSize() that returns the size of the queue
Assignment 05 PART 1 Queues - Note Part 1 is a separate deliverable: Write a class with a main method that uses a priority queue to store a list of prioritized chores. This is all the information that is provided. The rest is up to you. You may decide how to store your chores and how to store your priorities. YOU MUST WRITE your own Queue class – do not use the Java Library, Queue Class.
Problem 2: Assume that the methods push(), pop() and isEmpty() methods are defined as they should be in a Stack class. Assume further that the Stack class has a no argument constructor. Write a method that uses the constructor and the methods push(), pop() and isEmpty() for removing and returning the bottom element of a given stack. Note: make sure that you don't include unnecessary spaces in your answers! public T popBottom(Stack stack) { Stack tempStack = new Stack(); Tx = null; if (!stack.isEmpty()) { x = stack.pop(); } while (!stack.isEmpty()) { #04 ; x = stack.pop(); } while (!tempStack.isEmpty()) { #05 ; } return x; }
Design a class namedQueue for storing integers. Like a stack, a queue holds elements. In a stack, theelements are retrieved in a last-in first-out fashion. In a queue, the elements areretrieved in a first-in first-out fashion. The class contains:■■ An int[] data field named elements that stores the int values in the queue.■■ A data field named size that stores the number of elements in the queue.■■ A constructor that creates a Queue object with default capacity 8.■■ The method enqueue(int v) that adds v into the queue. ■■ The method dequeue() that removes and returns the element from thequeue.■■ The method empty() that returns true if the queue is empty.■■ The method getSize() that returns the size of the queue.Draw an UML diagram for the class. Implement the class with the initial arraysize set to 8. The array size will be doubled once the number of the elementsexceeds the size. After an element is removed from the beginning of the array,you need to shift all elements in the array one…
Consider the following class: 1. public class Example 2. { 3. public void addPair(String a, String b) 4. { 5. ArrayList<String> list = new ArrayList<>(); 6. 7. list.add(a); 8. list.add(b); 9 . 10. //Stack and Heap at this point 11. } 12. } Draw the Stack and Heap Diagram at the indicated point, after the call addPair("Lugano","Zurich") for a previously created object of type Example.
JavaWrite a program that implements the methods of a list using the operations of each ADT. Making use of Inheritance and Polymorphism. Create the stack (STACK) and queue (QUEUE) derived classes and implement their methods as indicated in the book.In the main program place a main menu with three options 1. List, 2. Stack and 3. Queue and in each option show the use of the operations of each ADT