1 / 1

Types of Data Structure

Any programming language's data structure is a foundational principle for algorithmic architecture. DS is a representation of data and the relationships between different data that aids in the efficiency with which numerous tasks, processes, and algorithms can be implemented.

learnbay_datascience
Download Presentation

Types of Data Structure

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript

  1. DATA STRUCTURES How Computers Store Data 1) ARRAYS - Array are bins of consecutive memory to hold data of the type specified when you create the array. 2) HASH TABLES - A Hash table to a data type made from an array to be able to store and retrieve data in constant runtime, based on a hash of the kery which mops to the arrayi ndex 3) LINKED LIST - A Data structure comprised of nodes that solve data and point to the next node. Insert in 0(1) constant time, searches in 0(N). uses dynamic amounts of memory without nedding to resixe. 4) QUEUES AND STACKS - Queues are a first in first out data, FIFO, structure similar to a line. the oldest element is retrieved by calling dequeue() 5)TREES - A Tree is a subtype of a graph that typically imposes the role that nodes pof the tree do not crate loops in the data structure, A common use is search tree which can retrieve data in binary time of 0(log N)

More Related