The text edited by a line editor is represented by a doubly linked list of nodes, each of which contains an 80 column line of text (type LineType). There is one external pointer (type LineType*) to this list, which points to the "current" line in the text being edited. The list has a header node, which contains the string "- - - Top of File - - -" and a trailer node, which contains the string "- - - Bottom of File - - -". a. Draw a sketch of this data structure. b. write the type declaration to support this data structure. c. write the class constructor, which sets up the header and trailer nodes

The text edited by a line editor is represented by a doubly linked list of nodes, each of which contains an 80 column line of text (type LineType). There is one external pointer (type LineType*) to this list, which points to the "current" line in the text being edited. The list has a header node, which contains the string "- - - Top of File - - -" and a trailer node, which contains the string "- - - Bottom of File - - -". a. Draw a sketch of this data structure. b. write the type declaration to support this data structure. c. write the class constructor, which sets up the header and trailer nodes

Programming Logic & Design Comprehensive

9th Edition

ISBN:9781337669405

Author:FARRELL

Publisher:FARRELL

Chapter8: Advanced Data Handling Concepts

Section: Chapter Questions

Problem 20RQ

See similar textbooks

Similar questions

An actual working program in C that transfers contents of a file into a linked list and then performs insertion, updation, deletion and search operation on the contents of the file through a linked list. The contents of the file should be treated as a string. And all operations performed on the linked list should reflect on the file. The format of the file is: 112.22.33.44 Baker 101.32.11.23 Parson and so on.. and each line in the file should be treated as a string.
As a student who is currently doing CMPG22, you have been asked to analyse, model and design a LinkedList System that will be used to perform some manipulations on the data list by high school students and their instructors. The list will be given to the system as input and the user will perform some actions on the data as follows: 1. Return the first element in the list, 2. return the last element in the list, 3. remove the head and return the object stored in the removed node, 4. add a new element to the front of the list, 5. add a new element to the end of the list, 6. delete the first item in the list with the SAME VALUE, 7. determine whether a specific object is present (according to value), 8. receives a second linked list as a parameter and will return a third list containing all the elements of the parameter list which are not present in the calling list and lastly, 9. receive the second linked list as a parameter, and return a new linked list consisting of both the parameter…
Please attach a picture，I need downloadable images as an answer. The RL can be implemented without dynamically managed linked lists by creating a new field, next, in each PCB, which points to the next PCB on the same list. Each entry of the RL then points to the first PCB on the list. Assume that RL contains 3 processes at level 5 and 1 process at level 0. Draw a diagram showing the RL and the modified PCBs.
Consider the following example of a programme that builds and manipulates a linked list:What are the two specific nodes that the programme would typically monitor? Describe two common uses of the null reference in the linked list node.
Design and implement a C program to generate a computerized telephone directory for a cellular service consisting of name and cell phone number by using a linked list concept. Present the user with a menu that allows the user to search the directory for a specified record,insert a new record, delete an existing record, print the entire phone list,and sort an existing recond..
you need to design, analyze, and implement algorithms to read in a sequence of characters from standard input and maintain the characters in a linked list with no duplicates. When you read in a previously unseen character, insert it at the front of the list. When you read in a duplicate character, delete it from the list and reinsert it at the beginning. The program implements the well-known move-to-front strategy which is useful for caching, data compression, and many other applications where items that have been recently accessed are more likely to be re-accessed. Requirements: The program should read a sequence of characters. The program should insert unseen character at the front of the list. The program should check if the character is not in the list to be inserted at the front of the list. The program should delete a duplicate character and delete it from the list and insert it at the beginning of the list. The program should check if the character is already in the list and…
The linked list is إختر أحد الخيارات: a. Array of nodes structure b. array of pointers each one point to node structure c. A link that points to another link d. a pointer that points to node structure أخلِ اختياري
Write a rudimentary link program to check whether all variables have been initialized and whether local variables have the same names as global variables. Create a linked list of global variables, and for each function, create a linked list of local variables. In both lists, store information on the first initialization of each variable and check if any initialization has been made before a variable is used for the first time. Also, compare both lists to detect possible matches and issue a warning if a match is found. The list of local variables is removed after the processing of one function is finished and created anew when a new function is encounter. Consider the possibility of maintaining alphabetical order on both lists. Use a java program only.
I need to design, analyze, and implement algorithms to read in a sequence of characters from standard input and maintain the characters in a linked list with no duplicates. When read in a previously unseen character, insert it at the front of the list. When read in a duplicate character, delete it from the list and reinsert it at the beginning. The program implements the well-known move-to-front strategy which is useful for caching, data compression, and many other applications where items that have been recently accessed are more likely to be re-accessed. The program should read a sequence of characters and should insert unseen character at the front of the list. The program should check if the character is not in the list to be inserted at the front of the list. The program should delete a duplicate character and delete it from the list and insert it at the beginning of the list. The program should check if the character is already in the list and delete the character from the list…
There must be 3 files at least. 1 Header file 1 cpp file and driver file/main fileSolve the formulated from using Link List and C++ QUESTION: Given a queue of integers of even length, rearrange the elements byinterleaving the first half of the queue with the second half of thequeue. Only a stack can be used as an auxiliary space. Use Linked Listto solve the task. Input : 11 12 13 14 15 16 17 18 19 20Output : 11 16 12 17 13 18 14 19 15 20
By using the concept of double linked list you are required to implement a module for a social networking site. You have to keep track of user’s posts.A post is comprised of following:1- Message2- Shared with (Public, Friends, Private)3- DateYou have to provide a user friendly interface for the user1. New post2. View posts2.1. View newer post2.2. View by privacy2.3. View allWhen user is viewing the post following options would be available for the user:Press N for next postPress P for the previous postPress E to edit the postPress D to delete the post3. Exit
The linked list is Select one: a. A link that points to another link b. a pointer that points to node structure c. Array of nodes structure d. array of pointers each one point to node structure