Data Structures and Algorithms Terminologies

Study Notes

An algorithm is a set of instructions for solving a problem that involves logic and comparisons.
Algorithms are crucial for instructing computers to perform specific tasks, as they form the basis of computer programs.
A data structure is a representation of relationships between individual data elements.
Data structures organize and store data, considering both the elements themselves and their relative positions.
Data management is essential for computer systems, where data is represented, stored, organized, processed, and managed.
Raw data is unprocessed facts, such as values.
Data items are individual units of data, often representing a specific value.
A data type describes the nature of data, informing the compiler or interpreter how to handle and interpret it.
Data types group similar data together based on shared characteristics and properties.
Integers represent whole numbers, signed or unsigned, with a range determined by the allocated memory.
Real numbers represent values with decimal points, signed or unsigned.
Characters represent symbolic information, such as letters, numbers, and special characters, assigned with integer codes.
Data structures combine different data types into a single organized unit.
A class in Object-Oriented Programming also gathers different data types, but data structures emphasize techniques for efficient data access and manipulation.