Question

Exereise 1: 7 рoints Write a program in C/C++ to enter a string of characters i.e. your name, then try to compute this string in reverse order using a Stack structure with the Linked List principle. For example: "Nguyen Van A""A Nav Neyugn Exercise 2: 8 points Assume that a queue of N passengers waiting to enter a train car Only the first person in the queue can enter at a time New persons arrive will go to the end of the queue. Implement basic operations for Queue ADT using the Linked List principle to man- age the queue. Exercise 3: 5 points Suppose that we play a following game. There are a list 10 numbers from 0 to 9 and an empty stack Step 1: We draw randomly a mumber n from the list and push it into a stack Step 2: We perform randomly a second draw to choose another number n from the list and put it into the stack. If n , we must draw again Step 3: While the first two are still unknown. Don't reveal these number then guess a third mumber n. This mumber is entered from keyboard. Step 4: Verify that the third mumber is between the first and the second (nR<n or ng<n<m). If true, you win. Step 5: Otherwise, pop up the second number from the stack. Return to the Step 2. If we still guess wrong number this time, your turn is over and clear the stack to play the game again. Write this game in C/c++ using the Linked List implementation for the stack To obtain a random mumber from 0 to 9, use the following code. #include <time. h int main () srand time (NULL) ) int iSecret =rand () % 9+1 printf("%d", iSecret); }

Answer 1

since multiple questions are given, I'm solving the first question

#include <iostream>
using namespace std;
// we can easily implement stack using likned list
// we maintain a linked list and always push and pop the element from the front ton maintain the LIFO(last in first out) property
struct Stack{
char data;// to store the char of the string
Stack* next;// link to nexr node
};
Stack* top=NULL;// head or top the stack

// function to push the char in stack
void push(char s)
{
Stack* temp=new Stack();// dynammically allocating a new node
temp->data=s;// setting the node's data to s
  
temp->next=top;
top=temp;// adjusting the link to add the new node in the front of the linked list
  
}
// function to remove element from the top
void pop(){
  
Stack* temp=top;//storing the element to be deleted in temporary variable
top=top->next;// makin the next element as the front element
temp->next=NULL;// breaking the connection between the second element and the element to be deleted
free(temp);// freeing the memory
}
// returns the data og top character
char peek()
{
return top->data;
  
}
// check if the stack is empty or not
bool isempty()
{
return top==NULL;
}
// the the Stack
void display()
{
Stack *temp=top;
while(temp)
{
cout<<temp->data<<" ";
temp=temp->next;
}
}

int main() {
   // your code goes here

   string s;
   getline(cin,s);// getting input from the user
   for(int i=0;i<s.length();i++)
   {
   if(s[i]>='A'&&s[i]<='Z')// converting all uppercase letters to lower case letters
   {
   s[i]=s[i]+32;
  
  
  
   }
   push(s[i]);// now pushing all the letters in the stack
     
   }
   // now since stack follow LIFO(last in first out), element that were inserted at the last, will come out first, thus the string will come out in rever order
   char prev='\0';// we maintain a previous charcter, so that when we encounter a space character we can convert its next character into uppercase
   while(!isempty())
   {
   char c=peek();
   pop();
   if(prev==' '||prev=='\0')
   {
   c=c-32;// converting into uppercase
   }
   cout<<c;
   prev=c;// updating previous
   }
  
   return 0;
}
Sample Input: "Nguyen Van A"

Sample Output :"A Nav Neyugn"

Please upvote if you liked the answer.Thank you!