Starting Out with C++: Early Objects
8th Edition
ISBN: 9780133360929
Author: Tony Gaddis, Judy Walters, Godfrey Muganda
Publisher: Addison-Wesley
expand_more
expand_more
format_list_bulleted
Textbook Question
Chapter 17, Problem 10RQE
Write a function
void printSecond(ListNode *ptr}
that prints the value stored in the second node of a list passed to it as parameter. The function should print an error message and terminate the
Expert Solution & Answer
Want to see the full answer?
Check out a sample textbook solutionStudents have asked these similar questions
Write a function set_elements() that assigns 1 to the last and fifth elements of a list parameter.
Ex: If the input is:
One man's trash is another man's treasure
then the output is:
['One', "man's", 'trash', 'is', 1, "man's", 1]
''' Your code goes here '''
vals_to_update = input().split()
set_elements(vals_to_update)
print(vals_to_update)
this code should be in python:
write a function that receives a list as its only parameter. Inside the function remove all the duplicate items from the list and returns a new list. For Example: If we call the function with [“dad”, “aunt”, “mom”, “sister”, “mom”] as its input, the returned value should be [“dad”, “aunt”, “mom”, “sister”]. The order of the items inside the returned list does not matter.
Write a function getOdds() that takes a list of integer numbers as parameter, returns a new list made of only the odd numbers in the list.Example: If the parameter list contains [44, 81, 7, 24], the function will return [81, 7].
Chapter 17 Solutions
Starting Out with C++: Early Objects
Ch. 17.1 - Prob. 17.1CPCh. 17.1 - Prob. 17.2CPCh. 17.1 - Prob. 17.3CPCh. 17.1 - Prob. 17.4CPCh. 17.2 - Prob. 17.5CPCh. 17.2 - Prob. 17.6CPCh. 17.2 - Why does the insertNode function shown in this...Ch. 17.2 - Prob. 17.8CPCh. 17.2 - Prob. 17.9CPCh. 17.2 - Prob. 17.10CP
Ch. 17 - Prob. 1RQECh. 17 - Prob. 2RQECh. 17 - Prob. 3RQECh. 17 - Prob. 4RQECh. 17 - Prob. 5RQECh. 17 - Prob. 6RQECh. 17 - Prob. 7RQECh. 17 - Prob. 8RQECh. 17 - Prob. 9RQECh. 17 - Write a function void printSecond(ListNode ptr}...Ch. 17 - Write a function double lastValue(ListNode ptr)...Ch. 17 - Write a function ListNode removeFirst(ListNode...Ch. 17 - Prob. 13RQECh. 17 - Prob. 14RQECh. 17 - Prob. 15RQECh. 17 - Prob. 16RQECh. 17 - Prob. 17RQECh. 17 - Prob. 18RQECh. 17 - Prob. 1PCCh. 17 - Prob. 2PCCh. 17 - Prob. 3PCCh. 17 - Prob. 4PCCh. 17 - Prob. 5PCCh. 17 - Prob. 6PCCh. 17 - Prob. 7PCCh. 17 - Prob. 8PCCh. 17 - Prob. 10PCCh. 17 - Prob. 11PCCh. 17 - Prob. 12PCCh. 17 - Running Back Program 17-11 makes a person run from...
Additional Engineering Textbook Solutions
Find more solutions based on key concepts
Write a program that will read up to ten nonnegative integers into an array called numberArray and then write t...
Problem Solving with C++ (9th Edition)
Car Loan If A dollars are borrowed at r interest compounded monthly to purchase a car with monthly payments for...
Introduction To Programming Using Visual Basic (11th Edition)
// This code contains ERRORS! // It adds two numbers entered by the user. int1 num1, num2; String input; char a...
Starting Out with Java: From Control Structures through Data Structures (3rd Edition)
What does the following code print? System.out.println(""); System.out.println(""); System.out.println(""); Sys...
Java How to Program, Early Objects (11th Edition) (Deitel: How to Program)
The ___________ library function returns the sine of an angle.
Starting Out with C++ from Control Structures to Objects (9th Edition)
Write your own version of malloc and free, and compare its running time and space utilization to the version of...
Computer Systems: A Programmer's Perspective (3rd Edition)
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
- C Language In a linear linked list, write a function named changeFirstAndLast that swaps the node at the end of the list and the node at the beginning of the list. The function will take a list as a parameter and return the updated list.arrow_forwardYou are given the pointer to the head node of a linked list and an integer to add to the list. Create a new node with the given integer. Insert this node at the tail of the linked list and return the head node of the linked list formed after inserting this new node. The given head pointer may be null, meaning that the initial list is empty. Function Description Complete the insertNodeAtTail function in the editor below. insertNodeAtTail has the following parameters: SinglyLinkedListNode pointer head: a reference to the head of a list int data: the data value for the node to insert Returns SinglyLinkedListNode pointer: reference to the head of the modified linked list Input Format The first line contains an integer , the number of elements in the linked list.The next lines contain an integer each, the value that needs to be inserted at tail. Constraints Sample Input STDIN Function ----- -------- 5 size of linked list n = 5 141 linked list data values…arrow_forwardWrite a function called myunion that will take two lists x and y, and return a list that has the elements of x, followed by the elements of y that are not found in x. For example: (myunion ’(1 3 5 7 9) ’(1 2 3 4 5 6 7)) should return (1 3 5 7 9 2 4 6).arrow_forward
- Write a function mid to keep elements of an integer list between 5 and 10. One function only.mid [12,3,6,4,5,1] → [6,5]arrow_forwardemacs/lisp function Write a function that takes one parameter that is a list of numbers and returns true (t) if all the elements of the list are multiples of the first one and nil otherwise. This said, a list generated by the function make-multiples could be passed to this new function and the result should be true. On the other hand, show an example of a list that could not have been generated by the first function for which the result is still true.arrow_forwardWrite a functionLi stNode *removeFirst( ListNode *ptr)that is passed a linked list as parameter and returns the tai l of the list: That is, itremoves the first node and returns what is left. The function should deallocate thestorage of the removed node. The function returns null ptr if the list passed to itis empty.arrow_forward
- Write a function get_list_avg() that expects a parameter main_list (a list of lists) and returns a new list that contains the average of each sub-list in main_list. The function should return an empty list if the main_list is empty. this is my answer: def get_list_avg(main_list ): new_list = [] for sublist in main_list: avg = sum(sublist) / len(sublist) new_list.append(avg) return new_list main_list = input() print(get_list_avg(main_list))arrow_forwardWrite a function that will accept a list of integers and return the sum of the contents of the list(……if the list contains 1,2,3 it will return 6…..)arrow_forwardWrite a function REMOVE-NUM that takes a list and returns a list consisting of the original list with all numeric atoms removed. Examples: (REMOVE-NUM '(2 A 6 B 1 C 7 D)) returns the list (A B C D) (REMOVE-NUM '(3 A 4 B (1 E) 7 D)) returns the list (A B (E) D)arrow_forward
- PYTHON CODEWrite a function removeRange() that takes a list of integer numbers and two integer numbers as parameters, returns a new list where the numbers between the 2nd and 3rd parameters (both inclusive) are removed from the 1st list. Assume 2nd parameter is less than the 3rd parameter.arrow_forwardThe following C function takes a single-linked list of integers as a parameter and rearranges the elements of the list. The function is called with the list containing the integers 1, 2, 3, 4, 5, 6, 7 in the given order. What will be the contents of the list after the function completes execution? struct node { int value; struct node *next; }; void rearrange(struct node *list) { struct node *p, * q; int temp; if ((!list) || !list->next) return; p = list; q = list->next; while(q) { temp = p->value; p->value = q->value; q->value = temp; p = q->next; q = p?p->next:0; } } a) 1, 2, 3, 4, 5, 6, 7b) 2, 1, 4, 3, 6, 5, 7c) 1, 3, 2, 5, 4, 7, 6d) 2, 3, 4, 5, 6, 7, 1arrow_forwardComputer Science In c++ (There should be three different files, "main.cpp", "sourcefile.cpp" and "header.cpp" your solution must have those three different files): Write a function that checks if the nodes in a linked list is sorted in ascending order. The function should return true if the values are sorted, otherwise false. Take user input. Call the funciton in the main function to show it is working.arrow_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 Learning
C++ Programming: From Problem Analysis to Program...
Computer Science
ISBN:9781337102087
Author:D. S. Malik
Publisher:Cengage Learning
Introduction to Linked List; Author: Neso Academy;https://www.youtube.com/watch?v=R9PTBwOzceo;License: Standard YouTube License, CC-BY
Linked list | Single, Double & Circular | Data Structures | Lec-23 | Bhanu Priya; Author: Education 4u;https://www.youtube.com/watch?v=IiL_wwFIuaA;License: Standard Youtube License