I don’t know if these are right (Some I left blank). Can anyone correct them if

Question

I don’t know if these are right (Some I left blank). Can anyone correct them if they’re wrong and provide a reason for your answer?

Identify which structures you would select based on the given requirements and why. (There may be more than 1 answer, justification counts the most. 1) Data access requires a lot of random access, no particular order. 2) Data amounts are unknown and will vary greatly, no particular order. Arrays 4) Processing incoming data streams (information is being send to your machine) Queues 5.) You are working with United Airlines and need to process information about all their North American flights between cities.

Explanation / Answer

1)

HashTable

Consider a data structure composed of a hashtable H and an array A. The hashtable keys are the elements in the data structure, and the values are their positions in the array.

4) Heaps

When the amount of data is so large that we cannot hope to store it all, we enter the domain of data stream algorithms.

5) Queue

A queue is an example of a linear data structure, or more abstractly a sequential collection. Queues provide services in computer science, transport, and operations research where various entities such as data, objects, persons, or events are stored and held to be processed later.

Related Questions

Navigate

• Browse (All)
• Browse I
• Subjects

---

---

Integrity-first tutoring: explanations and feedback only — we do not complete graded work. Learn more.