Starting Out with C++ from Control Structures to Objects, Student Value Edition (9th Edition)
9th Edition
ISBN: 9780134443829
Author: Tony Gaddis
Publisher: PEARSON
expand_more
expand_more
format_list_bulleted
Concept explainers
Question
Chapter 18, Problem 10PC
Program Plan Intro
Payroll Modification
Program Plan:
LinkedList.h:
- Include the required specifications into the program.
- Define a class template named “LinkedList”.
- Declare the member variables “value” and “*next” in structure named “ListNode”.
- Declare the pointer variables “head” and “placeHolder” for the structure.
- Declare the constructor, copy constructor, destructor, and member functions in the class.
- Declare a class template and define a function named “appendNode()” to insert the node at end of the list.
- Declare the structure pointer variables “newNode” and “nodePtr” for the structure named “ListNode”.
- Assign the value “newValue” to the variable “newNode” and assign null to the variable “newNode”.
- Using “if…else” condition check whether the list to be empty or not, if the “head” is empty and make a new node into “head” pointer. Otherwise, make a loop find last node in the loop.
- Assign the value of “nodePtr” into the variable “newNode”.
- Declare a class template and define a function named “displayList()” to print the values in the list.
- Declare the structure pointer “nodePtr” for the structure named “ListNode”.
- Initialize the variable “nodePtr” with the “head” pointer.
- Make a loop “while” to display the values of the list.
- Declare a class template and define a function named “insertNode()” used to insert a value into the list.
- Declare the structure pointer variables “newNode”, “nodePtr”, and “previousNode” for the structure named “ListNode”.
- Make a “newNode” value into the received variable value “newValue”.
- Using “if…else” condition to check whether the list is empty or not.
- If the list is empty then initialize “head” pointer with the value of “newNode” variable.
- Otherwise, make a “while” loop to test whether the “newValue” value is less than the list values or not.
- Use “if…else” condition to initialize the value into list.
- Declare a class template and define a function named “deleteNode()” to delete a value from the list.
- Declare the pointer variables “nodePtr”, and “previousNode” for the structure named “ListNode”.
- Using “if…else” condition to check whether the “head” value is equal to “newValue” or not.
- Initialize the variable “nodePtr” with the value of the variable “head”.
- Remove the value using “delete” operator and reassign the “head” value into the “nodePtr”.
- If the “newValue” value not equal to the “head” value, then define the “while” loop to assign the “nodePtr” into “previousNode”.
- By using “if” condition, delete the “previousNode” pointer.
- Define the destructor to destroy the values in the list.
- Declare the structure pointer variables “nodePtr”, and “nextNode” for the structure named “ListNode”.
- Initialize the “head” value into the “nodePtr”.
- Define a “while” loop to make the links of node into “nextNode” and remove the node using “delete” operator.
- Declare a class template and define a function named “getFirst()” to get a first value from the list.
- Declare a variable “status” in type of “boolean” and initialize the “head” value into the “placeHolder”.
- Change the value of “status” into “true”, if the value available in “placeHolder”.
- Return the value of “status” into called function.
- Declare a class template and define a function named “getNext()” to get a another value from the list.
- Declare a variable “status” in type of “boolean”.
- Initialize the next node value of “placeHolder” into “placeHolder”.
- Change the value of “status” into “true”, if the next node value available in “placeHolder”.
- Return the value of “status” into called function.
main.cpp:
- Include the required header files into the program.
- Declare the function prototypes to get employee information from user.
- In “main()” function, create a object for “LinkedList” template class.
- Define the function named “getEmployeeIds()” with an object of “LinkedList” class.
- Declare the variable named “anotherOne” and initialize it as “y”.
- Declare the variable named “id” in type of “long”.
- Make a call to the function “appendNode()” with value of “id”.
- Prompt the user to get another value from user.
- Define the function named “getEmployeeInfo()” with an object of “LinkedList” class.
- Declare the variables named “idNum”, “hours”, “payRate”, and “grossPay”.
- Using “if…else” condition check whether the list is empty or not.
- If list contains data, make a call to a function “getData()” to get the values from user.
- Make a call to “appendNode” using objects; insert the values into the list.
- Otherwise, display appropriate message on the screen.
- If list contains data, make a call to a function “getData()” to get the values from user.
- Define the function named “getData()” with an arguments.
- Prompt and get the values of “hours” and “payRate” from user to calculate the value of “grossPay”.
- Define the function named “displayWages()” with an objects for linked list.
- Declare the variables for the method.
- Using “while” loop to display all values from the list.
Expert Solution & Answer
Want to see the full answer?
Check out a sample textbook solutionStudents have asked these similar questions
Question:
struct node { char *name; int marks; node *next; }; By using the above declaration for the Linked List, write a program in C++ to display the summary report regarding the pass/fail ratio of the subject Data Structure for the class BSI-3 that have only 15 students. The required Report Summary for the exam will be like wise: The No. of A grades........??? The No. of B grades........??? And so on by applying the grading criteria of COMSATS-University Islamabad. Question:
struct node { char *name; int marks; node *next; }; By using the above declaration for the Linked List, write a program in C++ to display the summary report regarding the pass/fail ratio of the subject Data Structure for the class BSI-3 that have only 15 students. The required Report Summary for the exam will be like wise: The No. of A grades........??? The No. of B grades........??? And so on by applying the grading criteria of COMSATS-University Islamabad.
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.
Data Structure Using C++ (Recursion) Need C++ Code :::
DON'T USE STACK PLEASE JUST Recursion
This is a one question >>> 6 function in one code ....... don't use cin please
Without using stack just Recursion 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
Chapter 18 Solutions
Starting Out with C++ from Control Structures to Objects, Student Value Edition (9th Edition)
Ch. 18.1 - Prob. 18.1CPCh. 18.1 - Prob. 18.2CPCh. 18.1 - Prob. 18.3CPCh. 18.1 - Prob. 18.4CPCh. 18.2 - Prob. 18.5CPCh. 18.2 - Prob. 18.6CPCh. 18.2 - Prob. 18.7CPCh. 18.2 - Prob. 18.8CPCh. 18.2 - Prob. 18.9CPCh. 18.2 - Prob. 18.10CP
Ch. 18 - Prob. 1RQECh. 18 - Prob. 2RQECh. 18 - Prob. 3RQECh. 18 - Prob. 4RQECh. 18 - Prob. 5RQECh. 18 - Prob. 6RQECh. 18 - Prob. 7RQECh. 18 - Prob. 8RQECh. 18 - Prob. 9RQECh. 18 - Prob. 10RQECh. 18 - Prob. 11RQECh. 18 - Prob. 12RQECh. 18 - Prob. 13RQECh. 18 - Prob. 14RQECh. 18 - Prob. 15RQECh. 18 - Prob. 16RQECh. 18 - Prob. 17RQECh. 18 - Prob. 18RQECh. 18 - Prob. 19RQECh. 18 - Prob. 20RQECh. 18 - Prob. 21RQECh. 18 - Prob. 22RQECh. 18 - Prob. 23RQECh. 18 - Prob. 24RQECh. 18 - Prob. 25RQECh. 18 - T F The programmer must know in advance how many...Ch. 18 - T F It is not necessary for each node in a linked...Ch. 18 - Prob. 28RQECh. 18 - Prob. 29RQECh. 18 - Prob. 30RQECh. 18 - Prob. 31RQECh. 18 - Prob. 32RQECh. 18 - Prob. 33RQECh. 18 - Prob. 34RQECh. 18 - Prob. 35RQECh. 18 - Prob. 1PCCh. 18 - Prob. 2PCCh. 18 - Prob. 3PCCh. 18 - Prob. 4PCCh. 18 - Prob. 5PCCh. 18 - Prob. 6PCCh. 18 - Prob. 7PCCh. 18 - List Template Create a list class template based...Ch. 18 - Prob. 9PCCh. 18 - Prob. 10PCCh. 18 - Prob. 11PCCh. 18 - Prob. 12PCCh. 18 - Prob. 13PCCh. 18 - Prob. 14PCCh. 18 - Prob. 15PC
Knowledge Booster
Learn more about
Need a deep-dive on the concept behind this application? Look no further. Learn more about this topic, computer-science and related others by exploring similar questions and additional content below.Similar questions
- Topic: Singly Linked ListImplement the following functions in C++ program. Read the question carefully. (See attached photo for reference) int removeAt(int pos) Removes the number in the posth position of the list and returns the element removed. Performing removeAt(3) in the example list will remove the 3rd element of the linked list and the updated list will be: 10 -> 30 -> 50 When the value of pos is greater than the size or less than one, return -1. int removeAll(int num) Removes all instances of num in the linked list and returns the number of instances removed. In this list 10 -> 10 -> 20 -> 30 -> 10, performing removeAll(10) will remove all three 10's and the list will look like this: 20 -> 30. Then, it will return the number of instances removed, in this case, 3. int contains(int num) This will return the position of the first instance of the element num in the list. If num is not found, return 0. In the example, having the method contains(30) will…arrow_forwardData 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 arrayarrow_forwardData 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 pleasearrow_forward
- 1- Programming Problem Part 1 Write a function that will have a list as an input, the task of the function is to check if all the elements in the list are unique,( i.e. no repetition of any value has occurred in the list), then the function returns true otherwise it returns false. Your program should include a main method that call the method to test it. (If you would use built-in functions in Python, use lists’ or dictionaries’ methods as we studied their time efficiency in class)arrow_forwardSum Lists' in Scheme; Write a function named sum-lists in Scheme that takes two lists as input and returns a new list containing the sum of each corresponding pair of elements. You may assume that the lists have the same length. For example, (sum-lists '(1 2 3 4) '(5 6 7 8)) should return '(6 8 10 12) (every-other '() '()) should return '()arrow_forwardCount dominators def count_dominators(items): An element of items is said to be a dominator if every element to its right (not just the one element that is immediately to its right) is strictly smaller than it. By this definition, the last item of the list is automatically a dominator. This function should count how many elements in items are dominators, and return that count. For example, dominators of [42, 7, 12, 9, 13, 5] would be the elements 42, 13 and 5. Before starting to write code for this function, you should consult the parable of "Shlemiel the painter" and think how this seemingly silly tale from a simpler time relates to today's computational problems performed on lists, strings and other sequences. This problem will be the first of many that you will encounter during and after this course to illustrate the important principle of using only one loop to achieve in a tiny fraction of time the same end result that Shlemiel achieves with two nested loops. Your workload…arrow_forward
- C++ PROGRAMMING (Linked list) complete the functions: You have to continue on implementing your Array List namely the following functions: Example ArrayList: [10, 30, 40, 50] void addAt(int num, int pos) This method will add the integer num to the posth position of the list. Performing addAt(20, 2) in the example list will add 20 at the 2nd position and the array will now look like this: [10, 20, 30, 40, 50] When the value of pos is greater than the size + 1 or less than one, output "Position value invalid" void removeAt(int pos) Removes the number in the posth position of the list. Performing removeAt(3) in the example list will remove the 3rd element of the list and the updated array will be: [10, 30, 50] When the value of pos is greater than the size or less than one, output "Position value invalid" My incomplete code: #include <cstdlib>#include <iostream>using namespace std; class ArrayList : public List { // : means "is-a" / extend int* array; int index;…arrow_forwardProgramming 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…arrow_forwardImplement the following function using C++ remove_redundant() This method will clear out the duplicate numbers in your linked list. It is also imperative that you will use an instance of this Linked List class to hold the numbers that you have already checked and use the methods in this instance. In the example 10 -> 10 -> 20 -> 30 -> 10, calling remove_redundant() will remove the other 2 10's that occurred later, hereby making the list 10 -> 20 -> 30. Limitation: You cannot have a nested loop here nor use methods that employ loops as the performance of our linked list will suffer.arrow_forward
- Code in Perl Create an array which holds a list of Video Games, consisting of title, the year it was released (guess if you don’t know) , platform (NES, XBOX One, etc) and publisher (in that order). Add at least ten albums to the list. Then, use the split function and a for or foreach loop to display the publisher followed by the title and platform for each list element.arrow_forwardTopic: Singly Linked ListImplement the following functions in C++ program. Read the question carefully. Below is the "CODE THAT NEEDS TO BE IMPROVED" or "NOT FINAL CODE" (See attached photo for reference) bool addAt(int num, int pos) This method will add the integer num to the posth position of the list and returns true if the value of pos is valid. Performing addAt(20, 2) in the example list will add 20 at the 2nd position and the linked list will now look like this: 10 -> 20 -> 30 -> 40 -> 50. When the value of pos is invalid i.e. greater than the size + 1 or less than one, return false. bool addAt(int num, int pos) { if (pos == 1) { // case 1: addHead addHead(num); return true; } if (pos == index + 1) { // case 3: addTail addTail(num); return true; } node* currnode = head; //addAt(20, 3) int count = 0; while (currnode…arrow_forwarddef normal (L): '' '(list of int) -> list Precondition: len (L)> = 1 This function must return a new list R which has the same contents of L except where there is a sequence of consecutive zeros, the list R must have only one zero such that in the examples: >>> normal ([1,2,0,0,0,3,0]) [1, 2, 0, 3, 0] >>> normal ([1,2,0,0,0,3,0,0,0,0]) [1, 2, 0, 3, 0] >>> normal ([0,0,1,0,2,0,0,0,3,0,0,0,0,0]) [0, 1, 0, 2, 0, 3, 0] >>> normal ([1,2,2,0,3,3,3,0]) [1, 2, 2, 0, 3, 3, 3, 0] '' ' [1, 2, 0, 3, 0] >>> tanganyika([1,2,0,0,0,3,0,0,0,0]) [1, 2, 0, 3, 0] >>> tanganyika([0,0,1,0,2,0,0,0,3,0,0,0,0]) [0, 1, 0, 2, 0, 3, 0] >>> tanganyika([1,2,2,0,3,3,3,0]) [1, 2, 2, 0, 3, 3, 3, 0] ''' Please: Do not use dictionaries.- Do not use sets- Do not use 'break'.- You cannot import a library or other modulearrow_forward
arrow_back_ios
SEE MORE QUESTIONS
arrow_forward_ios
Recommended textbooks for you
- C++ Programming: From Problem Analysis to Program...Computer ScienceISBN:9781337102087Author:D. S. MalikPublisher:Cengage LearningProgramming Logic & Design ComprehensiveComputer ScienceISBN:9781337669405Author:FARRELLPublisher:CengageSystems ArchitectureComputer ScienceISBN:9781305080195Author:Stephen D. BurdPublisher:Cengage Learning
- C++ for Engineers and ScientistsComputer ScienceISBN:9781133187844Author:Bronson, Gary J.Publisher:Course Technology Ptr
C++ Programming: From Problem Analysis to Program...
Computer Science
ISBN:9781337102087
Author:D. S. Malik
Publisher:Cengage Learning
Programming Logic & Design Comprehensive
Computer Science
ISBN:9781337669405
Author:FARRELL
Publisher:Cengage
Systems Architecture
Computer Science
ISBN:9781305080195
Author:Stephen D. Burd
Publisher:Cengage Learning
C++ for Engineers and Scientists
Computer Science
ISBN:9781133187844
Author:Bronson, Gary J.
Publisher:Course Technology Ptr