Data structures HW3 Q1. Consider the code for displayList() function shown below: void displayList(void) { Node* currNode = head; while (currNode != NULL) { cout<item<next;
Data structures HW3 Q1. Consider the code for displayList() function shown below: void displayList(void) { Node* currNode = head; while (currNode != NULL) { cout<item<next;
Computer Networking: A Top-Down Approach (7th Edition)
7th Edition
ISBN:9780133594140
Author:James Kurose, Keith Ross
Publisher:James Kurose, Keith Ross
Chapter1: Computer Networks And The Internet
Section: Chapter Questions
Problem R1RQ: What is the difference between a host and an end system? List several different types of end...
Related questions
Question
![Data structures
HW3
Q1. Consider the code for displayList() function shown below:
void displayList(void)
{
Node* currNode = head;
while (currNode != NULL)
{
cout<<currNode->item<<endl;
currNode = currNode->next;
a) Modify it to create a new function displayNodeNum() that will display the number
of nodes in the list, e.g., if there are three nodes, it should display "3 nodes in the
list". If the list is empty then it should display “the list is empty right now". [Hint:
you need only add 2 or 3 lines to it.]
b) Modify the displayList() or displayNodeNum() function created above to create a
new function sumNodeValues() that will display the total of the values of the nodes,
e.g. if there are 4 nodes having values 1, 3, 8, 10 then it should display “The sum is
22". [Hint: you need only add 3 or 4 lines to the first function.]
c) Create a function findValue(int) that will take a value and display it if it is in the list,
e.g. the user enters 3. The function will search 3 in the list. If it is there, it will print
"Number 3 is in the list". If it is not there, it will print “Number 3 not found in the
list".](/v2/_next/image?url=https%3A%2F%2Fcontent.bartleby.com%2Fqna-images%2Fquestion%2F55bd80cc-173f-4d25-b607-f6014035683b%2F0b3e787c-1267-4428-a71f-41a0f2365e2f%2F66ov97l_processed.jpeg&w=3840&q=75)
Transcribed Image Text:Data structures
HW3
Q1. Consider the code for displayList() function shown below:
void displayList(void)
{
Node* currNode = head;
while (currNode != NULL)
{
cout<<currNode->item<<endl;
currNode = currNode->next;
a) Modify it to create a new function displayNodeNum() that will display the number
of nodes in the list, e.g., if there are three nodes, it should display "3 nodes in the
list". If the list is empty then it should display “the list is empty right now". [Hint:
you need only add 2 or 3 lines to it.]
b) Modify the displayList() or displayNodeNum() function created above to create a
new function sumNodeValues() that will display the total of the values of the nodes,
e.g. if there are 4 nodes having values 1, 3, 8, 10 then it should display “The sum is
22". [Hint: you need only add 3 or 4 lines to the first function.]
c) Create a function findValue(int) that will take a value and display it if it is in the list,
e.g. the user enters 3. The function will search 3 in the list. If it is there, it will print
"Number 3 is in the list". If it is not there, it will print “Number 3 not found in the
list".
Expert Solution
This question has been solved!
Explore an expertly crafted, step-by-step solution for a thorough understanding of key concepts.
Step by step
Solved in 3 steps with 3 images
Recommended textbooks for you
Computer Networking: A Top-Down Approach (7th Edi…
Computer Engineering
ISBN:
9780133594140
Author:
James Kurose, Keith Ross
Publisher:
PEARSON
Computer Organization and Design MIPS Edition, Fi…
Computer Engineering
ISBN:
9780124077263
Author:
David A. Patterson, John L. Hennessy
Publisher:
Elsevier Science
Network+ Guide to Networks (MindTap Course List)
Computer Engineering
ISBN:
9781337569330
Author:
Jill West, Tamara Dean, Jean Andrews
Publisher:
Cengage Learning
Computer Networking: A Top-Down Approach (7th Edi…
Computer Engineering
ISBN:
9780133594140
Author:
James Kurose, Keith Ross
Publisher:
PEARSON
Computer Organization and Design MIPS Edition, Fi…
Computer Engineering
ISBN:
9780124077263
Author:
David A. Patterson, John L. Hennessy
Publisher:
Elsevier Science
Network+ Guide to Networks (MindTap Course List)
Computer Engineering
ISBN:
9781337569330
Author:
Jill West, Tamara Dean, Jean Andrews
Publisher:
Cengage Learning
Concepts of Database Management
Computer Engineering
ISBN:
9781337093422
Author:
Joy L. Starks, Philip J. Pratt, Mary Z. Last
Publisher:
Cengage Learning
Prelude to Programming
Computer Engineering
ISBN:
9780133750423
Author:
VENIT, Stewart
Publisher:
Pearson Education
Sc Business Data Communications and Networking, T…
Computer Engineering
ISBN:
9781119368830
Author:
FITZGERALD
Publisher:
WILEY