For each scenario described below, discuss the algorithm and the data structure you would use to count the occurrences of characters in a file given the following constraints. Present a discussion on the algorithm only, do not present source code. The program must utilize the minimum amount of memory throughout the duration of the program. The program must minimize the power consumption used by the program (limit the CPU load). The program will be required to load the frequencies once, but the program will access the individual frequencies often during the execution of the program. Provide a design that conserves memory utilization while providing the fastest access to the data. The program will need to calculate the frequencies, but the program must preserve the order in which the characters were encountered while processing the file. That is, the order of the elements in the data structure(s) must be the order in which they were first encountered in the file. The program must conserve both CPU and memory with memory being the most important. The program will not be reading a file, but a network stream for input. Characters will be sent via a socket program to the counting program. The program must continuously track the frequencies of all characters encountered while the program is running. A key constraint is that the list must always be sorted in frequency order so that the smallest frequency is the first element and the largest frequency is the last element. The access speed of the largest and smallest element is the most important constraint followed by memory consumption.

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

For each scenario described below, discuss the algorithm and the data structure you would use to count the occurrences of characters in a file given the following constraints. Present a discussion on the algorithm only, do not present source code.
1. The program must utilize the minimum amount of memory throughout the duration of the program.
2. The program must minimize the power consumption used by the program (limit the CPU load).
3. The program will be required to load the frequencies once, but the program will access the individual frequencies often during the execution of the program. Provide a design that conserves memory utilization while providing the fastest access to the data.
4. The program will need to calculate the frequencies, but the program must preserve the order in which the characters were encountered while processing the file. That is, the order of the elements in the data structure(s) must be the order in which they were first encountered in the file. The program must conserve both CPU and memory with memory being the most important.
5. The program will not be reading a file, but a network stream for input. Characters will be sent via a socket program to the counting program. The program must continuously track the frequencies of all characters encountered while the program is running. A key constraint is that the list must always be sorted in frequency order so that the smallest frequency is the first element and the largest frequency is the last element. The access speed of the largest and smallest element is the most important constraint followed by memory consumption.

Expert Solution

Trending now

This is a popular solution!

Step by step

Solved in 6 steps

SEE SOLUTION Check out a sample Q&A here

Knowledge Booster

Learn more about

Need a deep-dive on the concept behind this application? Look no further. Learn more about this topic, computer-science and related others by exploring similar questions and additional content below.

Similar questions