Question

You have to use a h file for class definitions and two (as specified below) cpp file for the C++ implementation. You have to generate the list from scratch and check for overflow I will be giving extra points (up to 2 points this time) to students that exceed the requirements posed in the assignments. For example, extensive testing, checking for exceptions, and usable user interface. Please submit enough screenshots showing compiling and execution under Linux. Write a main program that uses the list based queue class (defined below) to check if an input string is of the form a^n b^n a^n, meaning n times the character 'a' followed by n times the charter 'b', followed by n times the character 'a'. For example, consider: 'aaaabbbbaaaa' vs. 'aaabbbbaa' or 'abaabbab' You should modularize your program using: AnBnAn.cpp, LQ.cpp and LQ.h. The program should use the following algorithm: 1. Scan the string from left to right until reaching the NULL terminator. 2. If you reach any character that is different than 'a' or 'b' then the string is invalid 3. If the string does not start with an 'a' then the string is invalid 4. Next, for every occurrence of the character 'a' insert the character b' to the queue. 5. Once you reach the first 'b' character in the string do: for each 'b' in the string remove a 'b' from the queue and insert an 'a' to the queue. Finally, once you reach the first 'a' character in the string remove an 'a' character from the queue for every 'a' character encountered. If (5) cannot be followed (e.g., an 'a' is encountered within a 'b' characters the string is considered invalid. 6. The string is valid if upon reaching the NULL character the queue is empty and no overflow or underflow has accrued. Write a class LLQ that implements a Queue in linked a list of characters. The class should include the following "utilities": 1. A constructor and a destructor 2. At least one inline getter and one inline setter for private members 3. An insert function that gets a character value and inserts it at the "end" of the queue 4. A remove function that gets the value of the "first" queue element and stores it in a character variable 5. A Boolean function 'is_full' that returns true if the queue is "full" (otherwise it returns false). This function should be called before inserting items to the queue. 6. A Boolean function 'is_empty' that returns true if the queue is "empty" (otherwise it returns false). This function should be called before removing items from the queue

Answer 1

AnBnAn.cpp
---------------------------------------------------------
#include "LQ.h"
#include <iostream>
#include <string>

using namespace std;

int main()
{

    LLQ queue;

    int userOption = -1;
    string test = "aaaabbbbaaaa";
    int stringLength = test.length();

    for (int i = 0; i < stringLength; i++) //placing the string character into a linked list
    {
        queue.createList(test[i]);
    }

    while (userOption != NULL)
    {
        cout << "1. View list" << endl;
        cout << "2. Insert to list" << endl;
        cout << "3. Remove from list" << endl;
        cout << "4. Inspect list " << endl;
        cout << "0. Exit Program" << endl << endl;
        cout << "Enter a option: ";

        cin >> userOption;

        switch (userOption)
        {
            case 1:
                cout << "\ncase 1 test, view list\n" << endl;

                queue.viewList();

                break;

            case 2:
                cout << "\ncase 2 test" << endl;

                queue.insert('g');
                break;

            case 3:
                cout << "\ncase 3 test" << endl;
                if (!queue.is_empty())
                    queue.remove();
                else
                    cout << "\nERROR Queue is empty" << endl;
                break;

            case 4:
                cout << "\ncase 3 test" << endl;
                if (!queue.is_empty())
                {
                    if (queue.inspectList())
                        cout << "\nlist is valid\n" << endl;
                    else
                        cout << "\nlist is not valid does not follow rules" << endl;
                }
                else
                    cout << "\nERROR Queue is empty" << endl;

                break;
        }
        cout << endl;
    }

    return 0;
}
-----------------------------------------------------------
LQ.cpp
-----------------------------------
#include "LQ.h"
#include <iostream>

using namespace std;

bool LLQ::is_full() const
{
    return false;
}

bool LLQ::is_empty() const
{
    return (head==NULL);
}

void LLQ::remove()
{
    //removing the first element in the list
    node *nodePtr;

    nodePtr = head;

    head = nodePtr->next;

}

void LLQ::insert(char insertChar)
{
    node *newNode;
    node *nodePtr;

    //placing a value into newNode and assigning and pointing the next to null
    newNode = new node;
    newNode->character = insertChar;
    newNode->next = NULL;
    if (!head)
    { //if list is empty
        head = newNode;
        nodePtr = head;
        newNode->next = NULL;
    }
    else
    {//if list not empty
        nodePtr = head;

        while (nodePtr->next)
            nodePtr = nodePtr->next;

        nodePtr->next = newNode;
    }

}

void LLQ::createList(char insert)
{

    node *newNode;
    node *nodePtr;

    newNode = new node;
    newNode->character = insert;
    newNode->next = NULL;

    if (!head)
    { //if list is empty
        head = newNode;
        nodePtr = head;
        newNode->next = NULL;
    }
    else
    {//if list not empty
        nodePtr = head;

        while (nodePtr->next)
            nodePtr = nodePtr->next;

        nodePtr->next = newNode;
    }
}

void LLQ::viewList() const
{
    struct node *ptr;

    if (head == NULL)
        cout << "\nThe Queue is empty" << endl;
    else
    {
        ptr = head;
        cout << "\nCurrent Queue:\n" << endl;

        while (ptr != NULL)
        {
            cout << ptr->character;
            ptr = ptr->next;
        }
    }
    cout << endl;

}

bool LLQ::inspectList()
{
    bool isValid = true;

    node *nodePtr;

    nodePtr = head;

    if (nodePtr->character != 'a') //checkin if first element is not 'a'
        isValid = false;
    else
    {
        while (nodePtr->next && isValid == true) //checking for characters other than 'a' or 'b'
        {

            if (nodePtr->character != 'a' || nodePtr->character != 'b')
                isValid = false;
            nodePtr = nodePtr->next;

        }
    }

    return isValid;
}

LLQ::~LLQ()
{
    node *nodePtr; //to traverse the list
    node *nextNode; //to point to the next node

    nodePtr = head;

    while (nodePtr != NULL)
    {
        //save a pointer to the next node
        nextNode = nodePtr->next;

        //delete the current node
        delete nodePtr;

        //position nodePtr at the next node
        nodePtr = nextNode;
    }
}
---------------------------------------------------------------------------
LQ.h
---------------------------------
#ifndef LQ_H
#define LQ_H
#include <iostream>

class LLQ {

private :

    struct node
    {
        char character;
        node *next;
    };

    node *head;

public:

    //constructor
    LLQ()
    {head = NULL;}

    //destructor
    ~LLQ();

    //functions
    bool is_full() const;
    bool is_empty() const;
    void remove();
    void insert(char);
    void viewList() const;
    void createList(char);
    bool inspectList();

};
#endif

iNCLionProjectsLQ] - .AnBnAn.cpp File Edit Yew Navigate Code Beractor Run ļools VCS Window Help CLion 2017.2 LQAnBnAn.cpp a Project * I← Δ cMakeLists.tit x a: AnBnAn.cpp : 溫LQ.cppx İ. LQ.hx cmake-build-deh x AnBnAn.cpp Δ CMakelists.tt 嶨2 LQ.cpp #include "LQ.h" #include <string: using namespace std; LQ C:\Users\Swapnil\cLionProjects\ LQ\cmake-build-debug\LQ.exe 1. View list 2. Insert to list L E 3. Remove from list 4. Inspect list 0. Exit Program Enter a option:1 case 1 test, view list current Queue: 1. View list 2. Insert to list 3. Remove from list 4. Inspect list 0. Exit Program Enter a option: Build finished in 703ms (moments ago) 28:1 LF# UTF-8: Contest LQ [D]