Create a class "Person" with three member variables string first name, string last name, int age. The primary key will be the last name. User will be prompted with a menu with two options: 1, "Enter person", where they will enter the persons first name, last name and age, or 2, "View person list" where the person may view the information previously added.

Create a class "Person" with three member variables string first name, string last name, int age. The primary key will be the last name. User will be prompted with a menu with two options: 1, "Enter person", where they will enter the persons first name, last name and age, or 2, "View person list" where the person may view the information previously added.

C++ Programming: From Problem Analysis to Program Design

8th Edition

ISBN:9781337102087

Author:D. S. Malik

Publisher:D. S. Malik

Chapter17: Linked Lists

Section: Chapter Questions

Problem 13PE

See similar textbooks

Similar questions

In C++ Plz LAB: Grocery shopping list (linked list: inserting at the end of a list) Given main(), define an InsertAtEnd() member function in the ItemNode class that adds an element to the end of a linked list. DO NOT print the dummy head node. Ex. if the input is: 4 Kale Lettuce Carrots Peanuts where 4 is the number of items to be inserted; Kale, Lettuce, Carrots, Peanuts are the names of the items to be added at the end of the list. The output is: Kale Lettuce Carrots Peanuts ItemNode.h Default Code: #include <iostream>#include <string>using namespace std; class ItemNode {private:   string item;   ItemNode* nextNodeRef; public:   // Constructor   ItemNode() {       item = "";       nextNodeRef = NULL;   }    // Constructor      ItemNode(string itemInit) {       this->item = itemInit;       this->nextNodeRef = NULL;   }    // ConstructorItemNode(string itemInit, ItemNode *nextLoc) {this->item = itemInit;this->nextNodeRef = nextLoc;}    // Insert node after this…
C++ PROGRAMMINGTopic: Binary Search Trees Explain the c++ code below.: SEE ATTACHED PHOTO FOR THE PROBLEM INSTRUCTIONS It doesn't have to be long, as long as you explain what the important parts of the code do. (The code is already implemented and correct, only the explanation needed) #include "node.h" #include <iostream> using namespace std; class BTree {     node* root;     int size;     node* create_node(int num, node* parent) {         node* n = (node*) malloc( sizeof(node) );         n->element = num;         n->parent = parent;         n->right = NULL;         n->left = NULL;         return n;     }     public:     BTree() {         root = NULL;         size = 0;     }     node* left(node* p) {             return p->left;     }     node* right(node* p) {         return p->right;     }     node* sibling(node* p){         if(p != root){             node* P = p->parent;             if(P->left != NULL && P->right != NULL){…
C++ PROGRAMMINGTopic: Binary Search Trees Explain the c++ code below.: SEE ATTACHED PHOTO FOR THE PROBLEM INSTRUCTIONS It doesn't have to be long, as long as you explain what the important parts of the code do. (The code is already implemented and correct, only the explanation needed) #include "node.h" #include <iostream> using namespace std; class BTree {     node* root;     int size;     node* create_node(int num, node* parent) {         node* n = (node*) malloc( sizeof(node) );         n->element = num;         n->parent = parent;         n->right = NULL;         n->left = NULL;         return n;     }     public:     BTree() {         root = NULL;         size = 0;     }     node* left(node* p) {             return p->left;     }     node* right(node* p) {         return p->right;     }     node* sibling(node* p){         if(p != root){             node* P = p->parent;             if(P->left != NULL && P->right != NULL){…
C++ PROGRAMMINGTopic: Binary Search Trees Explain the c++ code below.: SEE ATTACHED PHOTO FOR THE PROBLEM INSTRUCTIONS It doesn't have to be long, as long as you explain what the important parts of the code do. (The code is already implemented and correct, only the explanation needed) EXPLAIN THE CODE BELOW: int childCount(node* p) { bool Cright = false; bool Cleft = false; if(p->right != NULL){ Cright = true; } if(p->left != NULL){ Cleft = true; } if(Cleft == true && Cright== true){ return 2; } if(Cright){ return 1; } if(Cleft){ return -1; } return 0; } int set(node* p, int e) { int elem = p->element; p->element = e; return elem; } node* addSibling(node* p, int e) { node* P = p->parent; if(P != NULL){ if(sibling(p) == NULL){…
C++ function Linked list Write a function, to be included in an unsorted linked list class, called replaceItem, that will receive two parameters, one called olditem, the other called new item. The function will replace all occurrences of old item with new item (if old item exists !!) and it will return the number of replacements done.
C++ PROGRAM Consider a single linked list. All parts of question refer to the following declaration. class Node { public: string Value; Node *Next; }; Node *Temp1; Node Temp2; Temp1 = new Node; Use Temp1 to assign the string "hello" to the Node object's Value data-member. Assuming that Temp1 points to a list of Nodes that looks like this: PIC ATTACHED Write code that will insert a new Node containing the value 7 into the list after the Node containing 6 and before the Node containing 12.You don’t need to write code that searches for the values 6 or 12 just use pointer values shown in the picture.
Programming in C: Challenge 1: Create and Print a Doubly Linked List In class, I briefly mentioned how to create a doubly linked list (a linked list with two directions: forward and backwards). This task challenges you to create a doubly linked list of 5 nodes. If your nodes were called n1, n2, n3, n4 and n5 (which they shouldn’t, please give them original names), your list should be linked as follows: We discussed what "start" and "end" should be. Then, also in main, you will have to print the list forwards by taking advantage of the arrows pointing to the right. You will also have to print it backwards taking advantage of the arrows pointing to the left. Again, everything must be done in main. Hint: look at the way in which I printed the singly linked list in class. In other words, if your nodes had the values: n1=1, n2=2, n3=3, n4=4 and n5=5; your program should print:1 3 5 2 4 (forwards) and 4 2 5 3 1 (backwards). Please give different values to your nodes, they should not have…
Exercise, maxCylinderVolume F# system function such as min or methods in the list module such as List.map are not allowed Write a function maxCylinderVolume that takes a list of floating-point tuples that represent dimensions of a cylinder and returns the volume of the cylinder that has the largest volume. Each tuple has two floating point values that are both greater than zero. The first value is the radius r and the second value is the height h. The volume of the cylinder is computed using ??2h. The value π is represented in F# with System.Math.PI. If the list is empty, return 0.0. Examples: > maxCylinderVolume [(2.1, 3.4); (4.7, 2.8); (0.9, 6.1); (3.2, 5.4)];;val it : float = 194.3137888> maxCylinderVolume [(0.33, 0.66)];;val it : float = 0.2257988304
in c++ A frequency table lists words and the number of times each word appears in a text file.Write a program that creates a frequency table for a file whose name is entered by theuser. You can use a map of string-int pairs. You may want to use the C library functionispunct() (in header file CTYPE.H) to check for punctuation so you can strip it off theend of a word, using the string member function substr(). Also, the tolower() functionmay prove handy for uncapitalizing words.
HELP Write C code that implements a soccer team as a linked list. 1. Each node in the linkedlist should be a member of the team and should contain the following information: What position they play whether they are the captain or not Their pay 2. Write a function that adds a new members to this linkedlist at the end of the list.
Data Structure Using C++ (Recursion) Need C++ Code ::: This is a one question >>> 6 function in one code ....... don't use cin please Write the following recursive functions once for an array and once for simply linked list (as member functions)1. to print all odd elements in backwards order.2. to count number of values that are below 10.3. to find maximum value. Run your functions on the following array 2,7,12,5,0,3,44,1,26and the following list 4,1,10,3,0,5,24,7,40 6 functions 3 for simply linked list and 3 for array
Data Structure Using C++ (Recursion) Need C++ Code ::: This is a one question >>> 6 function in one code ....... don't use cin please Write the following recursive functions once for an array and once for simply linked list (as member functions)1. to print all odd elements in backwards order.2. to count number of values that are below 10.3. to find maximum value. Run your functions on the following array 2,7,12,5,0,3,44,1,26and the following list 4,1,10,3,0,5,24,7,40 6 functions 3 for simply linked list and 3 for array like picture need please