I need some help and i need it in c++ for zybooks 14-CS 210 PrograxAnewered Vou will be buildingHomeok/SNHUCS210v2/chapter/10/section/14Mail - Eddy, Mattheg Languages home > 10 14 LAB Warm up Contacts3) in main) prompt the user for three contacts and outpur me users input rere tnree CoOCITVlist (2 pts)ExPerson 1Enter name:Roxanne lughesEnter phone number:443-555-2864You entered: Roxanne Hughes, 143 555-2864Person 2Enter nama:Juan Aiberto Jr.Enter phone number:410-555-9385You entered: Juan Alberto Jr., 410-555-9385Person 3Enter name:Rachel PhillipsEnter phone number:310-555-661oYou entered: Rachel Phillips, 310-555-6610(4) Output the linked list. (2 pts)ExCONTACT LISTName: Roxanne HughesPone number: 443-555-2864Mama: Juan Alberto JE.Pone number: 410-555-9385Nama: Rachel Phillipshp CS 210 PrograSNHUCS210v2/chapter/10/section/14Mal - Eddy, Mattheanguages home > 10.14. LAB Warm up Contacts10 1310.14 LAB: Warm up: ContactsYou will be building a linked list Make sure to keep treck of both the head and tail nodes(1) Create three files to submit.• ContactNodeh-Class declaration• ContactNode.cpp Class definition• main.cpp - main() function(2) Build the ContactNode class per the following specifications:• Parameterized constructor. Parameters are name followed by phone number• Public member functions• InsertAfter() (2 pts)o GetName() - Accessor (1 pt)• GetPhoneNumber - Accessor (1 pt)• GetNext() - Accessor (1 pt)• PrintContactNode()• Private data memberso string contactName• string contactPhoneNum• ContactNode* nextNodePtrEx, of PrintContactNode() outputName: Roxanne HughesPhone number: 443-555-2864(3) in main), prompt the user for three contacts and output the user's input. Create three ContactNodes anlist (2 pts)hp

anguages home > 10 14 LAB Warm up Contacts TIn main.prompt the user tor three contacTS and outpuT me users mpUT are reco list (2 pts) Ex Pernon 1 Enter name: Hoxanne Hughes Enter phoneo numbor: 443-555-2864 You entered: Roxanne tughes, 143 555-2864 Person 2 Enter nama: Juan Alberta Jr. Enter phone number: 410-555-9385 You entered: Juan Alberto r., 410-555-9385 Person 3 Enter nane: Rachel Phillips Rnter phone number: 310-555-6610 You entered: Rachel Phillips, 310-555-6610 (4) Output the linked list (2 pts)

anguages home > 10 14 LAB Warm up Contacts TIn main.prompt the user tor three contacTS and outpuT me users mpUT are reco list (2 pts) Ex Pernon 1 Enter name: Hoxanne Hughes Enter phoneo numbor: 443-555-2864 You entered: Roxanne tughes, 143 555-2864 Person 2 Enter nama: Juan Alberta Jr. Enter phone number: 410-555-9385 You entered: Juan Alberto r., 410-555-9385 Person 3 Enter nane: Rachel Phillips Rnter phone number: 310-555-6610 You entered: Rachel Phillips, 310-555-6610 (4) Output the linked list (2 pts)

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 18SA

See similar textbooks

Similar questions

1) When an allocator gets a request for nn bytes and finds a block of size mm, if m > nm>n then the block must be split. True or False 2) Coalescing refers to moving allocated blocks to create larger regions of free space. True or False 3) Segregated free lists divide blocks into different size classes, but some classes may contain more than one block size. True or False
Suppose R1 contains a pointer to a node. Which of the following will release this node by inserting it into the avail list? Select one: a. lea R2,avail[R0] store R2,1[R1] store R1,avail[R0] b. load R2,avail[R0] lea R2,1[R1] store R1,avail[R0] c. load R2,avail[R0] R2,1[R1] store R1,avail[R0]
Write code to partition a linked list around a value x, such that all nodes less than x comebefore all nodes greater than or equal to x. If x is contained within the list the values of x only needto be after the elements less than x (see below). The partition element x can appear anywhere in the"right partition"; it does not need to appear between the left and right partitions.EXAMPLEInput: 3 -> 5 -> 8 -> 5 -> 10 -> 2 -> 1 [partition= 5]Output: 3 -> 1 -> 2 -> 10 -> 5 -> 5 -> 8
During the sockets lab we cast the second parameter from a struct sockaddr_in to a struct sockaddr. struct sockaddr_in address; /* ... */ bind(server_fd, (struct sockaddr*)&address, sizeof(address)) This provides a limited form of polymorphism: bind only needs the first few fields of its struct, and both struct sockaddr_in and struct sockaddr have the same fields at those addresses. Consider the following example: typedef struct { float x; float y; float z; } point3D; typedef struct { float x; float y; } point2D; float distance(point2D *a1, point2D *a2) { /* ... */ } int main() { point2D a = { .x = 2.1, .y = 3.0 }; point3D b = { .x = 4.1, .y = 4.3, .z = 4.0 }; // Call distance function with a and b } How would you pass a and b to the distance function? If several work, pick one that will not create warnings. A. distance(a, b); B. distance(a, (point2D)b); C. distance(&a, &b); D. distance(&a, &(point2D)b); E. distance(&a, (point2D*)&b); F. none of…
Project 2 Use Netbeans, to write a simple java program using the following data structures: 1. Stack by Linked List2. Circular Queue by Array The program should implement the following functions: 1. Insert2. Read/Print3. Remove an item4. Delete (the entire list) On the initial start of the program, users should be prompted for at least five elements into the list. After which they should be presented with options that will allow them to perform the functions defined above. Note that exception handling must be implemented. Screenshots of the cods as proof of its implementation should be included
The People class holds an unsorted list of humans. Initially, this list is empty. Existing Human objects may be added to the list using an insert method. Upon inserting a Human object, it is added to the array at the next available position and the position value in incremented. If the position value is equal to the size value, do not insert the Human. Instead, throw an exception that your driver can catch to print an error that the People object is full. Create a People class with the following features: Each People object has a statically allocated array of Human objects. Size attribute representing the maximum size of the array. Position attribute representing the next free position in the array. Default constructor with no arguments. Search method that takes a string argument and returns a Human object. This method returns the first Human object with a name matching the string argument. In other words, pass the name of a Human as a string, search the list of humans for…
Please do not copy from chegg. C++ Dividing a linked list into two sublists of almost equal sizes Add the operation divideMid to the class ListData in Chapter17.cpp on Canvas as follows: void divideMid(ListData &sublist); //This operation divides the given list into two sublists //of (almost) equal sizes. //Postcondition: first points to the first node and last // points to the last node of the first sublist. // sublist.first points to the first node // and sublist.last points to the last node // of the second sublist. Consider the following statements: ListData myList; ListData subList; Suppose myList points to the list with elements 34 65 27 89 12 (in this order). The statement: myList.divideMid(subList); divides myList into two sublists: myList points to the list with the elements 34 65 27, and subList points to the sublist with the elements 89 12. Write the definition of the function template to implement the operation divideMid. chapter 17.cpp #include…
python 8.7 LAB: Writing append and search methods (singly-linked list)Given main.py and a Node class in Node.py, complete the LinkedList class in LinkedList.py by writing the append() and search() methods. The search() method should return the Node whose data value matches a given key, and None if the key is not found. The search() method should also set the position of each Node searched in the LinkedList, starting with 1. Ex: If the input is: 12 23 59 37 923 212the output is: 12 found in list at position 1.If the input is: 12 23 59 37 923 268the output is: 68 not found in list.
1.3.14 Create a class called ResizingArrayQueueOfStrings that implements the queue abstraction using a fixed-size array. Then, as an extension, utilise array resizing in your implementation to get rid of the size restriction. 1.3.15 If standard input contains k or more strings, create a Queue client that accepts the command-line argument k and outputs the kth string from the last string located there.
Assume a linked list contains following integers: 7, 2, 9, 5, 8, 3, 15 and the pointer head is pointing to the first node of the list. What will be the value of variable a after the following statements are executed: Node<int> *curNode=head; int a; while(curNode->getNext()!=NULL){ { curNode=curNode->getNext(); } a=curNode->getItem(); A. 15 B. 7 C. 49 D. 3
1. Show the ListStackADT<T> interface 2. Create a ListStackDataStrucClass<T> with the following methods: defaultconstructor, overloaded constructor, copy constructor, getTop, setTop,isEmpty, ifEmpty (if empty throw the exception), push, peek, pop, toString. 3. Create a private inner class of ListStack<T> called StackNode<T> with thefollowing methods: default constructor, overloaded constructor, copyconstructor, getValue, getNext, setValue, setNext 4. Create a BaseConverter class (non-generic) with the following methods: defaultconstructor, inputPrompt, convert [converts a BaseNumber to a convertedString], convertAll [instantiate a String object] , toString, processAndPrint 5. Create a private inner class BaseNumber. The inner class has the following methods: default constructor, overloaded constructor, getNumber, getBase,setNumber, setBase. [Make your private instance variables in the inner classLong type]. 6. Create a BaseConverterDemo class that only…
Extend the class linkedListType by adding the following operations:a. Write a function that returns the info of the kth element of the linkedlist. If no such element exists, terminate the program.b. Write a function that deletes the kth element of the linked list. If nosuch element exists, output an appropriate message. Provide the definitions of these functions in the class linkedListType. Also writea program to test these functions. (Use either the classunorderedLinkedList or the class orderedLinkedList to testyour function.) Note: Code in c++