Exercise 13.4 (Completed)

1. (Review) State whether a queue, a stack, or neither object is appropriate for each of the following
tasks, and indicate why or why not:
a. A list of customers waiting to be seated in a restaurant

A queue would work best because the customers will be seated in the order they arrive.

b. A group of student tests waiting to be graded

A stack would work best because the papers can be graded easier starting from the last person who turned in a paper

c. An address book listing names and phone numbers in alphabetical order

Neither the information has already been orginazed and there is no task be be completed

d. Patients waiting for examinations in a doctor’s office

A queue would work best because it will allow each patient to come and go in the order they arrived in.

2. (Practice) Enter and run Program 13.4.

Done!!

3. (Modify) Modify Program 13.4 to use a queue of integers rather than a queue of strings.

#include "stdafx.h" 
#include <iostream>
#include <deque>
#include <string>
#include <cctype>
using namespace std;
int main()
{
	int name;
	deque<int> queue;
	cout << "Enter as many names as you want, one per line" << endl;
	cout << " To stop enter a single x" << endl;

	// push names onto the queue
	while (true)
	{
		cout << "Enter a name(or x to stop) : ";
		cin >> name;
		if (name == 20) break;
		queue.push_front(name);
	}
	cout << "\nThe names in the queue are : \n";
	// pop names from the queue
	while (!queue.empty())
	{
		name = queue.back();  // retrieve the name
		queue.pop_back();     // pop a name from the queue
		cout << name << endl;
	}
	system("PAUSE");
	return 0;
}

4. (Program) Write a C++ program that allows a user to enter a maximum of 20 characters in a
queue. Then have the program sort the queue contents in increasing order. For example, if the
queue’s contents are initially D, E, A, and B, its final contents are A, B, D, and E.

#include "stdafx.h" 
#include < iostream >
#include < deque >
#include < queue >
#include < stack >
#include < map >
#include < string >

class CMyInts
{
public:
	bool operator () (const char &lhs, const char &rhs)
	{
		if (lhs < rhs)
			return false;
		return true;
	}
};

void main()
{
	/*std::cout << "\n\nPriority Queue of Integer Values";
	std::priority_queue < char > myInts;
	myInts.push('A');
	myInts.push('B');
	myInts.push('G');
	myInts.push('C');
	while (myInts.size())
	{
		std::cout << "\n" << myInts.top();
		myInts.pop();
	}

	std::cout << "\n\n";*/

	std::cout << "\n\nPriority Queue of Integer Values - Sort Ascending" << std::endl;
	std::priority_queue < char, std::vector < char >, CMyInts> myIntsAsc;
	
	int MAX;
	char letter;
	std::cout << "Enter MAX number of elements" << std::endl;
	std::cin >> MAX;

	for (int i = 0; i < MAX; i++){
		if (MAX > 20){
	    	std::cout << "Not possible" << std::endl;
			break;
		}
		std::cin >> letter;
		myIntsAsc.push(letter);
	}
	
	while (myIntsAsc.size())
	{
		std::cout << "\n" << myIntsAsc.top();
		myIntsAsc.pop();
	}

	std::cout << "\n\n";

	system("PAUSE");

	return;
}

5. (Program) Write a queue program that accepts an object consisting of an integer ID number
and a double-precision hourly pay rate.

#include "stdafx.h" 
#include <iostream>
#include <deque>
#include <string>
#include <cctype>
#include <list>

using namespace std;

class IDnumhpr
{
private:
	int IDnum;
	double hpr;

public:
	IDnumhpr(int ii, double hh){
		IDnum = ii;
		hpr = hh;
	}
	int getIDnum(){ return IDnum; }
	double gethpr(){ return hpr; }
};

int main()
{
	int num;
	double num2;
	deque<IDnumhpr> queue;
	cout << "Enter as many names as you want, one per line" << endl;
	cout << " To stop enter a single x" << endl;

	// push names onto the queue

	while (true)
	{
		cout << "Enter a name(or x to stop) : ";
		cin >> num;
		cin >> num2;
		if (num == 1000 && num2 == 1000) break;
		queue.push_front(IDnumhpr(num,num2));

	}
	cout << "\nThe names in the queue are : \n";
	// pop names from the queue
	while (!queue.empty())
	{
		cout << queue.back().getIDnum()<< endl;
		cout << queue.back().gethpr() << endl;

queue.pop_back();     // pop a name from the queue
	
	}
	system("PAUSE");
	return 0;
}

6. (Modify) Add a menu method to Program 13.4 that gives the user a choice of adding a name
to the queue, removing a name from the queue, or listing the queue’s contents without removing
any objects from it.

#include "stdafx.h" 
#include <iostream>
#include <deque>
#include <string>
#include <cctype>
using namespace std;
int main()
{
	string name;
	deque<string> queue;
	cout << "Enter as many names as you want, one per line" << endl;
	cout << "Menu" << endl;
	cout << "Add a name by entering a string name" << endl;
	cout << "Remove a name enter a single r" << endl;
	cout << "List the queue's contents with/without removing any objects" << endl;
	cout << "Enter a single x to exit" << endl;


	// push names onto the queue
	while (true)
	{
		cout << "Enter a name(or x to stop) : ";
		getline(cin, name);
		if (tolower(name.at(0)) == 'x'){ break; }
		queue.push_front(name);
		if (tolower(name.at(0)) == 'r'){
			queue.pop_front();
		}
		
	}
	cout << "\nThe names in the queue are : \n";
	// pop names from the queue
	while (!queue.empty())
	{
		name = queue.back();  // retrieve the name
		queue.pop_back();     // pop a name from the queue
		cout << name << endl;
	}
	system("PAUSE");
	return 0;
}

7. (Program) A group of people have arrived at a bus stop and are lined up in this order:
1. Chaplin 
2. West 
3. Taylor 
4. Laurel 
5. Smith 
6. Grisby 
7. Oliver 
8. Hardy 
9. Burton 
10. Garland
11. Wayne
12. Stewart

Read the names from an input file into a queue and display the order in which passengers
board the bus.

#include "stdafx.h" 
#include <iostream>
#include <queue>
#include <string>
#include <cstdlib>
#include <fstream>
#include <iomanip>
using namespace std;

int main()
{
	string filename = "bus.dat";
	string name;
	ofstream outFile;
	ifstream inFile;
	inFile.open(filename.c_str());
	outFile.open(filename.c_str());

	if (outFile.fail())
	{
		std::cout << "The file was not successfully opened" << endl;
		exit(1);
	}

	outFile << "Chaplin" << endl;
	outFile << "West" << endl;
	outFile << "Taylor" << endl;
	outFile << "Laurel" << endl;
	outFile << "Smith" << endl;
	outFile << "Grisby" << endl;
	outFile << "Oliver" << endl;
	outFile << "Hardy" << endl;
	outFile << "Burton" << endl;
	outFile << "Garland" << endl;
	outFile << "Wayne" << endl;
	outFile << "Stewart";
	
	outFile.close();

	while (inFile.good()){
		inFile >> name;

		queue<string> q;
		q.push(name);
		cout << q.front() << endl;
		q.pop();
		
	}

	inFile.close();

	system("PAUSE");
	return 0;
}