These include arrays, lists, linked lists, stacks, queues, hashing and trees. Better data organization ensures efficient utilization of the computer. 3.1: Activity 1 - Data Structures This section introduces the learner to the different data structures that are used to organize data in the computer.Trees: a data structure made up of nodes or vertices and edges and is not cyclic.Hashing: a method for storing and retrieving records from a database.Queues: an abstract data type or collection in which the entities in the collection are kept in order and the only operations on the collection are the addition of entities to the rear terminal position, and removal of entities from the front terminal position.Stack: a particular kind of abstract data type or collection in which the principal operations on the collection are the push and pop.Linked Lists: a data structure consisting of a group of nodes which together represent a sequence.
Lists: an abstract data type that represents a sequence of values, where the same value may occur more than once.Array: a fixed length, ordered collection of values of the same type stored in contiguous memory locations.Abstract data type: the carrier set together with their operations.Data structure: the programmatic way of storing data so that data can be used efficiently.
0 kommentar(er)
