There are waiters for serving multiple customers in which 5 waiters have the following id: 101, 102, 103, 104, 105.

Question

1.00/5 (2 votes)

See more:

Suppose there are waiters for serving multiple customers in which 5 waiters have the following id: 101, 102, 103, 104, 105. Each waiter will be assigned with random tip between 0-10$ in each iteration. Waiter with least tip will be removed in each iteration. While considering the above scenario, do the following tasks.
(i)Code the above scheme in C++, insert 0 when initializing circular linked list.
(ii)Sort the Linked List according to tip after removing a waiter.
(iii)Removed waiter should be displayed on console after every iteration.
(iv)Display waiter id with highest tip.

What I have tried:

i am not able to do this task in C++. so please help me out with this code . i will be very gratefull. i have this question for quiz .i want this code urgently.

Posted 14-Mar-22 10:37am

Member 15566333

Updated 14-Mar-22 14:59pm

RedDk

Add a Solution

4 solutions

Add a Solution

Add your solution here

Treat my content as plain text, not as HTML

Preview 0

…

Existing Members

Sign in to your account

...or Join us

Download, Vote, Comment, Publish.

Your Email
Password
Forgot your password?

Your Email
This email is in use. Do you need your password?
Optional Password

I have read and agree to the Terms of Service and Privacy Policy
Please subscribe me to the CodeProject newsletters

When answering a question please:

Read the question carefully.
Understand that English isn't everyone's first language so be lenient of bad spelling and grammar.
If a question is poorly phrased then either ask for clarification, ignore it, or edit the question and fix the problem. Insults are not welcome.
Don't tell someone to read the manual. Chances are they have and don't get it. Provide an answer or move on to the next question.

Let's work to help developers, not make them feel stupid.

This content, along with any associated source code and files, is licensed under The Code Project Open License (CPOL)

Greg Utas · Answer 1 · 2022-03-14T14:14:00

I'm in a good mood, so here's an outline to get you started.

C++

#include <cstdlib>   // rand() returns a random number
#include <iostream>  // std::cout writes to the console
#include <list>      // std::list provides a circular queue

class Waiter
{
public:
   Waiter(int id): id_(id), tips_(0) { }
   int GetId() const { return id_; }
   void AddTip(int amount) { tips_ += amount; }  // use float if tips can have cents
   int GetTips() const { return tips_; }
   void Display() const;
   bool operator<(const Waiter& that) const;
private:
   int id_;
   int tips_;
};

void Waiter::Display() const
{
   //  Display this Waiter's id and tips on the console.
}

bool Waiter::operator<(const Waiter& that) const
{
   if(this->tips_ < that.tips_) return true;
   if(this->tips_ > that.tips_) return false;

   //  What if two waiters have the same tips?  If this operator does not
   //  consistently order two items, std::list::sort throws an exception.
   //  So you need to do something to always choose the same waiter.
}

int GenTip() 
{
  return 0; // todo: random tip with range 0 - 10 
}

int main()
{
   std::list< Waiter > Waiters;  // all the waiters currently working

   for(int id = 101; id <= 105; ++id)
   {
      Waiters.push_back(Waiter(id));
   }

   while(Waiters.size() > 1)
   {
      for(auto w = Waiters.begin(); w != Waiters.end(); ++w)
      {
         w->AddTip(GenTip());  // tip with range 0-10 
      }

      //  Sort Waiters using list::sort, which will invoke your implementation
      //  of Waiter::operator<

      //  The Waiters have been sorted in descending order, so display the
      //  first one and remove it from the list.
   }

   //  Waiters only has one Waiter remaining.  Display that Waiter on the
   //  console.
}

merano99 · Answer 2 · 2022-03-14T14:59:00

C++

// To implement a circular list class you need first a node.
class node {
public:
	node(int myid) :id(myid), next(NULL) {};
	virtual ~node() {};
    node* getNext() { return next; }
    int getID() { return id; }
	void setNext(node* newNext){ next = newNext; };
private:
	node* next;
	int id;
};

// Based on this, a list of waiters can now be created.
class waiters 
{
public:
	waiters() :last(NULL) { }; // constructor
	~waiters();                // destructor
	bool isempty(){ return last == NULL; };
	void insert(int id);
	int remove();
private:
	node *last;                // ptr to last node of list
};

waiters::~waiters() {               // destructor
	while (!isempty())
		remove();
};

void waiters::insert(int id)
{
  node *newNode = new node(id);        // new node
  if (last == NULL) {                  // if empty list
     last = newNode;                  //  create single node list
     newNode->setNext(newNode);
     return;
  }
  ...   //  append node to end of list
  last = newNode;
}

int waiters::remove()
{
   int x=0;
   ...
   return x;
}

int main()                              // test class waiter
{
	waiters w;
	w.insert(101);
	w.insert(102);
	w.insert(103);
	w.insert(104);
	w.insert(105);

	// ...

	while (!w.isempty())
		std::cout << w.remove() << std::endl;
	return 0;
}

Some places were deliberately not implemented here. If something is not clear, you can find many explanations on the net.

OriginalGriff · Answer 3 · 2022-03-14T10:44:00

While we are more than willing to help those that are stuck, that doesn't mean that we are here to do it all for you! We can't do all the work, you are either getting paid for this, or it's part of your grades and it wouldn't be at all fair for us to do it all for you.

So we need you to do the work, and we will help you when you get stuck. That doesn't mean we will give you a step by step solution you can hand in!
Start by explaining where you are at the moment, and what the next step in the process is. Then tell us what you have tried to get that next step working, and what happened when you did.

If you are having problems getting started at all, then this may help: How to Write Code to Solve a Problem, A Beginner's Guide[^]

And ... either this is the same question you pasted 2 days ago under a different account, or your classmates are ahead of you ... There are waiters for serving multiple customers in which 5 waiters have the following id: 101, 102, 103, 104, 105.[^] You didn't get the code then, either.

Patrice T · Answer 4 · 2022-03-14T13:29:00

Quote:
i am not able to do this task in C++. so please help me out with this code . i will be very gratefull. i have this question for quiz .i want this code urgently.

If you just go blank with this problem, you need to have an urgent talk with your teacher.
As is, your question is a do my homework for me, and this, we will not do.
Programming is learned by trial and error, you learn from your errors, and this, we can't do for you. It is like learning to read or write, the only way is to practice by yourself.

The requirement is not a monolith, it suggest to split in 4 parts that you will put together later.
I suggest a few readings that may help.
- Learn one or more analyze methods, E.W. Djikstra/N. Wirth Stepwize Refinement/top-Down method is a good start.
Structured Programming.pdf[^]
https://en.wikipedia.org/wiki/Top-down_and_bottom-up_design[^]
https://en.wikipedia.org/wiki/Structured_programming[^]
https://en.wikipedia.org/wiki/Edsger_W._Dijkstra[^]
https://www.cs.utexas.edu/users/EWD/ewd03xx/EWD316.PDF[^]
Program Development by Stepwise Refinement[^]

There are waiters for serving multiple customers in which 5 waiters have the following id: 101, 102, 103, 104, 105.

4 solutions

Solution 3

Solution 4

Solution 1

Solution 2

Add your solution here

Preview 0