CS301 Data structures ASSIGNMENT No.3 Fall Semester 2012 Due Date 19-11-2012

[Vuhelper]

CS301 Data structures ASSIGNMENT No.3 Fall Semester 2012 Due Date 19-11-2012


Assignment No. 03
SEMESTER Fall 2012
CS301- Data Structures
Total Marks: 20

Due Date: 19/11/2012
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:
o The assignment is submitted after due date.
o The submitted code does NOT compile.
o The submitted assignment is other than .CPP file.
o The submitted assignment does NOT open or file is corrupted.
o 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.

Note: Use ONLY Dev-C++ IDE.
Objective
The objective of this assignment is

o To make you familiar, Programming with the Linked list and Queue data structures.


For any query about the assignment, contact at
GOOD LUCK
Marks: 20

Consider the scenario that the customers of a bank are depositing their utility bills in the banks standing in a row outside.
The bank serves its customer on first come first serve strategy, in order to automate this scenario the Queue data structure is well suitable to use, therefore,
Write a C++ program which store customer names and their ages in the Queue, while the Queue must implement as a linked listed internally, it should be clear that the first node (Customer) in the Linked list will be the front of the Queue while the last node (Customer) in the linked list will be the Back (rear) of the Queue, for example,


The program should implement the following operations of Queue data structure,
1. Add_Customer() : add a new customer in the queue
2. Remove_Customer() : Remove or serve a customer from the Queue
3. Get_FrontCustomer() : Just show the Customer name that will serve(remove) next, or means customer at the front.
4. Display_Q() : Show all Customer names and ages currently present in the Queue
5. GetQsize() : Show the number of customer currently present in the Queue.

Sample Output:
Please look the .GIF file.
Lectures Covered: This assignment covers Lecture # 01-10
Deadline: Your assignment must be uploaded/submitted at or before. 19/11/2012