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 delete the character from the list and insert it again at the beginning of the list. You need to implement the List ADT using Linked list implementation for the following operations in a file named “list.h”. You can add any operation if needed: list initialize() boolean IsEmpty (List) list insert (List and character) list delete(List and character) listPointer search (List) Your report should include a write up for the following: Justify and Explain briefly in at least 3 sentences the complexity of each operation in list.h file in terms of Big O notation. Justify your answers and discuss if there is any way to improve the complexity of the designed algorithms.

Database System Concepts

7th Edition

ISBN:9780078022159

Author:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Publisher:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Chapter1: Introduction

Section: Chapter Questions

Problem 1PE

See similar textbooks

Related questions

Question

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 delete the character from the list and insert it again at the beginning of the list.
You need to implement the List ADT using Linked list implementation for the following operations in a file named “list.h”. You can add any operation if needed:
- list initialize()

boolean IsEmpty (List)
list insert (List and character)
list delete(List and character)
listPointer search (List)

Your report should include a write up for the following:
Justify and Explain briefly in at least 3 sentences the complexity of each operation in list.h file in terms of Big O notation.
Justify your answers and discuss if there is any way to improve the complexity of the designed algorithms.

Expert Solution