Exercise 12:

Create a directory ex12 and store in this directory the files corresponding to your answers for the following questions.

Question 1: standard containers - list (20 points).

Create a file "list-ex.cpp". In this file write the code corresponding to the following statements:

Create a list of string l1 and add in the back of this list the fruit names: apple, orange, banana.
Print the content of l1.
Create a list of string l2 and add in the front of this list the fruit names: grape, lemon, grapefruit.
Print the content of l2.
Sort l1 then l2.
Merge l1 to l2.
Print the content of l1 then l2.
Add in the back of l1 the following fruit name: apple, lemon.
Sort l1 then remove the duplicate with the method named unique().
Print the content of l1.

Note: you can write everything in the function main().

Question 2: spell checker (40 points).

The goal of this question is to implement a simplified spell checker. Given a series of words, the program should write on output a list of the words, which are possibly misspelled.
Get the files speller.cpp and holmes.txt. The file "speller.cpp" will contain the code for the spellchecker and needs to be completed. The file "holmes.txt" is a text in English that will be used as our "dictionnary".
You need to complete the code in the file "speller.cpp". There are three procedures that need to be completed:

create_dict(dict, dict_file_name): is reading word by word from the input file dict_file_name. After reading each word, you need to insert it in the container dict.
spell_check(word, dict): given word and dict, check if word is in dict. If it is not, print: "#word is probably misspelled".
main(): It needs to do three things. First, call create_dict() to create our dictionnary from the file "holmes.txt". Second, create list of test words: spelling, speling, whree and where. Third, iterate through each test word in the list and check if it is spelled correctly by calling spell_check().

Important note: you need to select a proper container for dict. The size of the dictionary can be very big, so the container should allow for fast checking if an element is in the container.

Output for the test words should be:

Building dictionnary
Dictionnary built
speling is probably mis-spelled
whree is probably mis-spelled

Question 3: Queue from stacks (40 points).

The goal of the exercise is to define a queue by using two std::stack. Please complete the following definition of a queue in a file named "queue.h".

#ifndef QUEUE_H
#define QUEUE_H

#include <vector>
#include <stack>

template <typename T, typename Container=std::vector<T> > class Queue {
public:
    typedef typename Container::value_type value_type;
    typedef typename Container::size_type  size_type;
    typedef Container container_type;

    explicit Queue(const Container& contents = Container());
    bool empty() const;
    size_type size() const;
    value_type& front();
    const value_type& front() const;
    value_type& back();
    const value_type& back() const;
    void push(const value_type& x);
    void pop();
};

You need to implement each method above. For that purpose you need to use two std::stack<T>.
To test your implementation, you can use the following code (to be typed in the file named "test_queue.cpp"

#include <iostream>

#include "queue.h"

int main (void) {
 Queue<int> q;
 q.push(1);
 q.push(2);
 q.push(3);
 
 while (!q.empty()) {
  std::cout << q.front() << std::endl;
  q.pop();
 }

 return 0;
}

The output for the previous program should be:

1
2
3