Subject is C++ Programming Describe the following code.{Node *pre = new Node;Node *cur = new Node;Node *temp = new Node;cur = head;for (int i=1;inext;temp->data=value;pre->next=temp;temp->next=cur;Select one:a. A function that will insert a node in an arbitrary positionO b. Identifies the current and previous data element in the linked listc. None of the choicesO d. Traverse a linked list Describe the following code.Node *current=new Node;Node *previous=new Node;current=head;while (current->next!=NULL){previous=current;current=current->next;tail=previous;previous->next=NULL;delete current;Select one:a. Delete all the elementsb. Delete the header and the current element of the linked listc. None of the choicesO d. Delete an element on a particular position

Here in this question we have given two code segment.and we have asked that how these code are…

cribe the following code. Node *pre = new Node; Node *cur = new Node; Node *temp = new Node; cur = head; for (int i=1;inext; temp->data=value; pre->next=temp; temp->next=cur; ect one: a. A function that will insert a node in an arbitrary position b. Identifies the current and previous data element in the linked list c. None of the choices

cribe the following code. Node pre = new Node; Node cur = new Node; Node *temp = new Node; cur = head; for (int i=1;inext; temp->data=value; pre->next=temp; temp->next=cur; ect one: a. A function that will insert a node in an arbitrary position b. Identifies the current and previous data element in the linked list c. None of the choices

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

Question 11 If N represents the number of elements in the collection, then the contains method of the ArrayCollection class is O(1). True False Question 12 With the text's array-based list implementation, the set of stored elements is scattered about the array. True False Question 13 The add method of the LinkedCollection class places the new element at the beginning of the underlying linked list. True False Question 14 If N represents the number of elements in the list, then the index-based add method of the ABList class is O(N). True False Question 15 The attributes of a class that are used to determine equality of objects of the class are called the key attributes. True False Question 16 According to the text's specifications, a collection is a list. True False Question 17 O(1) is the order of growth execution time of the add operation when using the ArrayCollection class, assuming a collection size of N. True False Question 18 When an object of class LBList…
Which code part (A, B, C, or D) is incorrect? Add element in Linked List at particular index: add(int index, T item) void add(int index, int value) { // A. ============================================= if(index < 0 || index > count){ cerr << "Index Out of Bounds"; return; } node *temp = new node; temp->item = value; // A. ============================================= // B. ============================================= if (index == 0) { temp->next = head; head = temp; } // B. ============================================= // C. ============================================= else { node *previous = head; for(int i = 0; i < index - 1; ++i){ previous = previous->next; } // C. ============================================= // D. ============================================= previous->next = temp; temp->next = previous->next; } // D. ============================================= ++count; return; }
there is a problem with this code I want to delete node 10 and display the linked list after that it cannot be displayed and I don't know why please don't change the type of node from class to struct the code : #include <iostream>using namespace std; class node{public: int data; node* next;}; void display(node * head) // printing the data of the nodes{ node* temp = head; while (temp != NULL) { cout << temp->data << endl; temp = temp->next; }} // add void push(node** head, int newdata) // { 5, 10 , 20 , 30 , 40 }{ node* newnode = new node(); newnode->data = newdata; newnode->next = *head; *head = newnode;} void append(node** head, int newdata) // { 10 , 20 , 30 , 40 }{ node* newnode = new node(); newnode->data = newdata; newnode->next = NULL; node* last = *head; if (*head == NULL) { *head = newnode;…
#7. HashTable Data Type: By having each bucket contain a linked list of elements that are hashed to that bucket. Usage: >>> table = SeparateChainingHashTable() # Create a new, empty map. >>> table.put('hello', 'world') # Add a new key-value pair. >>> len(table) # Return the number of key-value pairs stored in the map. 1 >>> table.get('hello') # Get value by key. 'world' >>> del table['hello'] # Equivalent to `table.del_('hello')`, deleting key-value pair. >>> table.get('hello') is None # Return `None` if a key doesn't exist. True """ _empty = None def __init__(self, size=11): self.size = size self._len = 0 self._table = [self._empty] * size def put(self, key, value): hash_ = self.hash(key) node_ = self._table[hash_] if node_ is self._empty: self._table[hash_] = Node(key, value) else: while node_.next is not None:…
Store data of car in a two way linked list. Car contains model(int), company (String), price(int) and color(String). Write following methods in your linked list class. Insert a node at last. Display those car whose model is in between 1990 and 2021. Delete first node of linklist. Delete third node. (if third node exist). Note.. This is java program
COVID-19 has effected whole world. People are interested in knowing current situation of COVID-19. You are required to write JAVA program for storing information in a Single way Linked List. Following JAVA classes are provided. // Node class public class COVIDDetail { public String country; public int activecases; public COVIDDetail next; } // linked List class public class COVIDList { COVIDDetail start=null; } You are required to add following methods to COVIDList class 1.void add(COVIDDetail n) this method receives a node as argument and adds it to given list. Nodes are arranged in descending order with respect to number of cases. Note that you are not required to sort the list in fact while adding first find its appropriate position and then add given node to that position. 2.void updateCases(String country_name , int cases) this method receives two arguments country name and cases (can have positive or negative value). Update active cases of those countries whose name…
Which XXX completes the following algorithm for inserting a new node into a singly-linked list? ListInsertAfter(list, curNode, newNode) {if (list⇢head == null) {list⇢head = newNodelist⇢tail = newNode}else if (curNode == list⇢tail) {list⇢tail⇢next = newNodelist⇢tail = newNode}else {XXX}} Group of answer choices newNode⇢next = curNode⇢nextcurNode⇢next = null newNode⇢next = nullcurNode⇢next = list⇢tail⇢next newNode⇢next = curNode⇢nextcurNode⇢next = newNode newNode⇢next = curNode⇢nextcurNode = newNode
Store data of car in a two way linked list. Car contains model(int), company (String), price(int)and color(String). Write following methods in your linked list class.a) Insert a node at last.b) Display those car whose model is in between 1990 and 2021. c) Delete first node of linklist.d) Delete third node. (if third node exist)
q6) Which of the following linked list can move only in one direction to access the data of the node? a. Single linked list b. Circular Double linked list c. None d. Double linked list
Store data of car in a two-way linked list. Car contains model(int), company (String), price(int) and color(String). Write the following methods in your linked list class. Insert a node at last. Display those cars whose model is in between 1990 and 2021. Delete first node of linkedlist. Delete third node. (if third node exist)
Select true or false for the statements below. Explain your answers if you like to receive partial credit 8) Which of the following is true about the delete function in a standard linked list (only a head pointer and nodes only having a next pointer)?a. There is only 1 scenario to consider when looking for a node to delete in a linked listb. When you traverse the list to find the element to delete, it improves theperformance to O(1)c. You should always check first to see if the list is empty before attempting to find and delete a node
ListTraverseReverse must traverse a linked list in reverse order. Which XXX should replace the missing statement? ListTraverseReverse(list) {XXX}ListTraverseReverseRecursive(node) {if (node is not null) {ListTraverseReverseRecursive(node⇢next)Visit node}} Group of answer choices ListTraverseReverseRecursive(list) ListTraverseReverseRecursive(list⇢head) ListTraverseReverseRecursive(list⇢head⇢next) ListTraverseReverseRecursive(list⇢tail)