Q1/w.p. to read 3 nodes and print it? Q2/ W.P. to read 3 nodes and print only even numbers/ Q3/ W.P. to read 2 nodes of singlet link list and 3 node of double link list then connect them in the begin double link list? Q4/w.p. to read 3 nodes and cpoy only odd number in singlet link list? Q5/ W.P. to read 3 nodes and replace every number > 50 to (-1) and print it?

Q1/w.p. to read 3 nodes and print it? Q2/ W.P. to read 3 nodes and print only even numbers/ Q3/ W.P. to read 2 nodes of singlet link list and 3 node of double link list then connect them in the begin double link list? Q4/w.p. to read 3 nodes and cpoy only odd number in singlet link list? Q5/ W.P. to read 3 nodes and replace every number > 50 to (-1) and print it?

C++ Programming: From Problem Analysis to Program Design

8th Edition

ISBN:9781337102087

Author:D. S. Malik

Publisher:D. S. Malik

Chapter17: Linked Lists

Section: Chapter Questions

Problem 3SA

See similar textbooks

Similar questions

Create a program that will accept a certain size of link list and display the list,this program can insert a new node in the list and can delete a node in the listand can search a certain node and display the position of the node
As a student who is currently doing CMPG22, you have been asked to analyse, model and design a LinkedList System that will be used to perform some manipulations on the data list by high school students and their instructors. The list will be given to the system as input and the user will perform some actions on the data as follows: 1. Return the first element in the list, 2. return the last element in the list, 3. remove the head and return the object stored in the removed node, 4. add a new element to the front of the list, 5. add a new element to the end of the list, 6. delete the first item in the list with the SAME VALUE, 7. determine whether a specific object is present (according to value), 8. receives a second linked list as a parameter and will return a third list containing all the elements of the parameter list which are not present in the calling list and lastly, 9. receive the second linked list as a parameter, and return a new linked list consisting of both the parameter…
The following step is used to remove first node from the AVAIL list. NEW: =AVAIL AND AVAIL: =LINK[AVAIL] Select one: True False
In which of the following Linked list last node is pointed to first node and first node is pointed to last node? a. Circular Double Linked List. b. Circular Single Linked List. c. Depends on the problem. d. Circular Linked List.
WRITE CODE IN LINK LIST AND ADD COMMENTS TO THE CODE PLEASED MANDATORY QUESTION: Reverse the given linked list:For example:Input: 100 > 200 > 300 > 400 > 500 > 600Reversed: 600 > 500 > 400 > 300 > 200 > 100 I HAVE RECIEVED A CODE BUT ITS NOT COMPILING AND SHOWS ERROR PLEASE CHECK IT OUT AND SEND ME WITH COMMENTS. MAKE SURE IT COMPILES AND MAKE SURE YOU ADD THE COMMENTS CODE: #include<iostream> using namespace std; struct Node { int data; struct Node* next; Node(int data) { this->data=data; next=NULL; } }; struct LinkedList { Node* head; LinkedList( ) {head=NULL;} void reverse( ) { Node* current=head; Node*prev=NULL, *next=NULL; while (current!=NULL) { next=current->next; current->next=prev; prev=current; current=next; } head=prev; } void print( ) { struct Node* temp=head; while (temp!=NULL) { cout<<temp->data<<" "; temp=temp->next; } } void push(int data) { Node*temp= new Node(data); temp->next=head; head=temp; } }; int…
Home Asagnment Write a program that should create a single link list and it should insert and delete nodes from link list. Write an algorithm that should concatenate three link lists into one link list. Write an algorithm that should split a single link list into three link list. Assume that initial link list has 30 nodes. Write an algorithm that should count nodes with even values. Write an algorithm that should sort values of nodes of link list. Write an algorithm that should delete duplicate nodes from link list. Write an algorithm that should delete all nodes from link list. Write an algorithm that should reverse data of all nodes of link list.
Given the MileageTrackerNode class, complete main() to insert nodes into a linked list (using the InsertAfter() function). The first user-input value is the number of nodes in the linked list. Use the PrintNodeData() function to print the entire linked list. DO NOT print the dummy head node. Ex. If the input is: 3 2.2 7/2/18 3.2 7/7/18 4.5 7/16/18 the output is: 2.2, 7/2/18 3.2, 7/7/18 4.5, 7/16/18 #include "MileageTrackerNode.h"#include <string>#include <iostream>using namespace std; int main (int argc, char* argv[]) {// References for MileageTrackerNode objectsMileageTrackerNode* headNode;MileageTrackerNode* currNode;MileageTrackerNode* lastNode; double miles;string date;int i; // Front of nodes listheadNode = new MileageTrackerNode();lastNode = headNode; // TODO: Read in the number of nodes // TODO: For the read in number of nodes, read// in data and insert into the linked list // TODO: Call the PrintNodeData() method// to print the entire linked list //…
Given the MileageTrackerNode class, complete main() to insert nodes into a linked list (using the InsertAfter() function). The first user-input value is the number of nodes in the linked list. Use the PrintNodeData() function to print the entire linked list. DO NOT print the dummy head node. Ex. If the input is: 3 2.2 7/2/18 3.2 7/7/18 4.5 7/16/18 the output is: 2.2, 7/2/18 3.2, 7/7/18 4.5, 7/16/18 main.cpp #include "MileageTrackerNode.h"#include <string>#include <iostream>using namespace std; int main () { // References for MileageTrackerNode objects MileageTrackerNode* headNode; MileageTrackerNode* currNode; MileageTrackerNode* lastNode; double miles; string date; int i; // Front of nodes list headNode = new MileageTrackerNode(); lastNode = headNode; // TODO: Read in the number of nodes // TODO: For the read in number of nodes, read // in data and insert into the linked list // TODO: Call the PrintNodeData() method // to…
Given the MileageTrackerNode class, complete main() to insert nodes into a linked list (using the InsertAfter() function). The first user- input value is the number of nodes in the linked list. Use the PrintNodeData() function to print the entire linked list. DO NOT print the dummy head node. Ex. If the input is: 3 2.2 7/2/18 3.2 7/7/18 4.5 7/16/18 the output is: 2.2, 7/2/18 3.2, 7/7/18 7/16/18 5
Q11. * After doing the following statement, the linked list becomes Head P.Link Head 4800 10 4900 4800 contains one node becomes a circular linked list contains two nodes becomes empty none of them P 4900 15 5000 4900 5 3000 5000 20 null 3000
What is the correct statements to add the node P between node 200 and 700 in the following doubly linked list? a) Head O Option 1 200 null A 200 P.RightLink= Head RightLink P.LeftLink Head Head RightLink LeftLink = P Head RightLink=P 500 00 500 700 Pum 200 b) C 700 null Head RightLink LeftLink - P = P.RightLink Head RightLink Head RightLink = P P.LeftLink Head Option 2
What description to Array and Linked List is mistake ? a. Using Linked list, if there is a existed data will be removed, it needs only to move the links of data node and doesn't need to change the location of data saved. b. Using Linked list, if there is a new data will be increased, it needs only to move the links of data node and doesn't need to change the location of data saved. c. If the size of main memory is enough, there is no upper bound limitation to increase new data when Linked list is used. d. For limited number of data, Array is allocated less memory size, because all sequential data are allocated into continuously space e. Using Array, if there is a new data will be increased, it needs to move some existed data to new location to free the suitable location new data because the sequential order should be kept. f. If the size of main memory is enough, there is no upper bound limitation to increase new data when Array is used. g. The operations on Array is…