DATA STRUCTURE AND ALGORITHMS
Data Structure:
It refers to the way data is organized, stored, and manipulated in a computer's memory. It
defines the relationship between data elements, their operations, and the memory required to
store them.
CLASSIFICATION OF DATA STRUCTURE:
LINEAR DATA STRUCTURE:
Linear data structures are data structures in which data elements are organized sequentially,
one after another. These structures are called "linear" because the elements are arranged in a
linear manner, meaning they form a sequence.
Some commonly used linear data structures include arrays, linked lists, stacks, and queues.
Array:
• An array is a fixed-size collection of elements of the same data type.
• Elements in an array are stored in contiguous memory locations.
• Elements can be accessed using an index, which represents their position in the array
(starting from 0).
• Arrays provide efficient random access to elements but have a fixed size.
•
Linked List:
• A linked list is a dynamic data structure where elements are stored in separate objects
called nodes.
• Each node contains the data and a reference (or link) to the next node.
• Nodes in a linked list can be scattered in memory, unlike arrays.
