Write a program in 'C' for implementation of a single linked list of name and age of different persons and also do the following by using one function each for each task: (a) The linked list needs to be sorted always. (b) It should accept a person's name and age and insert the node at right position in the list so that it remains sorted after insertion. The list should be sorted on name and then on age.

Write a program in 'C' for implementation of a single linked list of name and age of different persons and also do the following by using one function each for each task: (a) The linked list needs to be sorted always. (b) It should accept a person's name and age and insert the node at right position in the list so that it remains sorted after insertion. The list should be sorted on name and then on age.

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 5SA

See similar textbooks

Similar questions

QUESTION: NOTE: This assignment is needed to be done in OOP(c++/java), the assignment is a part of course named data structures and algorithm. A singly linked circular list is a linked list where the last node in the list points to the first node in the list. A circular list does not contain NULL pointers. A good example of an application where circular linked list should be used is a items in the shopping cart In online shopping cart, the system must maintain a list of items and must calculate total bill by adding amount of all the items in the cart, Implement the above scenario using Circular Link List. Do Following: First create a class Item having id, name, price and quantity provide appropriate methods and then Create Cart/List class which holds an items object to represent total items in cart and next pointer Implement the method to add items in the array, remove an item and display all items. Now in the main do the following Insert Items in list Display all items. Traverse…
This is assignment used C++. Develop a linked-list processing function, IsolateTargetSoloAsTail, to process a linked list as follows. ● If a target cannot be found on the given list, a new node containing the target is created and added to the list's end (made the new tail node). ► This includes the case where the given list is empty, in which the new tail node added is also the new head node. (This is so because the only node in a 1-node list is the list's head and tail node.) ● If the target appears only once on the given list, the target-matching node is moved to the list's end (made the new tail node). ► Nothing needs to be done if the target-matching node is already the tail node (of the given list). ● If the target appears multiple times on the given list, the first target-matching node is moved to the list's end (made the new tail node), and all other target-matching nodes are to be deleted from the list. ► Note that although…
in c++, apply non-linear data structures to solve simple problems. Question - Write a Program that create sorted Linked List and then split it in two lists (even, odd) your program should delete node (start, Mid, End), Search value and count total number of nodes. Your program should be menu driven and use functional approach. (Drop coding in words with screenshot of output as well)
In C++, Consider a singly linked list where each node contains two fields – integer dataand node type pointer next. The head pointer of the list, a position, and a valueof data is given. You have to insert a node with the given value at the givenposition. You have to consider any position including first or last. You have toImplement an insert operation as per the above specification.
Write in C++ Now, what if Sam wants to insert Eevee after Pikachu but he doesn't know where Pikachu is located in his list. Let's help him search for a Pokemon by its name and insert another Pokemon directly after it. Write a function secondPlace() that takes six parameters and inserts a new Pokemon into a list right after another specified pokemon. Once you find the specified Pokemon, use the insertAfter() function from the previous sub-question to add the new Pokemon. The function should return the new number of strings in the array. Note The same Pokemon may appear in the list multiple times (Sam has a bad memory). Assume that Sam wants every instance of the Pokemon he is searching for to be followed by the Pokemon he is attempting to insert. If the array is already full or if the number of strings that are going to be added to the array plus the current number of strings exceeds the total size of the array, the array should remain unchanged. Assume all inputs are lowercase…
For the given question use C language (DO NOT USE C++ OR JAVA). Write a C function whose prototype is given below int Check_Circle (struct Node * Start); Function takes a Start pointer of an unordered Linked List as parameter. By looping, function determines whether or not there is a circle in the linked list. It returns TRUE (1) if a circle is found, otherwise it returns FALSE (0). Example : The following is a Linked List with a circle (note that data duplicates are allowed). Start 20 10 40 50 30 10
3. Write a function to return the median value in a sorted linked list. If the length i of the list is odd, then the median is the ceiling(i/2) member. For example, given the list (1, 2, 2, 5, 7, 9, 11) as input, your function should return the value 5. If the length of the list is even, then the median is the mean of the i/2 and (i/2)+1 members. Thus, the median of the sorted list (2, 4, 8, 9) is (4+8)/2. Finally, define the median of an empty list to be 0.
Write a c++ code that compare the times to traverse a list (containing a large number of elements) implemented in an array, in a simple linked list, and in an unrolled linked list. In this experiment, you need to generate a large list, store it in each representation, and then measure the time to traverse the list in each representation. For the array, this is almost straightforward: Fill the array and then do a sequential scan. Here is the thing to watch for: When you fill the array, it all gets read into cache. So, somehow you need to ensure that almost all of the array is NOT in cache before you do your traversal. One thing you can do is make your array big enough that most of it will not fit in cache at once. You need to make sure that the node capacity is not too small, or it will behave too much like a simple linked list.
A dummy-headed circular singly-linked list has been created and holds a list of integer temperatures. (Remember, the first node is the dummy node and holds no payload.) Write a C++ function, "NothingOdd(list)", that accepts a single argument that is a pointer to the dummy node of the linked list and removes and deallocates all nodes in the list with odd (i.e., not even) temperature values. The relevant type struct xNode { int xNode* next; }; // Temperature (in Celsius) // Pointer to successor node temp; declarations are:
This question is in the course of Data Structures. Please choose C programming language for the code, and DO NOT include comments or extraneous information that a student typically would not need for a correct answer. Assume that you have a linear singly linked list and the values in the list are sorted in ascending order.--> Write a function to insert a given value into the list so that the order will not be changed.I need the answer ASAP. Thank you so much!
Question : Write a c++ program which creates a Linked List having maximum sum out of two Sorted Linked Lists.For eg: You have two sorted linked lists, create a linked list that contains data with maximum sum. The resulting list with maximum sum will contain nodes with data from both input sorted lists. While creating the resulting list with maximum sum, we may switch to the other input list only at the point of intersection (which mean the two nodes with the same value in the lists). You are only allowed to use O(1) extra space. Input:List1 = 1->3->30->90->120->240->511List2 = 0->3->12->32->90->125->240->249 Output: Following is resulting linked list out of two sorted listsResultingList = 1->3->12->32->90->125->240->511
Define a recursive function named trim; it takes as its arguments a linked list (the head node of it) and a non-negative integer representing the index of an element in the list. The function mutates the linked list such that all elements that occur after the index is removed. Additionally, the function returns a linked list of all the elements that were moved. If the index value exceeds the length of the linked list, it should raise an IndexError. For example, if we defined a list as l1 = LN(1, LN(2, LN 3))) , calling the function would return the linked list LN(2, LN(3)), and the mutated l1 would become LN(1). You must use recursion. def trim(l: LN, index: int) -> LN: