1answer.
Ask question
Login Signup
Ask question
All categories
  • English
  • Mathematics
  • Social Studies
  • Business
  • History
  • Health
  • Geography
  • Biology
  • Physics
  • Chemistry
  • Computers and Technology
  • Arts
  • World Languages
  • Spanish
  • French
  • German
  • Advanced Placement (AP)
  • SAT
  • Medicine
  • Law
  • Engineering
lawyer [7]
3 years ago
6

g Q 2 Suppose I need a data structure having the following characteristics: a) must be very space efficient, and b) I have a goo

d idea of how much total data needs to be stored. b) must have fastest access possible, and c) once I add an item to the data structure, I do not remove it. Part 1: What data structure would I choose and why? (2,4) Part 2: If I remove characteristic b, what similar data structure is a possible candidate?
Computers and Technology
1 answer:
SIZIF [17.4K]3 years ago
5 0

Explanation:

a.I would choose an advanced data structure like  dispersion tables.

Scatter tables, better known as hash tables, are one of the most frequently used data structures. To get an initial idea, scatter tables make it possible to have a structure that relates a key to a value, such as a dictionary. Internally, the scatter tables are an array. Each of the array positions can contain none, one or more dictionary entries.

It will normally contain a maximum of one, which allows quick access to the elements, avoiding a search in most cases. To know at which position in the array to search or insert a key, a scatter function is used. A scatter function relates each key to an integer value. Two equal keys must have the same dispersion value, also called a hash value, but two different keys can have the same dispersion value, which would cause a collision.

B. If I eliminated the characteristic b, a possible candidate keeping the previous characteristics would be: Balanced binary trees

Balanced binary trees are data structures that store key-data pairs, in an orderly way according to the keys, and allow quick access to the data, given a particular key, and to go through all the elements in order.

They are appropriate for large amounts of information and have less overhead than a scatter table, although the access time is of greater computational complexity.

Although the storage form has a tree structure internally, this is not externalized in the API, making the handling of the data transparent. They are called balanced because, each time they are modified, the branches are rebalanced in such a way that the height of the tree is as low as possible, thus shortening the average time of access to the data.

You might be interested in
Nathan would like to save his PowerPoint presentation as a video that can be replayed easily on any device at full quality. Whic
valentina_108 [34]

Answer:

Presentation Quality

Explanation:

It will be full quality as it is from when your presenting

6 0
3 years ago
Select the correct answer.
kicyunya [14]

Answer:

D

Explanation:

pecialisation - departments focus on one area of work. productivity - specialism means that staff are skilled in the tasks they do. accountability - there are clear lines of management. clarity - employees understand their own and others' roles.

7 0
3 years ago
Read 2 more answers
Write a C++ program that consist
pshichka [43]

Answer:

Explanation:

The object-oriented paradigm; The compilation process Comments; Library inclusions; Program-level definitions; Function prototypes;

The main program; Function definitions Naming conventions; Local and global variables; The concept of a data type;

Integer types; Floating-point types; Text types; Boolean type; Simple input and

output Precedence and associativity; Mixing types in an expression; Integer division and

the remainder operator; Type casts; The assignment operator; Increment and

decrement operators; Boolean operators

7 0
3 years ago
Contact Us Save
svetoff [14.1K]
All except drinking caffeinated beverages:)))
3 0
3 years ago
What does gif stand for in computer terms?
SSSSS [86.1K]
<span>GIF stands for Graphics Interchange Format</span> which was released by CompuServe in 1987. The Graphics in GIF is why some people argue against it's originally intended pronunciation as "jif" (like the peanut butter) 
4 0
3 years ago
Other questions:
  • Write a function called printEvens that prints all the even numbers between 2 and 20, inclusive. It will take no arguments and r
    6·1 answer
  • Write the proghrams for the following:
    13·1 answer
  • For the Address Block 195.200.0.0/16 a. If you have 320 Customers that need 128 addresses/customer - will there be enough addres
    14·1 answer
  • What's another word for contact print?
    15·2 answers
  • For some reason, Danica's classmate George could not find the registered symbol in the symbol gallery. He is selling
    14·1 answer
  • Yuri, a medical assistant, has been asked to send an account of a patient's last office visit to another doctor's office. The te
    6·2 answers
  • Conclusion for primary memory
    15·1 answer
  • GUYSSS!!!
    5·2 answers
  • In a finite state machine, state transitions happen only: a. When the reset causes a clock pulse on the D outputs of the flip-fl
    11·1 answer
  • How does a cloud-first strategy differ from other approaches to cloud?
    9·1 answer
Add answer
Login
Not registered? Fast signup
Signup
Login Signup
Ask question!