Data Structures Flashcards
is representation of the logical relationship existing between individual elements of data.
Data structure
is a way of organizing all data items that considers not only the elements stored but also their relationship to each other
Data structure
is a step by step procedure to solve
a particular function
algorithm
is a set of instructions written to carry out certain tasks & the data structure is the way of organizing the data with their logical relationship retained
algorithm
Data structure are normally divided into two broad categories
- Primitive Data Structure
- Non-Primitive Data Structure
What are examples of Primitive Data Structures?
Integer, Float, Character, Pointer
Two kinds of non-primitive Data Structures
Linear List, Non-Linear List
examples of Linear Lists include
Array, Link List, Stack, Queue
examples of Non-Linear Lists include
Graph, Trees
These are basic structures and directly operated upon by the machine instructions
Primitive Data Structure
derived from primitive structures, structured grouping of homogenous or heterogenous data items, sophisticated structuring and operations.
Non-primitive data structure
is generally a basic structure that is usually built into the language, such as an integer, a float
Primitive Data Structure
is built out of primitive data structures linked together in meaningful ways, such as a or a linked-list, binary search tree, AVL Tree, graph etc
Non-primitive data structure
Identify the Data Structure:
is defined as a set of finite number of
homogeneous elements or same data items, can contain one type of data only,
either all integer, all float-point number or all character
array
Identify the Data Structure:
the first element of this data structure has an index of [0] and its elemets are always stored consecutively in memory location
array
Some common operation performed on array are
- Creation of an array
- Traversing an array
- Insertion of new element
- Deletion of required element
- Modification of an element
- Merging of arrays
Identify the Data Structure:
can be defined as a collection of variable number of data items.
Lists (Linear linked list)
Identify the Data Structure:
the elements of this data structure contain at least two fields, one for
storing data or information and other for storing address of next element.
Lists
Identify the Data Structure:
each such element is referred to as a node, thus it can be defined as a collection of nodes
List
Types of linked lists
- Single linked list
- Doubly linked list
- Single circular linked list
- Doubly circular linked list
Identify the Data Structure:
is also an ordered collection of elements like arrays, but it has a special feature that deletion and insertion of elements can be done only from one end called the top of the stack
Stack
Identify the Data Structure:
it is also called as last in first out
type of data structure
Stack
Identify the Data Structure:
when an element is inserted into or removed from this data structure, its base remains fixed while the top changes
Stack
Insertion of element into stack is called
PUSH
deletion of element from stack is called
POP
The stack can be implemented into two ways:
- Using arrays (Static implementation)
- Using pointer (Dynamic implementation)
Identify the Data Structure:
first in first out type of data structure
Queue
Identify the Data Structure:
new elements are added to the data structure from one end called REAR end and the element are always removed from other end called the FRONT end
Queue
The queue can be implemented into two ways:
- Using arrays (Static implementation)
- Using pointer (Dynamic implementation)
Identify the Data Structure:
non-linear type of data structure in which data items are arranged or stored in a sorted sequence
Tree
Identify the Data Structure:
represent the hierarchical relationship between
various elements
Tree
In trees, there is a special data item at the top of hierarchy called the
Root of the tree
Identify the Data Structure:
organizes the data into branches,
which related the information
Tree
The tree always grows in length towards what direction in data structures
The tree always grows in length towards bottom
Identify the Data Structure:
In this structure, an edge links two vertices, often with associated weights like length or cost. Vertices are represented as points or circles, while edges are depicted as arcs or line segments.
Graph
Types of Graphs
- Directed graph
- Undirected graph
- Simple graph
- Weighted graph
- Connected graph
- Non-connected graph
Identify the Data Structure:
these data structures provide constant-time average-case performance for key-value pair operations, making them ideal for implementing dictionaries, caches, and symbol tables.
Hash Tables
Identify the Data Structure:
these are tree-based data structures used for efficient string searching and autocomplete functionality. They enable fast prefix matching and word retrieval
Tries
Identify the Data Structure:
these are tree-based data structures used primarily in priority queue implementations. They ensure efficient extraction of the maximum or minimum element
Heaps
