Using C or C++ (Object oriented or functions), implement the following classes of data structures: o doubly-linked list of pointers to character arrays (strings): https://en.wikipedia.org/wiki/Doubly linked list Must support forward and reverse traversal (next/previous) Must support adding/removing items from the list Must support checking size of entire list Must support retrieving items from the list in order or reverse order Must support find(x) - returns pointer to object/structure or null TEST CODE must read in a list of words from a file or STDIN and demonstrate each feature above, including how many steps required to search for an item

Using C or C++ (Object oriented or functions), implement the following classes of data structures: o doubly-linked list of pointers to character arrays (strings): https://en.wikipedia.org/wiki/Doubly linked list Must support forward and reverse traversal (next/previous) Must support adding/removing items from the list Must support checking size of entire list Must support retrieving items from the list in order or reverse order Must support find(x) - returns pointer to object/structure or null TEST CODE must read in a list of words from a file or STDIN and demonstrate each feature above, including how many steps required to search for an item

C++ for Engineers and Scientists

4th Edition

ISBN:9781133187844

Author:Bronson, Gary J.

Publisher:Bronson, Gary J.

Chapter7: Arrays

Section7.5: Case Studies

Problem 3E

See similar textbooks

Similar questions

How is an array stored in main memory? How is a linked list stored in main memory? What are their comparative advantages and disadvantages? Give examples of data that would be best stored as an array and as a linked list.
LINKED LIST IMPLEMENTATION Subject: Data Structure and Algorithm in C++Create a Student Record Management system that can perform the following operations:1) Insert student records2) Delete student record3) Show student record4) Search student record The student record should contain the following items1) Name of Student2) Student Matriculation ID number3) Course in which the student is enrolled4) Total marks of the student Approach: With the basic knowledge of operations of Linked Lists like insertion, deletion of elements in linked list, the student record management can be created. Below are the functionalities explained that are to be implemented.●Check Record: It is a utility function of creating a record it checks before insertion that the Record Already exist or not. It uses the concept of checking for a Node with given Data in a linked list.-Create Record: It is as simple as creating a new node in the Empty Linked list or inserting a new node in a non-Empty linked list.-Search…
in c++ Create a single linked list that contains the data (age) of your friends. Perform basic operations including insertion, deletion, searching and display. The insertion operation should only allow a friend’s data to be inserted in sorted order only.
Y3 Using C++ To test your understanding of recursion, you are charged with creating a recursive, singly linked list. You will need to make the class yourself for this data structure. This repository already contains the List ADT and a driver that will create a TUI (terminal user interface) program that uses your data structure to generate a recursive art animation. Submissions that do not compile will receive a zero. You can work on this by yourself or with one other person. LinkedList This class will represent the data structure. Since we want this data structure to be generic, you need to make it a class template. Create two files for this class: a header file (LinkedList.hpp) and an implementation file (LinkedList.tpp). Place these two files in the src directory. It needs to inherit from the List abstract class using the public access specifier. The following are implementation notes for the class. The majority of methods need to be recursive and optimized via tail recursion…
Write a program in C on linked lists based on the following details: • Create a global self-referencing structure called node that holds an integer variable called data and a pointer to the structure node *next • Create the following functions to handle your linked list: o void insert begin) : inserts a node at the beginning of the list o void insert end() : inserts a node at the end of the list • void delete_begin) : deletes the node from the beginning of the list o void delete_end): deletes the node from the end of the list o void display0: displays the whole list on the screen (use printf in your function) In the main function, create a menu for the user to choose from a list of functions to operate. (use switch that evaluates the value of an integer entered by the user to handle your menu. Make sure to provide good prompting on the screen to visualize the menu for the user) • It is important to use a while loop in your main function to display the menu for the user until they…
C++ Programming Language ::::::: Redo the same functions this time as nonmember functions please : NOTE: You can add only one function into the linked list class get_at_position which will return value of element at given position. 1) Insert before tail : Insert a value into a simply linked list, such that it's location will be before tail. So if a list contains {1, 2, 3}, insert before tail value 9 is called, the list will become {1, 2, 9, 3}. 2) Insert before value : Insert a value into a simply linked list, such that it's location will be before a particular value. So if a list contains {1, 2, 3}, insert before 2 value 9 is called, the list will become {1, 9, 2, 3}. 3)Count common elements : Count common values between two simply linked lists.So if a list1 contains {1, 2, 3, 4, 5}, and list2 contains {1, 3, 4, 6}, number of common elements is 3. 4) Check if sorted : Check if elements of simply linked lists are sorted in ascending order or not.So if a list contains {1, 3, 7, 8, 9}…
A dequeue is a list from which elements can be inserted or deleted at either end a. Develop an array based implementation for dequeue. b. Develop a pointer based implementation dequeue.
What is the biggest advantage of linked list over array? Group of answer choices Unlike array, linked list can dynamically grow and shrink With linked list, it is faster to access a specific element than with array Linked list is easier to implement than array Unlike array, linked list can only hold a fixed number of elements
ASSUMING C LANGUAGE True or False: You can have the data portion of a Linked List be a Struct containing a Linked List itself
Write a program in C on linked lists based on the following details: • Create a global self-referencing structure called node that holds an integer variable called data and a pointer to the structure node *next • Create the following functions to handle your linked list: o void insert_begin) : inserts a node at the beginning of the list o void insert_end() : inserts a node at the end of the list o void delete_begin) : deletes the node from the beginning of the list o void delete_end() : deletes the node from the end of the list o void display() : displays the whole list on the screen (use printf in your function) • In the main function, create a menu for the user to choose from a list of functions to operate. (use switch that evaluates the value of an integer entered by the user to handle your menu. Make sure to provide good prompting on the screen to visualize the menu for the user) • It is important to use a while loop in your main function to display the menu for the user until they…
Old MathJax webview Old MathJax webview In Java Some methods of the singly linked list listed below can be implemented efficiently (in different respects) (as opposed to an array or a doubly linked list), others not necessarily which are they and why? b. Implement a function to add an element before the first element. c. Implement a function to add an item after the last one element. d. Implement a function to output an element of the list. e. Implement a function to output the entire list. f. Implement a function to output the number of elements. G. Implement a function to delete an item. H. Implement a function to clear the entire list. I. Implement functionality to search for one or more students by first name, last name, matriculation number or course of study. J. Implement functionality to sort the records of the student, matriculation number and course according to two self-selected sorting methods.
C++ PROGRAM DATA STRUCTURES Write the following C++ PROGRAM to realize the indicated functionality on a singly linked list of integers. A function which accepts a pointer to the first node and returns the maximum value in the list. A function that counts the total number of nodes in the list A function to search a given value in the list and return the node number where the queried value is found A function to display all elements of a list A function swap(Node *p1, Node *p2) that swaps the data in the nodes p1 and p2.