Linked List Operations Program Plan: “IntList.h”: Include the required specifications into the program. Define a class named “IntList”. Declare the member variables “value” and “*next” in structure named “ListNode”. Declare the constructor, destructor, and member functions in the class. “IntList.cpp”: Include the required header files into the program. Define a function named “appendNode()” to insert the node at end of the list. Declare the structure pointer variables “newNode” and “dataPtr” for the structure named “ListNode”. Assign the value “num” to the variable “newNode” and assign null to the variable “newNode”. Using “if…else” condition check whether the list is empty or not, if the “head” is empty then make a new node into “head” pointer. Otherwise, make a loop to find last node in the loop. Assign the value of “dataPtr” into the variable “newNode”. Define a function named “display()” to print the values in the list. Declare the structure pointer “dataPtr” for the structure named “ListNode”. Initialize the variable “dataPtr” with the “head” pointer. Make a loop “while” to display the values of the list. Define a function named “insertNode()” to insert a value into the list. Declare the structure pointer variables “newNode”, “dataPtr”, and “prev” for the structure named “ListNode”. Make a “newNode” value into the received variable value “num”. Use “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 “num” value is less than the list values or not. Use “if…else” condition to initialize the value into list. Define a function named “deleteNode()” to delete a value from the list. Declare the structure pointer variables “dataPtr”, and “prev” for the structure named “ListNode”. Use “if…else” condition to check whether the “head” value is equal to “num” or not. Initialize the variable “dataPtr” with the value of the variable “head”. Remove the value using “delete” operator and reassign the “head” value into the “dataPtr”. If the “num” value not equal to the “head” value, then define the “while” loop to assign the “dataPtr” into “prev”. Use “if” condition to delete the “prev” pointer. Define the destructor to destroy the list values from the memory. Declare the structure pointer variables “dataPtr”, and “nextNode” for the structure named “ListNode”. Initialize the variable “dataPtr” with the “head” pointer. Define a “while” loop to make the links of node into “nextNode” and remove the node using “delete” operator. “Main.cpp”: Include the required header files into the program. Declare an object named “obj” for the class “IntList”. Make a call to functions for insert, append, and delete operations.

Question

Want to see the full answer?

Answer 1

Question

Chapter 18, Problem 1PC

Program Plan Intro

Linked List Operations

Program Plan:

“IntList.h”:

Include the required specifications into the program.

Define a class named “IntList”.

Declare the member variables “value” and “*next” in structure named “ListNode”.

Declare the constructor, destructor, and member functions in the class.

“IntList.cpp”:

Include the required header files into the program.

Define a function named “appendNode()” to insert the node at end of the list.

Declare the structure pointer variables “newNode” and “dataPtr” for the structure named “ListNode”.

Assign the value “num” to the variable “newNode” and assign null to the variable “newNode”.

Using “if…else” condition check whether the list is empty or not, if the “head” is empty then make a new node into “head” pointer. Otherwise, make a loop to find last node in the loop.

Assign the value of “dataPtr” into the variable “newNode”.

Define a function named “display()” to print the values in the list.

Declare the structure pointer “dataPtr” for the structure named “ListNode”.

Initialize the variable “dataPtr” with the “head” pointer.

Make a loop “while” to display the values of the list.

Define a function named “insertNode()” to insert a value into the list.

Declare the structure pointer variables “newNode”, “dataPtr”, and “prev” for the structure named “ListNode”.

Make a “newNode” value into the received variable value “num”.

Use “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 “num” value is less than the list values or not.

Use “if…else” condition to initialize the value into list.

Define a function named “deleteNode()” to delete a value from the list.

Declare the structure pointer variables “dataPtr”, and “prev” for the structure named “ListNode”.

Use “if…else” condition to check whether the “head” value is equal to “num” or not.

Initialize the variable “dataPtr” with the value of the variable “head”.

Remove the value using “delete” operator and reassign the “head” value into the “dataPtr”.

If the “num” value not equal to the “head” value, then define the “while” loop to assign the “dataPtr” into “prev”.

Use “if” condition to delete the “prev” pointer.

Define the destructor to destroy the list values from the memory.

Declare the structure pointer variables “dataPtr”, and “nextNode” for the structure named “ListNode”.

Initialize the variable “dataPtr” with the “head” pointer.

Define a “while” loop to make the links of node into “nextNode” and remove the node using “delete” operator.

“Main.cpp”:

Include the required header files into the program.

Declare an object named “obj” for the class “IntList”.

Make a call to functions for insert, append, and delete operations.

Expert Solution & Answer

Want to see the full answer?

Check out a sample textbook solution

See solution

Students have asked these similar questions

6. What is Race condition? How to prevent it? [2 marks] 7. How many synchronization methods do you know and compare the differences. [2 marks] 8. Explain what are the “mutual exclusion”, “deadlock”, “livelock”, and “eventual entry”, with the traffic intersection as an example like dinning philosophy. [2 marks] 9. For memory allocation, what are the difference between internal fragmentation and external fragmentation. Explain with an example. [2 marks] 10. How can the virtual memory map to the physical memory. Explain with an example. [2 marks]

Your answers normally have 50 words. Less than 50 words will not get marks. 1. What is context switch between multiple processes? [2 marks] 2. Draw the memory layout for a C program. [2 marks] 3. How many states does a process has? [2 marks] 4. Compare the non-preemptitve scheduling and preemptive scheduling. [2 marks] 5. Given 4 process and their arrival times and next CPU burst times, what are the average times and average Turnaround time, for different scheduling algorithms including: a. First Come, First-Served (FCFS) Scheduling [2 marks] b. Shortest-Job-First (SJF) Scheduling [2 marks] c. Shortest-remaining-time-first [2 marks] d. Priority Scheduling [2 marks] e. Round Robin (RR) [2 marks] Process Arrival Time Burst Time P1 0 8 P2 1 9 P3 3 2 P4 5 4

a database with multiple tables from attributes as shown above that are in 3NF, showing PK, non-key attributes, and FK for each table? Assume the tables are already in 1NF. [Hint: 3 tables will result after deducing 1NF -> 2NF -> 3NF]