2. Given the abstract data type (ADT) for static queue template in Queue.h belowtemplate class Queue{private:T *queueArray;int queueSize;int front;int rear;int numItems;public:Queue (int);Queue (const Queue &);-Queue () ;void enqueue (T);void dequeue (T &);void splitqueue (T &);bool isEmpty() const;bool isFull () const;void clear ();} ; (b) Write the driver program (complete main program) that add the following list ofnumbers {1, 2, 4, 5, 7, 9, 12,14,16, 21, 22, 23, 24, 25} into a queue then callssplitqueue based on the choice of splitting the value into odd or even queue.

Answered: Image /qna-images/answer/d49cd0e1-0d64-4a9b-9c8f-f4373f55ca23.jpg

(b) Write the driver program (complete main program) that add the following list of numbers {1, 2, 4, 5, 7, 9, 12,14,16, 21, 22, 23, 24, 25} into a queue then calls splitqueue based on the choice of splitting the value into odd or even queue.

(b) Write the driver program (complete main program) that add the following list of numbers {1, 2, 4, 5, 7, 9, 12,14,16, 21, 22, 23, 24, 25} into a queue then calls splitqueue based on the choice of splitting the value into odd or even queue.

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

Write an abstract data type for queues whose elements store 10-characternames. The queue elements must be dynamically allocated from theheap. Queue operations are enqueue, dequeue, and empty. Use eitherC++, Java, C#, or Ruby
Write an abstract data type for a queue whose elements can be anyprimitive type. Use Java 5.0, C# 2005, or C++.
Given the following specifications of a front operation for queue Item type front Function: Queue is not empty. Precondition: Queue is not changed. a. Write this operation as client code, using operations from the QueueType class. b. Write this function a new member function of the QueueType class.
write in c++ Define the 3 bolded functions for the Queue (circular array): class Queue { private: double array[10000]; int front, rear, numItems; public: Queue() {front = numItems = 0; rear = -1;} bool isEmpty(); bool isFull(); void enqueue(double d); int dequeue(); void dequeueMany(int n); //remove n values from the front void enqueueMany(double values[], int n); //add n values from the array}; Hints: void dequeueMany(int n) (hint 6 lines of code, no loops, if there are more than n elements in the queue, use math to re-compute front. Otherwise, make the queue empty. Don’t forget to update numItems. void enqueueMany(int values[], int n) (hint 3 lines of code, use a for loop, call another function, but make sure there’s enough room in the array first!! )
A deque (pronounced "deck") is an abstract data type that combines what a stack can do and what a queue can do. Thus, users are allowed to add items to either end of a deque and inspect/remove them from either end. Thus, a deque can act as stack or queue. Given the following ADT specification, implement the behavior of deque based on a circular array as the one discussed for an array-based implementation of the queue. Template<class T> Class Deque { Public: int size(); Boolean isEmpty(); // similar to push Void insertFirst(T e); // similar to enqueue Void insertLast(T e); // similar to dequeue T removeFirst(); // similar to pop T removeLast(); // returns the first element of deque without removing it T first(); // returns the last of deque without removing it T last(); }
Given the following specification of a front operation for queue:ItemType Front Function: Returns a copy of the front item on the queue. Precondition: Queue is not empty. Postcondition: Queue is not changed. 1. Write this operation as client code, using operations from the QueType class. (Remember,the client code has no access to the private variables of the class). 2. Write this function as a new member function of the QueType class. help me with complete code
Modify the C++ class for the abstract stack type shown belowto use a linked list representation and test it with the same code thatappears in this chapter. #include <iostream.h>class Stack {private: //** These members are visible only to other//** members and friends (see Section 11.6.4)int *stackPtr;int maxLen;int topSub;public: //** These members are visible to clientsStack() { //** A constructorstackPtr = new int [100];maxLen = 99;topSub = -1;}~Stack() {delete [] stackPtr;}; //** A destructorvoid push(int number) {if (topSub == maxLen)cerr << "Error in push--stack is full\n";else stackPtr[++topSub] = number;}void pop() {if (empty())cerr << "Error in pop--stack is empty\n";else topSub--;}int top() {if (empty())cerr << "Error in top--stack is empty\n";elsereturn (stackPtr[topSub]);}int empty() {return (topSub == -1);} }
ANSWER ASAP. C++ LANGUAGE ONLY. (NOT C, NOT JAVA, NOT C#) CPP ONLY Using the double-ended linked list C language syntax code below, convert it into C++ and use it as the base. Modify the provided program into the ff: create a new class named student_queue. and then.. Implement the following methods for the class: front() - returns the pointer to the front element of the queue back() - returns the pointer to the back element of the queue push() - allocates memory for a new node and connects it to the existing queue pop() - retrieves the oldest node in the queue, copies the data to a structure, and frees up the memory from the queue empty() - returns 1 or 0 depending on whether the queue is empty or not size() - returns the number of elements in the queue Program code: #include <stdio.h>#include <stdlib.h>typedef struct se_list_type {int num;struct se_list_type* prev;struct se_list_type* next;} se_list;int main() {// Start the listse_list* head = NULL;se_list* cur =…
Create a class Circular Queue that implements the functionality of a queue providing all therequired operations (Enqueue(), Dequeue(), Empty(), Full() and getFront()). in C++
Without using C++ queue STL, write a simple menu based selection to insert, delete, show and exit from queue. 1. Create a class called Queue with member variable queueArr as integer queue array, integer rear and integer front to keep track both rear and front element in the queue array. 2. Define several member functions in Queue such as a a. constructor – initialize both rear and front to -1b. insert – receive an integer and check if queue is full, if not then insert the integer to the queue arrayc. delete – delete front element from queue if front is not equal to rear (empty)d. display – if rear is not equal to front, then print out the queue array. 3. Write a main function to test the Queue class.
ALL TRUE OR FALSE QUESTIONS 1. A "deque" allows an application to enqueue and dequeue from both front and rear of a queue. 2. The Queue ADT of the text is defined to hold elements of type Objec 3. Java supports inheritance of interfaces. 4. The text's array-based queue implementations use the fixed-front approach. 5. If N represents the number of elements in the queue, then the dequeue method of the ArrayBoundedQueue class is O(1). 6. When an object of class LinkedQueue represents an empty queue, its rear variable is 0. 7. A standard linked list provides a good implementation of a "Deque". 8. When implementing a queue with a linked list, the front of the queue is also the front of the linked list. 9. Our LinkedQueue class implements the QueueInterface interface. 10. The text's array-based queue implementations use the floating-front approach.
Without using C++ queue STL, write a simple menu based selection to insert, delete, show and exit from queue. 1. Create a class called Queue with member variable queueArr as integer queue array, integer rear and integer front to keep track both rear and front element in the queue array.2. Define several member functions in Queue such as: a) constructor – initialize both rear and front to -1 b) insert – receive an integer and check if queue is full, if not then insert the integer to the queue array c) delete – delete front element from queue if front is not equal to rear (empty)d) display – if rear is not equal to front, then print out the queue array. 3. Write a main function to test the Queue class.