* Classes

class DayOfYear
{
  public:
    void output();
    int month;
    int day;
};

void DayOfYear::output()
{
    switch(month)  {
        case 1:
            cout << "January "; break;
        case 2: 
            cout << "February "; break;
        ...
    }

    cout << day;
}

int main()
{
    DayOfYear today;
    cout << "Enter the current month as a number: ";
    cin >> today.month;
    cout << "Enter the current day as a number: ";
    cin >> today.day;

    cout << "Today's date is ";
    today.output();
    cout << endl;
}

class DayOfYear
{
  private:
    int month;
    int day;

  public:
    void output();
    int getMonth();
    int getDay();
    void setMonth(int m);
    void setMonth(char *m);
    void setDay(int d);
};

int DayOfYear::getMonth()
{
    return month;
}

int DayOfYear::getDay()
{
    return day;
}

void DayOfYear::setMonth(int m)
{
    month = m;
}

void DayOfYear::setMonth(char *m)
{
    if(strcmp(m, "January") == 0) {
        month = 1;
    } else if(strcmp(m, "February") == 0) {
        month = 2;
    }
    ...
}

void DayOfYear::setDay(int d)
{
    day = d;
}

class DayOfYear
{
  private:
    int month;
    int day;

  public:
    DayOfYear(int month, int day);
    DayOfYear();
    void output();
    int getMonth();
    int getDay();
    void setMonth(int m);
    void setMonth(char *m);
    void setDay(int d);
}

DayOfYear::DayOfYear(int m, int d)
{
    month = m;
    day = d;
}

DayOfYear::DayOfYear()
{
    month = 1;
    day = 1;
}

int main()
{
    DayOfYear myBirthday(6, 22);
    DayOfYear newYears;
}

class Queue {
  private:
    struct QueueNode {
        int key;
        QueueNode *next;
    };
    QueueNode *front;
    QueueNode *back;
  public:
    Queue();
    ~Queue();
    void enqueue(int k);
    int dequeue();
    bool empty();
};

Queue::Queue()
{
    front = NULL;
    back = NULL;
}

Queue::~Queue()
{
    QueueNode *cur, *tmp;

    for(cur = front; cur; cur = tmp) {
        tmp = cur->next; 
        delete cur;
    }
}

void Queue::enqueue(int k)
{
    QueueNode *n = new QueueNode;
    n->key = k;
    n->next = NULL;
 
    if(back != NULL) { 
        back->next = n;
    } 

    back = n;

    if(front == NULL) {
        front = n;
    }
}

int Queue::dequeue()
{
    int key = front->key;
    QueueNode *newFront = front->next;
    if(back == front) {
        back = NULL;
    }
    delete front;
    front = newFront;
    return key;
}

bool Queue::empty()
{
   return front == NULL ? true : false;
}

int main()
{
    Queue q;

    q.enqueue(1);
    q.enqueue(2);
    q.enqueue(3);
    q.enqueue(4);

    while(!q.empty()) {
        cout << q.dequeue() << " ";
    }
  
    cout << endl;

    return 0;
}