0% found this document useful (0 votes)
31 views3 pages

Instructions: Marks: 20

This document provides instructions for Assignment No. 02 in CS301 Data Structures. Students are asked to write a C++ program to simulate queues of customers at a cosmetic store counter. The program should allow a user to enter their estimated processing time and recommend the shortest queue. It should also display the number of customers each teller processed at the end of the day and identify the teller with the most customers. Guidelines are provided on implementing queues as linked lists using classes for customers and tellers. The assignment is due on December 28th, 2013 and must be submitted as a .cpp file using Dev-C++ IDE.

Uploaded by

macdev2014
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
0% found this document useful (0 votes)
31 views3 pages

Instructions: Marks: 20

This document provides instructions for Assignment No. 02 in CS301 Data Structures. Students are asked to write a C++ program to simulate queues of customers at a cosmetic store counter. The program should allow a user to enter their estimated processing time and recommend the shortest queue. It should also display the number of customers each teller processed at the end of the day and identify the teller with the most customers. Guidelines are provided on implementing queues as linked lists using classes for customers and tellers. The assignment is due on December 28th, 2013 and must be submitted as a .cpp file using Dev-C++ IDE.

Uploaded by

macdev2014
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 3

Assignment No.

02
SEMESTER Fall 2013
CS301- Data Structures

Total Marks: 20

Due Date: 28/12/2013
Instructions
Please read the following instructions carefully before solving & submitting assignment:
It should be clear that your assignment will not get any credit (zero marks) if:
The assignment is submitted after due date.
The submitted code does NOT compile.
The submitted assignment file is other than .CPP format.
The submitted assignment file does not open or corrupted.
The assignment is copied (from other student or ditto copy from handouts or internet).

Uploading instructions
For clarity and simplicity, You are required to Upload/Submit only one .CPP file.
Dont wait for grace day. Grace Day is given only if there is problem with LMS on due date. Submit
your solution within due date.
Note that no assignment will be accepted through email if there is any problem on grace day.

Note: Use only dev-C++IDE.

Objective
The objective of this assignment is

o To make you familiar with queue and linked list data structures and programming techniques to
implement queue as linked list.

For any query about the assignment, contact at [email protected]
GOOD LUCK
Marks: 20
Suppose there is a large busy cosmetic store. In store, for billing, there are four counters with four tellers (who
deal payment etc). A customer comes to the store and collects the things he/she wants to purchase and go to one
of the counters to pay for purchase. If there are already people in front of counters, customer has to stand in the
queue. A customer generally selects the shortest queue (with respect to the number of people in queue). The
selection can become wrong if one of the people in the queue has a huge buying list. But if we know the
estimated time of each customer in the queue, selection can become efficient. The system can become efficient, if
we tell a new person which one is the shortest queue with respect to time taken by the people waiting in the
queue.

Consideringtheabovescenario,writeaC++programwhichasksausertoentertheestimatedtimetoprocess
thebill.Theprogramwilltelltheuser,inwhichqueuehe/shecanstandwithrespecttothetotaltimeofallthe
personsalreadyinthequeues.Attheendofthedaythesystemwilldisplaythetotalnumberofcustomersdeal
byeveryTellerandwhichTellerhasdealmaximumnumberofcustomers.
Solution Guidelines:
1) To pay the bills, Customer must have to stand in the queue. The length of the queue can vary so you have
to implement queue as linked list.
2) Create a class named Customer (Node class); this class should create a node (customer) in the queue.
This class should define two private data members, time and Next pointer. A constructor, getter and setter
functions for each data member should also be defined in this class.
3) Create another class named Teller (List class); to create a queue for each teller, this class should define
three variables, Front pointer, Rear pointer and counter. The class should also define the following
functions:

Constructor(): Default constructor of the class.
Destructor(): Destructor to destroy the memory gained by the use of new operator.
AddCustomer(): This method should enter the new customer at the rear.
TotalCustomer(): This method should return the total number of customers in a queue.
TotalTime(): This method should return the total time of customers standing in said queue.

4) In main() method of the program, create four objects of the class Teller which will act like four
counters at store. These objects should be able to perform all the required functionalities mentioned in the
question statement.
5) You can add more variables and functions to obtain the given functionalities according to your need.

Sample Output




Lectures Covered: This assignment covers Lecture # 1-10
Deadline: Your assignment must be uploaded / submitted on / before, 28 November, 2013.

You might also like