NOTE: the last time to submit any C++ program for credit (assuming it is not too late to receive points) this semester, including this program, is end of day the last regular day of class, which is Friday, December 9. This last lab asks you to construct a linked list containing integers, totally on your own. You may not use classes, rather, you are to only use C++ capabilities we have learned in our class this semester. This is an interactive program. You are to prompt the user to enter an integer each time you want a new node created in the list. You are only allowed to insert a node at the beginning of the list. (So is this a stack or a queue?) You must use modular design where the main program consists of nothing but function calls. You need to be able to print the entire linked list and search the list for a given value. This lab does not ask you to do node deletions. Please present the user with the following menu options:
Lab 13b
NOTE: the last time to submit any C++
This last lab asks you to construct a linked list containing integers, totally on your own. You may not use classes, rather, you are to only use C++ capabilities we have learned in our class this semester.
This is an interactive program. You are to prompt the user to enter an integer each time you want a new node created in the list. You are only allowed to insert a node at the beginning of the list. (So is this a stack or a queue?)
You must use modular design where the main program consists of nothing but function calls.
You need to be able to print the entire linked list and search the list for a given value.
This lab does not ask you to do node deletions.
Please present the user with the following menu options:
Welcome to the integer linked list manipulation program!
What do you want to do?
1 Enter a node at the beginning of the list
2 Print the linked list
3 Search the list for a specific integer returning either FOUND or NOT FOUND
4 Exit the program
Please design any additional prompts needed.
Here is a sample run:
Welcome to the integer linked list manipulation program!
What do you want to do?
1 Enter a node at the beginning of the list
2 Print the linked list
3 Search the list for a specific integer returning either FOUND or NOT FOUND
4 Exit the program
1
(Your appropriate prompt) 7
What do you want to do?
1 Enter a node at the beginning of the list
2 Print the linked list
3 Search the list for a specific integer returning either FOUND or NOT FOUND
4 Exit the program
1
(Your appropriate prompt) -5
What do you want to do?
1 Enter a node at the beginning of the list
2 Print the linked list
3 Search the list for a specific integer returning either FOUND or NOT FOUND
4 Exit the program
1
(Your appropriate prompt) 739
What do you want to do?
1 Enter a node at the beginning of the list
2 Print the linked list
3 Search the list for a specific integer returning either FOUND or NOT FOUND
4 Exit the program
2
(Your appropriate progress message) 739 -5 7
What do you want to do?
1 Enter a node at the beginning of the list
2 Print the linked list
3 Search the list for a specific integer returning either FOUND or NOT FOUND
4 Exit the program
3
(Your appropriate progress message) -5
The value -5 was FOUND in the list.
What do you want to do?
1 Enter a node at the beginning of the list
2 Print the linked list
3 Search the list for a specific integer returning either FOUND or NOT FOUND
4 Exit the program
3
(Your appropriate progress message) 999
The value 999 was NOT FOUND in the list.
What do you want to do?
1 Enter a node at the beginning of the list
2 Print the linked list
3 Search the list for a specific integer returning either FOUND or NOT FOUND
4 Exit the program
4
Thank you for using the integer linked list manipulation program!
Trending now
This is a popular solution!
Step by step
Solved in 2 steps with 1 images
