Question

Write a program that reads a line of text, changes each uppercase letter to lowercase, and places each letter both in a queue and onto a stack. The program should then verify whether the line of text is a palindrome (a set of letters or numbers that is the same whether read forward or backward).

please use c++ language and use own queue class or class provided. plese do not use queue library. please use functions.

Answer 1

program in c++

#include <cctype>

#include <iostream>

#include <string>

#include <fstream>

using namespace std;

#define MAX 1000

class Stack

{

int top;

public:

string a[MAX]; //Maximum size of Stack

Stack() { top = -1; }

bool push(string x);

bool isEmpty();

string pop();

};

bool Stack::push(string x)

{

if (top >= (MAX-1))

{

cout << "Stack Overflow";

return false;

}

else

{

a[++top] = x;

cout<<x <<" pushed into stack\n";

return true;

}

}

string Stack::pop()

{

if (top < 0)

{

cout << "Stack Underflow";

return 0;

}

else

{

string x = a[top--];

return x;

}

}

class Queue {

private:

int i;

string arr_queue[MAX];

int rear;

int front;

public:

Queue() {

rear = 0;

front = 0;

}

void insert(string item) {

if (rear == MAX)

cout << "\n Queue Overloaded !";

else {

cout << item<<" Inserted into queue";

arr_queue[rear++] = item;

}

}

void display() {

cout << "\n## Queue Size : " << (rear - front);

for (i = front; i < rear; i++)

cout << "\nPosition : " << i << " , Value : " << arr_queue[i];

}

};

int main()

{

string line;// to hold line

std::ifstream file("input.txt");

std::string str;

class Stack s;

class Queue q;

while (std::getline(file, line))

{

cout<<"Read Line ::"<<line<<"\n";

for(int i = 0; i < line.length(); i++)

{

line[i] = tolower(line[i]);

}

s.push(line);

q.insert(line);

bool isPalindrome = true;

for(int i = 0; i < line.length(); i++)

{

isPalindrome *= line[i] == line[line.length() - 1 - i];

}

if(isPalindrome)

{

cout << "\n Line is a palindrome!" << endl << endl;

}

else

{

cout << "\n Line isn't a palindrome!" << endl << endl;

}

}

q.display();

cout<<"\n"<<s.pop() << " Popped from stack\n";

return 0;

}

/*

output

Read Line ::bhushan
bhushan pushed into stack
bhushan Inserted into queue
Line isn't a palindrome!

Read Line ::madam
madam pushed into stack
madam Inserted into queue
Line is a palindrome!

Read Line ::mahajan
mahajan pushed into stack
mahajan Inserted into queue
Line isn't a palindrome!

## Queue Size : 3
Position : 0 , Value : bhushan
Position : 1 , Value : madam
Position : 2 , Value : mahajan
mahajan Popped from stack

input.txt (file)

bhushan
madam
mahajan

*/