Question

Build the following data structures in c++: STACK (Do not use the STL library for your containers)

C++

Stack and Queue should contain

• Insertion (Push/Enqueue)

• Deletion (Pop/Dequeue)

• Print/Display

• Sort (Stacks: Value or Color, Queue: Alphabetical)

• Search (Contains, position, and how many instances as three separate functions)

• Clear/empty

• Size (if empty, print that it’s empty)

0. Each data structure should contain a set of overloaded operators (Respect innate object behavior):

   • ‘+’ (addition) that allows you to add two objects of the same type together.

   • ‘++’ (increment) that adds a new node to the object and then fills it with a random value.

   • ‘—’ (decrement) that deletes a node from the object.

1. Fill the stack with 52 values representing cards in a deck, then print a 7-card hand.

Answer 1

#include "matrix.h"
using namespace std;
Matrix::Matrix()
{
row=2;
col=2;
init();
}

Matrix::Matrix(int r,int c)
{
row=r;
col=c;
init();
}

//will initialize 2d matrix
void Matrix::init()
{
mat = new double*[row];
for(int i = 0; i < row; ++i)
mat[i] = new double[col];
//setting all values to zero
for(int i=0;i<row;i++)
for(int j=0;j<col;j++)
mat[i][j]=0.1;
}

//copy constructor
Matrix::Matrix(const Matrix &mat2)
{
row=mat2.row;
col=mat2.col;
init();
}

//destructor
Matrix::~Matrix()
{
for(int i=0;i<row;i++)
{
delete mat[i];
}
delete mat;
}

// = operator overloading

void Matrix::operator = (const Matrix &mat2)
{
//delete current mat data
cout<<"enter";
for(int i=0;i<row;i++)
{
delete mat[i];
}
delete mat;
  
//assign new values;
row=mat2.row;
col=mat2.col;
//create new **mat using current value of row and col
init();
  
for(int i=0;i<row;i++)
for(int j=0;j<col;j++)
{ mat[i][j]=mat2.mat[i][j];
cout<<mat2.mat[i][j];
}
}

//overloading + operator
Matrix Matrix::operator + (const Matrix &obj)
{
Matrix result=;
if(row!=obj.row or col!=obj.col)
{
return Matrix(0,0);
}
else
{

for(int i=0;i<row;i++)
for(int j=0;j<col;j++)
{ result.mat[i][j]=mat[i][j]+obj.mat[i][j];
  
// cout<<result.mat[i][j];
}
  
}
result.printValue();
return result;
}

//return row and columns
int* Matrix::getDimensions()
{
int* dimensions=new int[2];
dimensions[0]=row;
dimensions[1]=col;
}

bool Matrix::setVaule(double val,int rowNo,int colNo)
{
if(rowNo<row && colNo<col)
{
mat[rowNo][colNo]=val;
return true;
}
else
{
cout<<"dimensions out of range."<<endl;
return false;
}
}

//return value of matrix a given row and col no
double Matrix::getValue(int rowNo,int colNo)
{
if(rowNo<row && colNo<col)
{
return mat[rowNo][colNo];
}
else
{
cout<<"dimensions out of range."<<endl;
return -1.0;
}
return -1.0;
}

//search for values and return [row,col]

int * Matrix::search(double val)
{
int* dimensions=new int[2];
dimensions[0]=-1;
dimensions[1]=-1;
for(int i=0;i<row;i++)
for(int j=0;j<col;j++)
{
if(mat[i][j]==val)
{
dimensions[0]=i;
dimensions[1]=j;
}
}
return dimensions;
}


void Matrix::printValue()
{
for(int i=0;i<row;i++)
{
for(int j=0;j<col;j++)
{
cout<<mat[i][j]<<" ";
}
cout<<endl;
}
}