4) Consider the following Queue class that uses linked list to constract a Queae class Node; typedef Node NodePtr; class Node public: int number; NodePtr next; Node({number =0; next NULL;} Node(int n){number=n; next-NULL;} 11- class Queue private: NodePtr top; int currSize; const int fullSize; public: I/ initializes the Queue to an empty Queue (fixed size of 5) Queue () fullSize = 5; currsize =0; top = NULL; I/ initializes the Queue to an empty Queue and specific maximum size Queue (int maxSize) fullSize = maxSize; currsize =0; top NULL; Palke? int enqueue (int item); // places an item into the Queue. Returns-1 if operation is soE saccessfal int dequeue (int& item); // removes an item from the Queue. Returns-1 if operation is not succesfist bool empty0; bool full(); Il checks if the Queue is empty Il checks if the Queue is full Note: Please answer the question on the next page

4) Consider the following Queue class that uses linked list to constract a Queae class Node; typedef Node NodePtr; class Node public: int number; NodePtr next; Node({number =0; next NULL;} Node(int n){number=n; next-NULL;} 11- class Queue private: NodePtr top; int currSize; const int fullSize; public: I/ initializes the Queue to an empty Queue (fixed size of 5) Queue () fullSize = 5; currsize =0; top = NULL; I/ initializes the Queue to an empty Queue and specific maximum size Queue (int maxSize) fullSize = maxSize; currsize =0; top NULL; Palke? int enqueue (int item); // places an item into the Queue. Returns-1 if operation is soE saccessfal int dequeue (int& item); // removes an item from the Queue. Returns-1 if operation is not succesfist bool empty0; bool full(); Il checks if the Queue is empty Il checks if the Queue is full Note: Please answer the question on the next page

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

X1222: Double Ended Queue: Deque A double ended queue, known as deque, is a queue data structure that allows adding and removing elements from both ends of the queue. Instead of enqueue and dequeue, it has insert, delete, and get for both front and last of the queue as shown below. The data stored internally is stored in a ListNodesPlus object. The basic class definition is shown below: public class Deque { private ListNodePlus elements; // code ommitted for space public void clear() {...}; public int numElements () {...}; public boolean isEmpty() {...}; ● // Implement the following four methods public void insertFront (E it) { } public E deleteFront () { } public void insertLast (E it) { } public E deleteLast() { } Write the following four methods: • insertFront (E it) takes it and adds it to the front of the queue. stored internally in elements. The front of the queue is defined as position 0 in the queue. ● deleteFront () removes the element at the front of the queue and returns it.…
7. ASK class DoublyLinkedList<E> {// define ListNode elements specific for this type of list, indicating current, previous and next// consider head as name for previous node, and tail for the next one.private ListNode<E> head;private ListNode<E> current;private ListNode<E> tail; // default constructorpublic DoublyLinkedList(){//*** Task #1: implement a default constructor here, initializing the nodes to null } // method that calculates the length of the listpublic int length(){//*** Task #2: implement the method navigating through the list until you run out of elements } // method that adds a node at the beginning of the listpublic void addANodeToStart(E addData){//*** Task #3: implement this method, taking into consideration that the head will be replaced by a new node. You may want to use a temporary variable } // accessor method that gets data at current nodepublic E getDataAtCurrent(){//*** Task #4: implement this method making sure to take into account…
java programing Design an inventory class that stores the following members serialNum: an integer that holds a part’s serial number manufactDate: a member that holds the date the part was manufactured lotNum: an integer that holds the part’s lot number The class should have appropriate member functions (interfaces) for storing data into, and retrieving data from, these members. Then, design a program that uses the queue class. The type of the queue should be the above inventory. The program should have a loop that asks the user whether he or she wishes to add a part to inventory or take a part from inventory. The loop should repeat until the user is finished. If the user wishes to add a part to inventory, the program should ask for the serial number, date of manufacture, and lot number. The information should be stored in an inventory object using inventory interfaces and added into the inventory queue. If the user wishes to take a part from inventory, the program should remove the…
#include <iostream> usingnamespace std; class Queue { int size; int* queue; public: Queue(){ size = 0; queue = new int[100]; } void add(int data){ queue[size]= data; size++; } void remove(){ if(size ==0){ cout <<"Queue is empty"<<endl; return; } else{ for(int i =0; i < size -1; i++){ queue[i]= queue[i +1]; } size--; } } void print(){ if(size ==0){ cout <<"Queue is empty"<<endl; return; } for(int i =0; i < size; i++){ cout<<queue[i]<<" <- "; } cout << endl; } //your code goes here }; int main(){ Queue q1; q1.add(42); q1.add(2); q1.add(8); q1.add(1); Queue q2; q2.add(3); q2.add(66); q2.add(128); q2.add(5); Queue q3 = q1+q2; q3.print();…
complete all the implementation of the member functions listed in the class interface for the following header file. #ifndef _LINKEDSTACK#define _LINKEDSTACK #includeusing namespace std;templateclass LinkedStack{private:Node *top; Node *getCurrentTop() { return top; }public: Stack(); bool isEmpty(); bool push(ItemType newItem); bool pop(); ItemType peek(); void clean(); bool display();};#endif
1.Assume some Node class with info link fields . Complete this method in class List that returns a reference to the node containing the data item in the argument findThis, Assume that findThis is in the list public class list { protected Node head ; Protected int size ; Public Node find (char find this) { Node curr = head; while(curr != null) { if(curr.info == findThis) return curr; curr = curr.link; } return -1; } }
#include <iostream>using namespace std; class Queue { int *queue, size, front, rear;public: Queue(int size) { queue = new int[size]; this -> size = size; front = rear = -1; } ~Queue() { delete[] queue; } void push(int val) { if (rear == -1) { queue[++rear] = val; front++; } else { if (rear == ((front - 1) % size)) throw "Queue Full!";     if (rear == size - 1) rear = -1; queue[++rear] = val;     } } int pop() { if (front == -1) throw "Queue Empty!";     int ret = queue[front]; front = (front + 1) % size;…
/** * This class will use Nodes to form a linked list. It implements the LIFO * (Last In First Out) methodology to reverse the input string. * **/ public class LLStack {     private Node head;     // Constructor with no parameters for outer class public LLStack( ) { // to do }     // This is an inner class specifically utilized for LLStack class, // thus no setter or getters are needed private class Node { private Object data; private Node next;    // Constructor with no parameters for inner class public Node(){ // to do // to do } // Parametrized constructor for inner class public Node (Object newData, Node nextLink) { // to do: Data part of Node is an Object // to do: Link to next node is a type Node } }     // Adds a node as the first node element at the start of the list with the specified…
class Queue { private static int front, rear, capacity; private static int queue[]; Queue(int c) { front = rear = 0; capacity = c; queue = new int[capacity]; } static void queueEnqueue(int data) { if (capacity == rear) { System.out.printf("\nQueue is full\n"); return; }     else { queue[rear] = data; rear++; } return; } static void queueDequeue() {    if (front == rear) { System.out.printf("\nQueue is empty\n"); return; } else { for (int i = 0; i < rear - 1; i++) { queue[i] = queue[i + 1]; }    if (rear < capacity) queue[rear] = 0;    rear--; } return; }   static void queueDisplay() { int i; if (front == rear) { System.out.printf("\nQueue is Empty\n"); return; }     for (i = front; i < rear; i++) { System.out.printf(" %d <-- ", queue[i]); } return; }   static void queueFront() { if (front == rear) { System.out.printf("\nQueue is Empty\n"); return; } System.out.printf("\nFront Element is: %d", queue[front]);…
1 Implement a Queue Data Structure specifically to store integer data using a Singly Linked List. 2 The data members should be private. 3 You need to implement the following public functions: 4 1. Constructor: 5 It initialises the data members as required. 6 7 8 2. enqueue(data) : This function should take one argument of type integer. It enqueues the element into the queue and returns nothing. 3. dequeue(): It dequeues/removes the element from the front of the queue and in turn, returns the element being dequeued or removed. In case the queue is empty, it r 4. front (): 10 11 It returns the element being kept at the front of the queue. In case the queue is empty, it returns -1. 12 5. getSize(): 13 It returns the size of the queue at any given instance of time. 14 6. 1sEmpty(): 15 It returns a boolean value indicating whether the queue is empty or not. 16 Operations Performed on the Stack: 17 Query-1 (Denoted by an integer 1): Enqueues an integer data to the queue. 18 19 Query-2…
Q5) Consider the following implementation of double linked list class. public class DLIST { static class Node{ private E data, Node next, Nodeprev; private Node(E dataItem, Node nextnode, Node prevnode){ // constructor data = dataltem; next = nextnode; prev = prevnode } private Node(E dataItem) { l/constructor data = dataltem; next = null; prev=null; } } private Node head=null; private Node tail=null; //initialisation } a) Write a Java method that prints 1%, 3rd, 5th_ etc. nodes in the double linked list. b) Write a java method to display the double linked list in the reverse order.
template <class T> class List; template <class T> class Node{ friend class List<T>; private: T data; Node* link; }; template <class T> class List{ public: List(){first = 0;} void InsertBack(const T& e); void Concatenate(List<T>& b); void Reverse(); class Iterator{ …. }; Iterator Begin(); Iterator End(); private: Node* first; }; I need algorithm , I think it may use iterator to complile. The question shows on below photo.