Explain sequential memory organization using suitable data structure
Answers
Answered by
3
In computer science, sequential access means that a group of elements (such as data in a memory array or a disk file or on magnetic tape data storage) is accessed in a predetermined, ordered sequence. Sequential access is sometimes the only way of accessing the data, for example if it is on a tape.
Hash table is a data structure used to implement an associative array, a structure that can map keys to values. The developer can use Hash table in the following use cases. Inserts are generally slow, reads are faster than trees. Hashing is used so that searching a database can be done more efficiently.
Hash table is a data structure used to implement an associative array, a structure that can map keys to values. The developer can use Hash table in the following use cases. Inserts are generally slow, reads are faster than trees. Hashing is used so that searching a database can be done more efficiently.
Similar questions