Question

Implement the following in C++

Imagine that you are an engineer on a distant planet. You were tasked with mining the resources of the planet and have done so through largely primitive means. However you have managed to set up an automated train system to gather and collect the resources from your distant operations. Your train system collects boxes full of resources. A box might contain ores or wood or even liquid fuel. These boxes are placed into the train using drones who stack them on each other to save space. You now need to implement a management system using the newly researched data structures that will prove useful. In particular, the rapid pace of your development means that resources are accumulated quickly and fixed sized structures would be unwise. Therefore you will be implementing the stack through the use of a linked list.

    resrcStack

The class is defined according to the simple UML diagram below:

resrcStack<T>
-top: stackNode<T>*
----------------------------
+resrcStack()
+~resrcStack()
+push(t: stackNode<T>*):void
+pop():void
+peek():stackNode<T>*
+print():void
+determineTransportRequirement():string

The class variables are defined below:
•top: The current top of the stack. It will start as null but should refer to the top of the stack.

The class methods are defined below:
•resrcStack: The class constructor. It will start by initialising the variables to null.

•~resrcStack:The class destructor. It will deallocate all of the memory assigned by the class.

•push: This will receive a stackNode to add onto the current stack. The node is added from the front.

•pop: This will remove the top stackNode from the stack. If it is empty, print out ”EMPTY” with a newline at the end and no quotation marks. When removing the node, it should be deleted.

•peek: This will return the top node of the stack but without removing it from the stack.

•print: This will print the entire contents of the stack. For each resrc node in the stack, print the following information out sequentially, line by line. The format of this is         as follows:

         Resource: Unrefined Ores
         Quantity: 3500
         Resource: Refined Alloys
         Quantity: 30000

•determineTransportRequirement: This function will be used to determine what sort of transportation will be required to move the resources contained within the stack to their required destinations. The result of this function is a string returned for the following conditions:
                                1. drone: If the number of nodes is less than or equal to 5, drones will required.
                                2. car: If the quantity of the items in total, is greater than 50 and the items number at no more than 10, a car will be required. Quantity of items refers to the sum of the quantity variables in each of the stack nodes.
                                3. train: If the quantity of the items in total of the items is over 100, a train will be required. Quantity of items refers to the sum of the quantity variables in each of the stack nodes.

Return either drone, car or train depending on the conditions present. If none of the conditions are met, return ”LOGISTICS ERROR” without the quotation marks. The train takes precedence over the car which takes precedence over the drones for what to return.

==============stackNode.h=================================

#ifndef STACKNODE_H
#define STACKNODE_H
#include<iostream>
#include<string>
using namespace std;

// Defines a class Node
template <class T>
class stackNode
{
private:
   T resrc;
   int quantity;
public:
   stackNode *next;
   stackNode(T i, int q)
   {
       resrc = i;
       quantity = q;
   }

   ~stackNode()
   {
       delete next;
   }

   T getResrc()
   {
       return resrc;
   }

   int getQuantity()
   {
       return quantity;
   }
};
#endif

Answer 1

resrcStack.h

====================

#pragma once
#include "stackNode.h"

template <typename T>
class resrcStack {
private:
   stackNode<T>* top; // The current top of the stack
public:
   resrcStack(); // constructor
   ~resrcStack(); // destructor
   void push(stackNode<T>* t); // add a node at front of list
   void pop(); // removes top node from the stack
   stackNode<T>* peek(); // return the top node of the stack but without removing it
   void print(); // print the entire contents of the stack
   string determineTransportRequirement(); // return either drone, car or train
       // depending on the conditions present
};

template <typename T>
resrcStack<T>::resrcStack() {
   // initialize members
   top = nullptr;
}

template <typename T>
resrcStack<T>::~resrcStack() {
   // create a iterator
   stackNode<T>* itr = top;
   // loop each element in stack
   while (itr != nullptr) {
       //move top to next element in the stack
       top = top->next;
       // delete the element
       delete itr;
       // reassign iterator
       itr = top;
   }
}

template <typename T>
void resrcStack<T>::push(stackNode<T>* t) {
   // check if top is null
   if (top == nullptr) {
       // assign new node to top
       top = t;
   }
   else {
       // assign new node at top ofthe stack
       t->next = top;
       // reassign top of the stack
       top = t;
   }
}

template <typename T>
void resrcStack<T>::pop() {
   // check if top is null
   if (top == nullptr) {
       // print message that idicate the stack is empty
       cout << "EMPTY" << endl;
   }
   else {
       // remove firsrt element from the stack
       // assign temparary pointer to top
       stackNode<T>* temp = top;
       // move top to next element
       top = top->next;
       // delete temparary element
       delete temp;
   }
}

template <typename T>
stackNode<T>* resrcStack<T>::peek() {
   // return pointer to first element in the stack
   return top;
}

template <typename T>
void resrcStack<T>::print() {
   // print the entire contents of the stack, line by line
   // create an iterator to iterate over stack
   stackNode<T>* itr = top;
   while (itr != nullptr) {
       // print element
       cout << "Resource: " << itr->getResrc() << endl;
       cout << "Quantity: " << itr->getQuantity() << endl;
       // move itrerator to next element
       itr = itr->next;
   }
}

template <typename T>
string resrcStack<T>::determineTransportRequirement() {
   // get number of elements
   int number_of_item = 0;
   // get total quantity of item
   int total_quantity = 0;
   // create iterator to iterate over stack
   stackNode<T>* itr = top;
   while (itr != nullptr) {
       // increase item number
       number_of_item++;
       // increase item quantity
       total_quantity = total_quantity + itr->getQuantity();
       // set iterator to next element
       itr = itr->next;
   }
   // check if cargo canbe transported with drone
   if (number_of_item < 6 && total_quantity <= 50) {
       return "Drone";
   }
   else if (number_of_item < 11 && total_quantity > 50 && total_quantity <= 100) {
       return "Car";
   }
   else if (total_quantity > 100) {
       return "Train";
   }
   else {
       return "LOGISTICS ERROR";
   }
}

====================

main.cpp

====================

#include "resrcStack.h"

int main() {
   cout << "Establishing automated train system" << endl;
   resrcStack<string>* stack = new resrcStack<string>();
   cout << "Mining ores" << endl;
   stackNode<string>* ore = new stackNode<string>("Unrefined Ore", 10);
   cout << "Putting ores on stack" << endl;
   stack->push(ore);
   cout << "Current stack is:" << endl;
   stack->print();
   cout << "Required transport is: " << stack->determineTransportRequirement() << endl;
   cout << endl;

   cout << "Gathering wood" << endl;
   stackNode<string>* wood = new stackNode<string>("Logs", 45);
   cout << "Putting wood on stack" << endl;
   stack->push(wood);
   cout << "Current stack is:" << endl;
   stack->print();
   cout << "Required transport is: " << stack->determineTransportRequirement() << endl;
   cout << endl;

   cout << "Mining fuel" << endl;
   stackNode<string>* fuel = new stackNode<string>("Unrefined Oil", 70);
   cout << "Putting fuel on stack" << endl;
   stack->push(fuel);
   cout << "Current stack is:" << endl;
   stack->print();
   cout << "Required transport is: " << stack->determineTransportRequirement() << endl;
   cout << endl;

   cout << "First item on stack is: " << stack->peek()->getResrc() << endl;
   cout << "Removing first item from stack." << endl;
   stack->pop();
   cout << "Current stack is:" << endl;
   stack->print();

   return 0;
}

====================

stackNode.h

====================

#ifndef STACKNODE_H
#define STACKNODE_H
#include<iostream>
#include<string>
using namespace std;

// Defines a class Node
template <class T>
class stackNode {
private:
   T resrc;
   int quantity;
public:
   stackNode* next;
   stackNode(T i, int q) {
       resrc = i;
       quantity = q;
   }

   ~stackNode() {
       // why its deleting next node?
       // it should delete current node
       // delete next;
       // there is no dynamicaly assign memory in this class
       // so no deletion should be done
   }

   T getResrc() {
       return resrc;
   }

   int getQuantity() {
       return quantity;
   }
};
#endif

the stackNode class requires modification in its destructor , i have added comments in code.

let me know if have any doubts or problem running code.