[NinjaLink]

I need help with these program segments, so I can study for an exam. Please assist me


Example of program segment:

Return the last item of a queue leaving the queue unchanged

while (!q.isempty())
{
int e;
q.deleteQueue(e);
p.addQueue(e);
}
cout<<e<<endl;
while (!p.isempty())
{
p.deleteQueue(e);
q.addQueue(e);
}

I have attempted these questions on my own, but failed horribly. I ask anyone who has knowledge of C++ to help assist me. I really appreciate it. I do not want to fail. I want to use the variables and stuff that I used in the example above. If anyone wants to help me please reply back!


1. Determine if a word is a palindrome using queues

2. Replace every occurence of every (e) in a queue with an x

3. Give the sum of the 1st 3 elements in a queue leaving the queue unchanged

4. Reverse the elements in a queue (using recursion)

5. Exchange the front 2 elements of a queue

*** MOD EDIT: Added code tags. Please ***

[JackOfAllTrades]

You're going to have to show some effort. You've been here for a month, you know the rules. Start with the first one...show what you've "attempted ... and failed."

[NinjaLink]

Here is my attempt...


Determine if a word is a palindrome or not using queues

q.addQueue(v);

for (int i = q.front(); i < q.front(); i--)
{
   for (int j = q.back(); i<q.back(); i++
  {
   if ( q.front() == q.back() )
    {
     cout<<"It is a palindrome"<<endl;
     }
       else 
       {
         cout<<"It is not a palindrome"<<endl;
        }
      }
    }

Return the last item of a queue leaving the queue unchanged

if (!p.QueueIsEmpty() )
{
p.deleteQueue(v);
}
p.addQueue(v);
cout<<v;

Replace every occurence of every (e) in a queue with an (x)

if (!s.QueueIsEmpty)
{
for (int i=q.front(); i<q.front(); i--)
  {
     for (int j=q.back(); i<q.back(); i++)
        {
        if (q.front() == 'e') || (q.back() == 'e')
         {
         q.addQueue(x);
         }
         }
   }

Give the sum of the 1st 3 elements in a queue leaving the queue unchanged

if (q.QueueIsEmpty())
{
for (i = q.front(); i<q.front()-3; i--)
  {
   q.DeleteQueue(v)
   s.AddQueue(v)
   sum+=val;
   }
for (int i =0; i<3; i++)
{
  s.DeleteQueue(v);
  q.AddQueue(v);
}
else
{
 cout<<"It is empty"<<endl;
}
cout<<"Sum is "<<sum;

Reverse the elements in a queue

while (!s.QueueIsEmpty())
{
p.DeleteQueue(v);
}
p.AddQueue(v);
cout<<v<<" ";

Exchange the front 2 elements of a queue

p.DeleteQueue(v);
p.DeleteQueue(e);
p.AddQueue(v);
p.AddQueue(e);

[NinjaLink]

Is anyone available to assist me? I am not using any classes. I am basically using pseudo code. Please help!

This post has been edited by NinjaLink: 04 November 2009 - 12:41 PM

[Oler1s]

You haven't asked a question. Telling us your assignment is not a question.

[NinjaLink]

I just need to know if my answers are correct and if not, what do I need to do to correct them

[Oler1s]

There's no way to verify the correctness of what you wrote. We don't know what the types of the variables are, the functions, their behavior, etc.

If you want to verify correctness by yourself, you can write small programs making use of the logic in these snippets. Encode your snippets as a function, and call the functions appropriately. Your program(s) serve as unit tests, basically.

If your program functions as you would expect it to, that's a sign you are correct.

EDIT: Although I can't formally verify anything you have, a quick look suggests your logic makes no sense. Look at the way you determine if a word is a palindrome or not. You have two for loops, but all you compare is q.front() and q.back(). Does that make sense?

This post has been edited by Oler1s: 04 November 2009 - 01:46 PM