Related questions
Concept explainers
Write a struct Student that has member variables: (string) first name, (int) age and (double) fee. Write the functions as described in the class for the following purposes.
1. Write a c++ function to create a dynamic sorted (in ascending order according to the age)doubly linked list, where the data component of each node is an instance of the struct
Student.
2. Write a function to insert the instances in the linked list. You also need to write a function to find the spot for insertion of the nodes.
3. Write a function to remove the node from the linked list.
4. Write a function to count the elements of the linked list.
5. Write a function to determine check whether an element belongs to the linked list.
6. Write a function to print the linked list (from head node) on the console.
7. Write a function to print the linked list (from tail node) on the console.
Implement the above functions as follows.
Initially, the list must have five nodes that are the instances of the struct whose member variable age are: 18, 21, 25, 27 and 33. Insert three nodes that are instances of the struct with age variable: (i) 17, (ii) 23 and (iii) 34. Print the list from head node (in ascending order). Remove three nodes
that are instances of the struct with age variable 17, 25, and 34. Print the list from tail node (in descending order). Search the list to find whether an element that corresponds to the student with age 23. Insert a node that is an instance of struct with age variable 29. Print the number of elements
in the list. Print the list from head (in ascending order) on the console
Trending nowThis is a popular solution!
Step by stepSolved in 5 steps with 4 images
- Assignment 6 - More on ListsWrite pseudo-code not Python for problems requiring code. You are responsible for the appropriate level of detail.The questions in this assignment give you the opportunity to explore a new data structure and to experiment with the hybrid implementation in Q3. 1. A deque (pronounced deck) is an ordered set of items from which items may be deleted at either end and into which items may be inserted at either end. Call the two ends left and right. This is an access-restricted structure since no insertions or deletions can happen other than at the ends. Implement the deque as a doubly-linked list (not circular, no header). Write InsertLeft and DeleteRight.2. Implement a deque from problem 1 as a doubly-linked circular list with a header. Write InsertRight and DeleteLeft.3. Write a set of routines for implementing several stacks and queues within a single array. Hint: Look at the lecture material on the hybrid implementation.arrow_forwardplease code in python The following code defines a list of names and also contains a header for the function best. The best function takes two arguments: a generic scoring function, score, and a list of strings, names. Fill in the function so that it applies a score function to each string in the names list and returns the name with the highest score. If there are ties in the list, your function should return the first item with the maximum score. The best function needs to be designed so that it can take any scoring function and return the name with the highest score. For this question, define a function called len_score that returns the length of a word. Call the best function with the len_score function as a parameter. Example: names = ["Ben", "April", "Zaber", "Alexis", "McJagger", "J.J.", "Madonna"] best(len_score, names) -> 'McJagger'arrow_forwarduse replit please Thank youarrow_forward
- use repli please. thanarrow_forwardplease help me to answerarrow_forwardPlease just use main.cpp,sequence.cpp and sequence.h. It has provided the sample insert()function. No documentation (commenting) is required for this assignment. This assignment is based on an assignment from "Data Structures and Other Objects Using C++" by Michael Main and Walter Savitch. Use linked lists to implement a Sequence class that stores int values. Specification The specification of the class is below. There are 9 member functions (not counting the big 3) and 2 types to define. The idea behind this class is that there will be an internal iterator, i.e., an iterator that the client cannot access, but that the class itself manages. For example, if we have a Sequence object named s, we would use s.start() to set the iterator to the beginning of the list, and s.advance() to move the iterator to the next node in the list. (I'm making the analogy to iterators as a way to help you understand the point of what we are doing. If trying to think in terms of iterators is confusing,...arrow_forward
- Text book imageDatabase System ConceptsComputer ScienceISBN:9780078022159Author:Abraham Silberschatz Professor, Henry F. Korth, S. SudarshanPublisher:McGraw-Hill EducationText book imageStarting Out with Python (4th Edition)Computer ScienceISBN:9780134444321Author:Tony GaddisPublisher:PEARSONText book imageDigital Fundamentals (11th Edition)Computer ScienceISBN:9780132737968Author:Thomas L. FloydPublisher:PEARSON
- Text book imageC How to Program (8th Edition)Computer ScienceISBN:9780133976892Author:Paul J. Deitel, Harvey DeitelPublisher:PEARSONText book imageDatabase Systems: Design, Implementation, & Manag...Computer ScienceISBN:9781337627900Author:Carlos Coronel, Steven MorrisPublisher:Cengage LearningText book imageProgrammable Logic ControllersComputer ScienceISBN:9780073373843Author:Frank D. PetruzellaPublisher:McGraw-Hill Education