This is a practice of Queue construction and operations. Use C++ class implement

Question

This is a practice of Queue construction and operations. Use C++ class implement and integer Queue and related functions/methods/operations, including enQueue, deOueue, isEmgty, isFuII, etc. Given a polynomial function f(x) with only integer coefficients and maximal 6 consecutive terms (e.g .f(x) = 1 + 2x + 3x2 + 4x3 + 5x4 + 6x5). Write a C++ program to store all the coefficients in a Queue in ascending exponential order (by creating an int array, say queue [MAX], with MAX = 6. for storing the 6 coefficients). (a) Your program should accept user inputs for those integer coefficients term by term, and compute f(x) by replacing x with a user input value. Next, remove the first m terms (m must be

Explanation / Answer

#include #includeusing namespace std;#define SIZE 6struct val{int c,e;}queue;class QueueClass {struct val queue[SIZE]; int head, tail; public:QueueClass(); int isFull();int isEmpty();int f(int);void print();void enq(struct val); struct val deq(); };QueueClass::QueueClass(){head = tail = -1;}int QueueClass::isFull(){if(tail !=-1)if(tail+1==head || (tail+1==SIZE && head==0)) {cout

Related Questions

Navigate

• Browse (All)
• Browse T
• Subjects

---

---

Integrity-first tutoring: explanations and feedback only — we do not complete graded work. Learn more.