Scribd
Upload
2 views3 pages

data structure intro

Data structures are essential for storing, organizing, and manipulating data in programming, categorized into linear and non-linear types. Linear data structures, such as arrays and linked lists, store data sequentially, while non-linear structures like trees and graphs organize data hierarchically. Understanding the distinction between data structures and data types is crucial, as data types define the nature of data, whereas data structures are collections of these data types.

Uploaded by

Vijaya kumari
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF or read online on Scribd
2 views3 pages

data structure intro

Data structures are essential for storing, organizing, and manipulating data in programming, categorized into linear and non-linear types. Linear data structures, such as arrays and linked lists, store data sequentially, while non-linear structures like trees and graphs organize data hierarchically. Understanding the distinction between data structures and data types is crucial, as data types define the nature of data, whereas data structures are collections of these data types.

Uploaded by

Vijaya kumari
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF or read online on Scribd
You are on page 1/ 3
Data Structures and Types Data structures are introduced in order to store, organize and manipulate data in programming languages. They are designed in a way that makes accessing and processing of the data a little easier and simpler. These data structures are not confined to one particular programming language; they are just pieces of code that structure data in the memory. Data types are often confused as a type of data structures, but it is not precisely correct even though they are referred to as Abstract Data Types. Data types represent the nature of the data while data structures are just a collection of similar or different data types in one. Data Structures Linear Data Non-Linear Structures Data Structures Array Stack Trees Tries ne Queue Graph There are usually just two types of data structures — @ Linear @ Non-Linear Linear Data Structures The data is stored in linear data structures sequentially. These are rudimentary structures since the elements are stored one after the other without applying any mathematical operations. o 1 2 30 4 5 6 f 8 9 Linear data structures are usually easy to implement but since the memory allocation might become complicated, time and space complexities increase. Few examples of linear data structures include — © Arrays © Linked Lists © Stacks @ Queues Based on the data storage methods, these linear data structures are divided into two sub- types. They are — static and dynamic data structures. Static Linear Data Structures In Static Linear Data Structures, the memory allocation is not scalable. Once the entire memory is used, no more space can be retrieved to store more data, Hence, the memory is required to be reserved based on the size of the program. This will also act as a drawback since reserving more memory than required can cause a wastage of memory blocks The best example for static linear data structures is an array. Dynamic Linear Data Structures In Dynamic linear data structures, the memory allocation can be done dynamically when required. These data structures are efficient considering the space complexity of the program. Few examples of dynamic linear data structures include: linked lists, stacks and queues. Non-Linear Data Structures Non-Linear data structures store the data in the form of a hierarchy. Therefore, in contrast to the linear data structures, the data can be found in multiple levels and are difficult to traverse through: However, they are designed to overcome the issues and limitations of linear data structures. For instance, the main disadvantage of linear data structures is the memory allocation. Since the data is allocated sequentially in linear data structures, each element in these data structures uses one whole memory block. However, if the data uses less memory than the assigned block can hold, the extra memory space in the block is wasted. Therefore, non-linear data structures are introduced. They decrease the space complexity and use the memory optimally, Few types of non-linear data structures are — © Graphs © Trees @ Tries Maps

You might also like

pFad - Phonifier reborn

Pfad - The Proxy pFad of © 2024 Garber Painting. All rights reserved.

Note: This service is not intended for secure transactions such as banking, social media, email, or purchasing. Use at your own risk. We assume no liability whatsoever for broken pages.


Alternative Proxies:

Alternative Proxy

pFad Proxy

pFad v3 Proxy

pFad v4 Proxy