Home AsagnmentWrite a program that should create a single link list and it shouldinsert and delete nodes from link list.Write an algorithm that should concatenate three link lists into onelink list.Write an algorithm that should split a single link list into three linklist. 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 linklist.Write an algorithm that should delete all nodes from link list.Write an algorithm that should reverse data of all nodes of link list.

As per Bartleby's Guidelines we are allow to answer one question at a time. Kindly resubmit to get…

Answered: Write a program that should create a…

Engineering

Computer Science

Write a program that should create a single link list and it should insert and delete nodes from link list.

C++ Programming: From Problem Analysis to Program Design

8th Edition

ISBN:9781337102087

Author:D. S. Malik

Publisher:D. S. Malik

Chapter16: Searching, Sorting And Vector Type

Section: Chapter Questions

Problem 1TF

See similar textbooks

Similar questions

JAVA CODE PLEASE 2. Linked List Quiz by CodeChum Admin Write a function printNodes that takes in the head of a linked list and prints all the values of that linked list using a while loop. Print the values separated by a [space]->[space] Create a program that accepts 10 integer inputs. Assign each input into a node and link them in ascending order then print the linked list. Create another two linked lists: One for nodes with even numbers and the other one for odd numbers. Print them respectively using the printNodes function. Input 1. One line containing an integer 2. One line containing an integer 3. One line containing an integer 4. One line containing an integer 5. One line containing an integer 6. One line containing an integer 7. One line containing an integer 8. One line containing an integer 9. One line containing an integer 10. One line containing an integer Output Enter·number·1:·1 Enter·number·2:·2 Enter·number·3:·3 Enter·number·4:·4…
The following are the operations that you can do using a single linked list. Choose only one operation then create the algorithm and simulate. The attached Rubric will be used in evaluating the activity. 1. Delete a particular node in a single linked list 2. Delete the first node of a single linked list 3. Insertion after a given node of a single linked list 4. Insertion at a given position in a single linked list 5. Insertion before a given node in a single linked list 6. Reverse a single linked list EX: Delete the last node of a single linked list Problem" Deletion of the last node in a single linked list Algorithm" Step 1: if HEAD = NULL Write UNDERFLOW Go to Step 8 Step 2: SET PTR = HEAD Step 3: Repeat Steps 4 and while PTR à NEXT = NULL Step 4: SET PREPPTR = PTR Step 5: SET PTR =PTR à NEXT [End of loop] Step 6: SET PREPTR à NEXT = NULL Step 7: FREE PTR Step 8: EXIT…
The programming language is Python Instructions: Create a function that will delete a node in a Linked List based on position number. On below example, if you want to delete position #2, it will remove the Banana (arrangement of nodes below is Apple, Banana, Cherry, Grapes, Orange). myLinkedList = LinkedList() myLinkedList.append("Banana") myLinkedList.append("Cherry") myLinkedList.append("Grapes") myLinkedList.append("Orange") myLinkedList.prepend("Apple") myLinkedList.deleteByPositionNum(2) node = myLinkedList.head while node: print(node.value, " ") node = node.next_node You may start with the function head:def deleteByPositionNum(self, positionNum):
python 8.7 LAB: Writing append and search methods (singly-linked list)Given main.py and a Node class in Node.py, complete the LinkedList class in LinkedList.py by writing the append() and search() methods. The search() method should return the Node whose data value matches a given key, and None if the key is not found. The search() method should also set the position of each Node searched in the LinkedList, starting with 1. Ex: If the input is: 12 23 59 37 923 212the output is: 12 found in list at position 1.If the input is: 12 23 59 37 923 268the output is: 68 not found in list.
A skip listThe second programming homework is already on a server (http://marmoset.famnit.upr.si).In this task, a skip list data structure should be implemented. You can follow the followinginstructions:- Implement the class NodeSkipList with two components, namely key node and arrayof successors. You can also add a constructor, but you do not need to add anymethod.- In the class SkipList implement a constructor SkipList(long maxNodes). The parameter maxNodes determines the maximal number of nodes that can be added to askip list. Using this parameter we can determine the maximal height of a node, thatis, the maximal length of the array of successors. As the maximal height of a nodeit is usually taken the logarithm of the parameter. Further, it is useful to constructboth sentinels of maximal height.- In the class SkipList it is useful to write a method which simulates coin flip andreturns the number of all tosses until the first head comes up. This number representsthe height of a node…
You have two numbers represented by a linked list, where each node contains a single digit. The digits are stored in reverse order, such that the 1 's digit is at the head of the list. Write a function that adds the two numbers and returns the sum as a linked list.EXAMPLEInput: (7-> 1 -> 6) + (5 -> 9 -> 2).That is,617 + 295.Output: 2 -> 1 -> 9. That is, 912.FOLLOW UPSuppose the digits are stored in forward order. Repeat the above problem.Input: (6 -> 1 -> 7) + (2 -> 9 -> 5).That is,617 + 295.Output: 9 -> 1 -> 2. That is, 912.
Given a linked list of N nodes such that it may contain a loop. A loop here means that the last node of the link list is connected to the node at position X(1-based index). If the link list does not have any loop, X=0. Remove the loop from the linked list, if it is present, i.e. unlink the last node which is forming the loop. Example 1: Input: N = 3 value[] = {1,3,4} X = 2 Output: 1 Explanation: The link li. st looks like 1 -> 3 -> 4 ^ | |____|
Machine Problem: Write a Java program that will display the given menu: Note: Must accept a string of word/phrase/sentence Menu 1. Add a string 2. Display list of strings 3. Display list of uppercase words 4. Display list of lowercase words 5. Delete an uppercase word 6. Delete a lowercase word 7. End program When 1 is chosen, ask the user to enter a string and add it to a list using a linked list When 2 is chosen, display the list of strings. When 3 is chosen, display all uppercase words found in the list of strings in ascending order. (create a linked list containing all uppercase words) When 4 is chosen, display all lowercase words found in the list of strings in ascending order. (create a linked list containing all lowercase words) When 5 is chosen, display the list of uppercase words then ask the user the index of the word he wants to delete. Index of the first word in the list is 0 When 6 is chosen, display the list of lowercase words then ask the user the…
//give the output of the following program and draw the link list. struct node{ int info; struct node *link;};typedef struct node *nodePTR;void insort(nodePTR*,struct Info);nodePTR getnode();int main(void){nodePTR p=NULL,head=NULL,save;inti; for(i=0;i<3;i++){ insort (&head,i+5);}save=head;do{ printf("%d",save->info); save=save->link;}while(save!=NULL); return0;}nodePTR getnode(){nodePTR q;q=(nodePTR)malloc(sizeof(struct node));return q;}void insort(NODEPTR *head , int x){ NODEPTR p,q,r; q=NULL; for(p=*head; p!=NULL &&x>p->info; p=p->link) q=p; if(q=NULL) { p=getnode(); p->info=x; p->link=head; head=p; }else{ r=getnode(); q->link=r; r->info=x; r->link=p; }}
int F(node<int>&p){int c=0; while(p!=0){p=p->next; c++; } return c;} This function is a. return the number of items in the linked list b. return the number of items in a linked list and destroy the linked list c. None of these d. destroy the list and free all allocated nodes
The function interleave_lists in python takes two parameters, L1 and L2, both lists. Notice that the lists may have different lengths. The function accumulates a new list by appending alternating items from L1 and L2 until one list has been exhausted. The remaining items from the other list are then appended to the end of the new list, and the new list is returned. For example, if L1 = ["hop", "skip", "jump", "rest"] and L2 = ["up", "down"], then the function would return the list: ["hop", "up", "skip", "down", "jump", "rest"]. HINT: Python has a built-in function min() which is helpful here. Initialize accumulator variable newlist to be an empty list Set min_length = min(len(L1), len(L2)), the smaller of the two list lengths Use a for loop to iterate k over range(min_length) to do the first part of this function's work. On each iteration, append to newlist the item from index k in L1, and then append the item from index k in L2 (two appends on each iteration). AFTER the loop…
Create a meu-driven linked list program, and develop and use the following menu to implement the linked list, modifying the linked list program from the labs in class. Create a linked list (need to read from the “LinkedList.txt” to create the list) Create a new node Append them in ascending order of Lname Update data of the linked list Insert a new node to the linked list Delete a new node to the linked list Display linked list Exit Test program with following questions Click a to create a linked list by adding a new field, Amount; display the last two nodes on the screen Click b to modify all the Lname to upper case and display the first 3 nodes Take a SS of your screen Click b to increase the hourly rate by 10 for all CS majors and display the first 3 nodes Click d to delete nodes whose NumOfHours are greater than 40, and display the nodes in linked list Take a SS of screen Click c to add a new node with (Alex, Rodrigo, 40, 50, Y, N. __) based on Amount…