Ássume the Queue is initially empty. class Queue ( public: int size () ; bool empty (); chará front () throw (Exception); void enqueue (char& e); void dequeue () throw (Exception); } ; Function call Output Queue Contents (back -> front) enqueue ('A') enqueue ('B') front () size ( ) dequeue () enqueue ('C') empty( ) dequeue () size( ) dequeue ( ) empty ( ) front ( ) enqueue ('D') front ( ) dequeue () dequeue ()

Ássume the Queue is initially empty. class Queue ( public: int size () ; bool empty (); chará front () throw (Exception); void enqueue (char& e); void dequeue () throw (Exception); } ; Function call Output Queue Contents (back -> front) enqueue ('A') enqueue ('B') front () size ( ) dequeue () enqueue ('C') empty( ) dequeue () size( ) dequeue ( ) empty ( ) front ( ) enqueue ('D') front ( ) dequeue () dequeue ()

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

class Queue { private static int front, rear, capacity; private static int queue[]; Queue(int size) { front = rear = 0; capacity = size; queue = new int[capacity]; } // insert an element into the queue static void queueEnqueue(int item) { // check if the queue is full if (capacity == rear) { System.out.printf("\nQueue is full\n"); return; } // insert element at the rear else { queue[rear] = item; rear++; } return; } //remove an element from the queue static void queueDequeue() { // check if queue is empty if (front == rear) { System.out.printf("\nQueue is empty\n"); return; } // shift elements to the right by one place uptil rear else {…
Find the error in each of the following code segments // A linked implementation of a queue int dequeue() { if(empty()) throw new EmptyQueueException(); int value = front.value; front ++; return value; }
In a queue implementation using array of size 5, the array index starts with 0 where head and tail values are 3 and 4 respectively. Determine the array index at which the insertion of the next element will take place. 0 5 1 2
QueueArray.java This file implements QueueInterface.java This file has * attributes of an array holding queue elements. An integer represents front * index, an integer for rear index, and an integer to keep track number of * elements in the queue. An overloaded constructor accepts an integer for * initializing the queue size, e.g. array size. An enqueue method receives an * object and place the object into the queue. The enqueue method will throw * exception with message "Overflow" when the queue is full. A dequeue method * returns and removes an object from front of the queue. The dequeue method * will throw exception with message "Underflow" when the queue is empty. A size * method returns number of elements in the queue. A toString method returns a * String showing size and all elements in the queue.
In C++, Write a program which is menudriven ( i) Enque, ii) Deque, iii) Peek iv) Print). It will create a circularQueue of integer type data using array. You have to implement the followingoperations.a. Enqueue (Insert a data to the queue)b. Dequeue (Remove an item from the queue and printit)c. Peek (Print the item at the Front)Print (Print the elements present at the queue)
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.
package queuedemo; class Queue { int front, rear, size; int capacity; int array[]; public Queue(int cap) { capacity = cap; front=size=0; rear=capacity-1; array = new int[capacity]; } // Method to add an item to the queue. void enqueue(int item) { if(isFull()) { System.out.println("Queue overflow"); return; } rear=(rear+1)%capacity; array[rear]=item; size=size+1; } // Queue is empty when size is 0 boolean isEmpty() { return (size == 0); } // Queue is full when size becomes equal to the capacity boolean isFull() { return (size == capacity); } // Method to remove an item from queue. int dequeue() { if (isEmpty()) System.out.println("Queue Underflow"); return; } int item = array[front]; front = (front + 1)% this.capacity;…
In the lecture we studied IntStack, a class that implements a static stack of integers. Write a template that will create a static stack of any data type. Demonstrate the class with a driver program. #pragma once class IntStack{private: int *stackArray; int stackSize; int top; public: IntStack(int size); void push(int num); void pop(int &num); bool isFull(); bool isEmpty();}; Queue Exceptions: Modify the static queue class provided in our lecture as follows. Make the isFull and isEmpty member functions private. Deﬁne a queue overﬂow exception and modify enqueue so that it throws this exception when the queue runs out of space. Deﬁne a queue underﬂow exception and modify dequeue so that it throws this exception when the queue is empty. Rewrite the main program so that it catches overﬂow exceptions when they occur. The exception handler for queue overﬂow should print an appropriate error message and then terminate the program. #include…
Code in java please import java.util.*;public class QueueLastname //<------ change the name of the class to include yourlast name{// no code goes here}class Queue{private ArrayList<String> q;public Queue( ){q = new ArrayList<String>();}public void enqueue(String num){q.add(num);}public String dequeue(){return q.remove(0);}/*This method goes through the quque and finds the longest name in the qThe queue must be restored in its original state after finding the longestname*/public String getLongestName(){Stack s = new Stack();String longest = q.get(0);// q.remove(0);boolean b = false;while(!b){try{String front = q.get(0);//get the first elementq.remove(0);//remove it from the qs.push(front);// push it to the stackif (front.length() > longest.length() )longest = front;}catch(Exception e){b = true;}}restore(s); // restoring the queuereturn longest; }/*Traverse through the queue and creates a string containing all the names.must restore the quque to its original…
A data structure called a deque is closely related to a queue. The name deque stands for “double-ended queue.” The difference between the two is that with a deque, you can insert, remove, or view from either end of the queue. Implement a deque using arrays
in java A queue q stores int values. Show what q will look like after each of the following instructions is executed. Show elements from front to rear of the queue. E.g., If you show it as (a,b,c) a is in the font, c in the rear of the queue. q.enqueue(13); q.enqueue(6); q.enqueue(12); q.dequeue(); q.dequeue(); q.enqueue(15); q.enqueue(46); q.dequeue(); q.enqueue(13); q.enqueue(30);
Answer it fast and correct. Don't stuck. i ll rate Fill in the underlines below to complete a function template, reverseStack, that takes as a parameter a stack object and uses a queue object to reverse the elements of the stack. C++ code Answer: template <class Type> void reverseStack(stackType<Type> &s) { linkedQueueType<Type> q; Type elem; while (_________________) // The stack is not empty. { // Copy the top element of the stack into the queue //and remove it from the stack. elem = _________________; _________________; _________________; } while (_________________) // The queue is not empty. { // Copy the front element of the queue into the stack //and remove it from the queue. elem = _________________; _________________; _________________; } }