Question

Write in C++ please:

Write a class named MyVector using the following UML diagram and class attribute descriptions. MyVector will use a linked listed instead of an array. Each Contact is a struct that will store a name and a phone number. Demonstrate your class in a program for storing Contacts. The program should present the user with a menu for adding, removing, and retrieving Contact info. MyVector Contact name: string phone: string next: Contact -head: Contact -tail: Contact -list_size: int +MyVector(): |MyVector() +push_back(name: string, phone: string): void +remove(name: string, phone: string): void +get(name: string): string +clear): void +size():int Class Attributes: Contact: a private struct that contains the following three fields: o name: a string variable for storing a Contact's name. o phone: a string variable for storing a Contact's phone number. o next: a self referencing pointer. head: a private Contact node pointer for storing the memory address of the first Contact node in the list. tail: a private Contact node pointer for storing the memory address of the last Contact node in the list. list_size: a private int variable that stores the number of Contact nodes in the list. MyVector: The constructor. It sets list_size to 0 and head and tail to null. MyVector: The destructor. This frees the memory all memory used by the list. push_back: This public method accepts the name and phone number of a contact as it's only arguments. If there is enough room, it adds the Contact to the end of the list of Contacts. Updates list_size as needed. Executes in constant (O(1)) time. Class Attributes: Contact: a private struct that contains the following three fields: o name: a string variable for storing a Contact's name. o phone: a string variable for storing a Contact's phone number. o next: a self referencing pointer head: a private Contact node pointer for storing the memory address of the first Contact node in the list. tail: a private Contact node pointer for storing the memory address of the last Contact node in the list. list_size: a private int variable that stores the number of Contact nodes in the list. MyVector: The constructor. It sets list_size to 0 and head and tail to null MyVector: The destructor. This frees the memory all memory used by the list push_back: This public method accepts the name and phone number of a contact as it's only arguments. If there is enough room, it adds the Contact to the end of the list of Contacts. Updates list_size as needed. Executes in constant (O(1)) time. remove: This public method accepts two strings as it's only arguments. This method then searches the Contacts list for a matching name or phone number or both. If found, the matching Contact is "removed" from the list and updates the list_size variable get: This public method accepts the name of a Contact as it's only argument. It then searches the Contacts list for a match. If it finds one, it returns the phone number for that contact as a string, otherwise, it returns the string "NOT FOUND". clear: This public method clears the Contacts list by freeing all memory used by the list and resetting head and tail to null. size: returns the number of Contacts in the list as an integer. No method interacts with the user so no cin or cout statements. The main) function is responsible for interacting with the user Your submission must compile and run. If it does not, it will get 0 points. A 20-Point Sample Run: Run 1: (A)dd Contact |(C)lear Contacts (F)ind Contact (Q)uit |(R) emove Contact [ACFQR] a Enter name: Paul Enter phone: 555-775-1234 |(A)dd Contact |(C)lear Contacts (F)ind Contact (Q)uit (R)emove Contact [ACFQR]: Run 2: |(A)dd Contact |(C)lear Contacts |(F)ind Contact |(Q)uit |(R)emove Contact [ACFQR] f Enter name: Paul 555-775-1234 |(A)dd Contact |(C)lear Contacts |(F)ind Contact |(Q) uit |(R)emove Contact [ACFQR]: Run 3: |(A)dd Contact |(C)lear Contacts (F)ind Contact |(e)uit (R) emove Cont act [ACFQR] c |(A)dd Contact |(C)lear Contacts (F)ind Contact |(e)uit |(R)emove Contact [ACFQR]: f Enter name: Paul NOT FOUND |(A)dd Contact |(C)lear Contacts |(F)ind Contact |(0)uit (R) emove Contact [ACFQR]: Run 4: [ACFQR] a Enter name: Tom Enter phone : 510-555-5309 |(A)dd Contact (C)lear Contacts (F)ind Contact |(Q)uit (R)emove Contact [ACFQR] r Enter the nameor |(A)dd Contact (C)lear Contacts |(F)ind Contact (Q)uit (R)emove Contact number of a contact to remove : 510-555-5309 [ACFQR]: f Enter name: Tom NOT FOUND |(A)dd Contact |(C)lear Contacts (F)ind Contact (Q)uit (R)emoveContact [ACFQR]

Answer 1

Class Interface

#ifndef MyVector_Included
#define MyVector_Included

#include <string>
using namespace std;

struct Contact{
   string name;
   string phone;
   Contact* next;
};

class MyVector {
public:
   MyVector();
   ~MyVector();
   void push_back(string name1, string phone1);
   void remove(string name1, string phone1);
   string get(string name1);
   void clear();
   int size();
  
private:
   Contact* head;
   Contact* tail;
   int list_size;
};

#endif

Class Implementation

#include "MyVector.h"

MyVector::MyVector() {
   list_size = 0;
   head = NULL;
   tail = NULL;
}

MyVector::~MyVector() {
   clear();
}

void MyVector::push_back(string name1, string phone1) {
   if (list_size == 0) {
       head = new Contact;
       tail = new Contact;
   }
   Contact* newTail = new Contact;
   newTail->name = name1;
   newTail->phone = phone1;
   tail->next = newTail;
   tail = newTail;
   if (list_size == 0)
       head = tail;
   list_size++;
}

void MyVector::remove(string name1, string phone1) {
   if (list_size == 0) {
       return;
   }
   if (list_size == 1) {
       if (head->name == name1 || head->phone == phone1) {
           delete head;
           head = NULL;
           tail = NULL;
           list_size--;
           return;
       }
   }
   list_size--;
   if (head->name == name1 || head->phone == phone1) {
       Contact* toDelete = head;
       head = head->next;
       delete toDelete;
       return;
   }
   Contact* head1 = head;
   Contact* previous = NULL;
   while (head1->next != NULL) {
       if (head1->next->name == name1 || head1->next->phone == phone1) {
           Contact* toDelete = head1->next;
           head1->next = head1->next->next;
           delete toDelete;
           return;
       }
       previous = head1;
       head1 = head1->next;
   }
   if (head1->next->name == name1 || head1->next->phone == phone1) {
       delete head1;
       tail = previous;
   }
}

string MyVector::get(string name1) {
   Contact* head1 = head;
   while (head1 != NULL) {
       if (head1->name == name1) {
           return head1->phone;
       }
       head1 = head1->next;
   }
   return "NOT_FOUND";
}

void MyVector::clear() {
   if (list_size == 0)
       return;
   while (head != NULL) {
       Contact* current = head;
       head = head->next;
       delete current;
   }
   list_size = 0;
   head = NULL;
   tail = NULL;
}

int MyVector::size() {
   return list_size;
}

Main function

#include <iostream>
#include "MyVector.h"
using namespace std;

int main () {
  
   MyVector vector = MyVector();
   while (true) {
       cout << "(A)dd Contacts" << endl;
       cout << "(C)lear Contacts" << endl;
       cout << "(F)ind Contact" << endl;
       cout << "(Q)uit" << endl;
       cout << "(R)emove Contact" << endl;
       cout << endl;
       cout << "[ACFQR]: ";
       char choice;
       cin >> choice;
       cout << endl;
       if (choice == 'a') {
           string name, phone;
           cout << "Enter name: ";
           cin >> name;
           cout << endl;
           cout << "Enter phone: ";
           cin >> phone;
           cout << endl;
           vector.push_back(name, phone);
       } else if (choice == 'c') {
           cout << endl;
           vector.clear();
       } else if (choice == 'f') {
           string name;
           cout << "Enter name: ";
           cin >> name;
           cout << vector.get(name) << endl;
       } else if (choice == 'q') {
           break;
       } else if (choice == 'r') {
           string nameOrPhone;
           cout << "Enter the name or number of a contact to remove: ";
           cin >> nameOrPhone;
           vector.remove(nameOrPhone, nameOrPhone);
       }
   }

   return 0;
}

|(A)dd Contacts |(C)lear Contacts |(F) ind Contact |(Q)uit (R) emove Contact [ACFQR]: a Enter name: Paul Enter phone: 555-775-1234 (A)dd Contacts (C)lear Contacts (F)ind Contact (Q)uit (R)emove Contact [ACFQR]: f Enter name: Paul 555 - 775 - 1234 (A)dd Contacts (C)lear Contacts (F)ind Contact (Q)uit (R)emove Contact [ACFQR]: r

Enter the name or number of a contact to remove: Paul (A)dd Contacts (C)lear Contacts (F)ind Contact (Q)uit (R)emove Contact [ACFQR] f Enter name: Paul NOT_FOUND (A)dd Contacts |(C)lear Contacts |(F)ind Contact (Q)uit (R)emove Contact [ACFQR]:

comment down for any queries

please give a thumbs up