bartleby

Concept explainers

Question
Book Icon
Chapter 17, Problem 34RQE
Program Plan Intro

Purpose of the given code:

The given code is trying to remove a value from the linked list; the value to be removed is stored in the variable “num”.

Given Code:

//Definition of function

void NumberList::deleteNode(double num)//Line 1

{//Line 2

//Declaration of structure pointer variable

ListNode *nodePtr, *previousNode; //Line 3

// If the list is empty, do nothing

if (!head)//Line 4

return;//Line 5

//Determine if the first node is the one

if (head->value == num)//Line 6

//Error #1

//Delete “head” value

delete head;//Line 7

//Error #2

else//Line 8

{//Line 9

// Initialize nodePtr to head of list

nodePtr = head;//Line 10

/* Skip all nodes whose value member is not equal to num */

while (nodePtr->value != num)//Line 11

{//Line 12

previousNode = nodePtr;//Line 13

nodePtr = nodePtr->next;//Line 14

}//Line 15

/* link the previous node to the node after nodePtr, then delete nodePtr */

previousNode->next = nodePtr->next;//Line 16

delete nodePtr;//Line 17

}//Line 18

}//Line 19

Blurred answer
Students have asked these similar questions
Distributed Systems: Consistency Models fer to page 45 for problems on data consistency. structions: Compare different consistency models (e.g., strong, eventual, causal) for distributed databases. Evaluate the trade-offs between availability and consistency in a given use case. Propose the most appropriate model for the scenario and explain your reasoning. Link: [https://drive.google.com/file/d/1wKSrun-GlxirS31Z9qoHazb9tC440AZF/view?usp=sharing]
Operating Systems: Deadlock Detection fer to page 25 for problems on deadlock concepts. structions: • Given a system resource allocation graph, determine if a deadlock exists. If a deadlock exists, identify the processes and resources involved. Suggest strategies to prevent or resolve the deadlock and explain their trade-offs. Link: [https://drive.google.com/file/d/1wKSrun-GlxirS31Z9qoHazb9tC440 AZF/view?usp=sharing]
Artificial Intelligence: Heuristic Evaluation fer to page 55 for problems on Al search algorithms. tructions: Given a search problem, propose and evaluate a heuristic function. Compare its performance to other heuristics based on search cost and solution quality. Justify why the chosen heuristic is admissible and/or consistent. Link: [https://drive.google.com/file/d/1wKSrun-GlxirS31Z9qoHazb9tC440 AZF/view?usp=sharing]

Chapter 17 Solutions

Starting Out with C++ from Control Structures to Objects, Student Value Edition plus MyProgrammingLab with Pearson eText -- Access Card Package (8th Edition)

Knowledge Booster
Background pattern image
Computer Science
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
SEE MORE QUESTIONS
Recommended textbooks for you
Text book image
Database System Concepts
Computer Science
ISBN:9780078022159
Author:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:McGraw-Hill Education
Text book image
Starting Out with Python (4th Edition)
Computer Science
ISBN:9780134444321
Author:Tony Gaddis
Publisher:PEARSON
Text book image
Digital Fundamentals (11th Edition)
Computer Science
ISBN:9780132737968
Author:Thomas L. Floyd
Publisher:PEARSON
Text book image
C How to Program (8th Edition)
Computer Science
ISBN:9780133976892
Author:Paul J. Deitel, Harvey Deitel
Publisher:PEARSON
Text book image
Database Systems: Design, Implementation, & Manag...
Computer Science
ISBN:9781337627900
Author:Carlos Coronel, Steven Morris
Publisher:Cengage Learning
Text book image
Programmable Logic Controllers
Computer Science
ISBN:9780073373843
Author:Frank D. Petruzella
Publisher:McGraw-Hill Education