Abstract
This chapter focuses on the data structures that are most commonly used in microcomputers to help store data. A data structure is an abstract idea, which is used as a reference for storing data. It is like a template for a drawing. The data structure affects both static and dynamic efficiency. Besides the compactness and speed of the program itself, the compactness of the data may be affected by the structure used to store it. Using the right data structure, can also improve clarity because the techniques to access the structure for a particular program may be more transparent than with a less appropriate structure. The chapter also discusses types of data structures. Indexed data structures: vector data structure is the most common example of an indexable data structure. A vector is a sequence of elements (or components), each of which is labeled by a number called an index. Sequential data structures: the ubiquitous string and various deques, including the stack, are sequential structures. The last structure is the powerful linked list structure. Its definition is rather tedious and it is not as widely used in microcomputer systems.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
