Question

========================Data Structure C++============================

1. Write a CLIENT program that creates a stacks fo type int (so one stack instance):  aStack. Ask the user for 5 ints and push them onto aStack. Find a way to print the values in aStack in from the bottom to the top (so display the top LAST) - so if aStack was 1,2,3,4,5 with 5 at the top and 1 at the bottom you want it to display 1,2,3,4,5 (you don't want it to display 5,4,3,2,1 like normal). You can use ArrayStack.h or LinkedStack.h for your stacks but do NOT change the code for ArrayStack or LinkedStack. Submit ONLY your main method for this program. Preferably copy and paste but I set it up so you can submit files if need be.

2. Write a FUNCTION (not a member function just a regular old function for a client program) that uses a stack to test whether or not a given string is a palindrome (remember a palindrome reads the same backward and forward: so a, aba, a_ _a, abba etc). Test your function in a client program. You can use ArrayStack.h or LinkedStack.h for your stacks but do NOT change the code for ArrayStack or LinkedStack. Turn in ONLY your function code but it should compile without alternation when I test it (I should only need to add the function prototype to my main). Preferably copy and paste but I set it up so you can submit files if need be.

Answer 1

1.

#include <iostream>
#include "LinkedStack.h"

using namespace std;

int main()
{
   LinkedStack<int> aStack; // assuming LinkedStack is a templated stack
   int num;
   cout<<"Enter 5 integers to push : ";
   // loop to push 5 ints
   for(int i=0;i<5;i++)
   {
       cin>>num;
       aStack.push(num);
   }
  
   LinkedStack<int> tempStack; // create a temporary stack
   // isEmpty() is a function of LinkedStack that returns if the stack if empty or not
   while(!aStack.isEmpty())
   {
       tempStack.push(aStack.peek());
       aStack.pop();
   }
  
   cout<<"Stack from bottom to top : "<<endl;
   while(!tempStack.isEmpty())
   {
       cout<<tempStack.peek();
       tempStack.pop();
   }
   return 0;
}

//end of program

2.

1.

#include <iostream>
#include "LinkedStack.h"

using namespace std;

bool isPalindrome(string str)
{
   LinkedStack<char> aStack;
   // loop over the string and push the characters to the stack
   for(int i=0;i<str.length();i++)
       aStack.push(str.at(i));
  
   int i=0;
   // loop over the string and stack
   while((!aStack.isEmpty()) && (i <str.length()))
   {
       char strChr = str.at(i); // get the ith character of the str
       char stkChr = aStack.peek(); // get the top character from stack
       if(strChr != stkChr) // if the characters do not match, then string is not a palindrome
           return false;
       aStack.pop(); // remove the top element from stack
       i++;   // advance to next index of str
   }
  
   return true; // str is palindrome
}

//end of function

int main()

{

// test the function

return 0;

}