Trace the following fragment for a Stack s and an empty queue q (type Queue). Stacks First Second Third Queue a String item; while (!s.empty()) { item = s.pop(); q.offer (item); } q.offer (" hi"); } while (!q.isEmpty()) { item = q.remove() s.push (item); s.push (" there");

Trace the following fragment for a Stack s and an empty queue q (type Queue). Stacks First Second Third Queue a String item; while (!s.empty()) { item = s.pop(); q.offer (item); } q.offer (" hi"); } while (!q.isEmpty()) { item = q.remove() s.push (item); s.push (" there");

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

Make this generic, instead of a Stack of Pancake. public class Stack { private ArrayList<Pancake> plateful; public Stack() { plateful = null; } public void push (Pancake p) { Pancake newp = new Pancake (p); // copy constructor plateful.add(newp); } public Pancake pop (Pancake p) { Pancake newp = plateful.get(plateful.size()-1); plateful.remove(plateful.size()-1); return newp; } } // end of class definition
Queue q= new LinkedQueue (8); q.enqueue ("A"); q.enqueue ("B"); q.enqueue ("C"); q.enqueue ("D"); q.enqueue ("E"); q.enqueue ("F"); Stack s= new LinkedStack (8); for (int i=0; i<3; i++) { s.push (q.de queue () ); After all of this code executes, the size of the queue g is -----and the size of the stack is ------ 1, 5 3, 3 4. 2 5, 1
Given the following definition for a LinkedList: // LinkedList.h class LinkedList { public: LinkedList(); // TODO: Implement me void printEveryOther() const; private: struct Node { int data; Node* next; }; Node * head; }; // LinkedList.cpp #include "LinkedList.h" LinkedList::LinkedList() { head = nullptr; } Implement the function printEveryOther, which prints every other data value (i.e. those at the odd indices assuming 0-based indexing).
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
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; }
void do(queue<int>&q){ stack<int>temp; while(!q.empty()){temp.push(q.front()); q.pop();} while(!temp.empty(){q.push(temp.top()); temp.pop();}} After this function the queue q is a. doesn't changed b. has rubbish data c. destroyed (empty) d. reversed
Create a queue with three stacks, so that each queue operation requires a fixed (worst-case) number of stack operations. Caution: this game is quite challenging.
Computer Science Consider the code from the DeleteLast() method which removes the last element in a linked list (while also maintaining a tail pointer). public String DeleteLast() { if (head == null) return null; else if (head == tail) { String tempCargo = head.Cargo; head = null; tail = null; return tempCargo; } else { Node temp = head; while (temp.next != tail) { temp = temp.next; } String tempCargo = temp.next.Cargo; temp.next = null; tail = temp; return tempCargo; } } The code can be changed to be recursive by using a recursive method to perform the part of the code that iterates over the…
void stack:do(0{for(int i=0;i<=topindex/2;i++) {T temp=entry[i]; entry[i]=entry[topindex-i-1]; entry[topindex-1-i]=temp;}} What is this method do? O a. Doesn't do any thing O b. Replace each item with next item value O C. Swap the first item with last item O d. Reverse the stack
Implement a Single linked list to store a set of Integer numbers (no duplicate) • Instance variable• Constructor• Accessor and Update methods 2.) Define SLinkedList Classa. Instance Variables: # Node head # Node tail # int sizeb. Constructorc. Methods # int getSize() //Return the number of nodes of the list. # boolean isEmpty() //Return true if the list is empty, and false otherwise. # int getFirst() //Return the value of the first node of the list. # int getLast()/ /Return the value of the Last node of the list. # Node getHead()/ /Return the head # setHead(Node h)//Set the head # Node getTail()/ /Return the tail # setTail(Node t)//Set the tail # addFirst(E e) //add a new element to the front of the list # addLast(E e) // add new element to the end of the list # E removeFirst()//Return the value of the first node of the list # display()/ /print out values of all the nodes of the list # Node search(E key)//check if a given…
What does the following function do?void mystery(queueType<int>& q){stackType<int> s;while (!q.isEmptyQueue()){s.push(q.front());q.deleteQueue();}while (!s.isEmptyStack()){q.addQueue(2 * s.top());s.pop();}}
please fix code to match "enter patients name in lbs" thank you import java.util.LinkedList;import java.util.Queue;import java.util.Scanner; interface Patient { public String displayBMICategory(double bmi); public String displayInsuranceCategory(double bmi);} public class BMI implements Patient { public static void main(String[] args) { /* * local variable for saving the patient information */ double weight = 0; String birthDate = "", name = ""; int height = 0; Scanner scan = new Scanner(System.in); String cont = ""; Queue<String> patients = new LinkedList<>(); // do while loop for keep running program till user not entered q do { System.out.print("Press Y for continue (Press q for exit!) "); cont = scan.nextLine(); if (cont.equalsIgnoreCase("q")) { System.out.println("Thank you for using BMI calculator"); break;…