-what is data structure – introduction to data structures –Data structure and algorithm in C++ – Data structure using C++ -Data structure projects in C++ – Data structure Project idea -Data structure MCQ -Data structure Interview Question –data structure question paper –free course online –past papers -final year projects for computer science with source code -semester project ideas -computer programming -computer science interview questions- tutorial -cui

# What is Data Structure, its application and Implementation

The logical or mathematical modal of a particular data is called data structure.

OR

A way to organized and manipulate the data is called data structure

Firstly, it must be rich enough in structure to mirror the actual relationships of the data in the real world. Secondly, the structure should be simple enough that one can effectively process the data when necessary.

Implementation of the structure on computer, quantitively analysis of the structure, which includes determine the amount of memory needed to store the structure and the time required to process the structure.

### Why Data structure

They offer reusability and abstraction, and employing the right data structures can significantly streamline tasks like data storage, retrieval, and processing, ultimately saving programmers a substantial amount of time. Handling large volumes of data becomes more manageable with their use.

### Types of data structure

Primitive & non-primitive

**Primitive data structure** is a fundamental type of data structure that stores the data of only one type

Example: integer, float, character, pointer

**Non-primitive data structure** is a type of data structure which is a user-defined that stores the data of different types in a single entity. Non-primitive categories into two parts such as linear data structure and non-linear data structure

**Linear**: Linear data structure is a sequential type of data structure, and here sequential means that all the elements in the memory are stored in a sequential manner; for example, element stored after the second element would be the third element and so on. **Example**: Array, Linked list, Stack, Queue.

**Non Linear**: A kind of random type of data structure **Example**: Tree and Graph

** Abstract Data Types**

The definition of ADT only mentions what operations are to be performed but not how these operations will be implemented. The ADT defines the logical form of the data type. The data structure implements the physical form of the data type. For example, a List is an abstract data type that is implemented using a dynamic array and linked list. A queue is implemented using linked list-based queue, array-based queue, and stack-based queue.

Related links

Single link list Stack AVL Trees Binary search Counting Sort

Doubly link list Queue Graphs Bubble Sort Radix sort

Circular link list Binary search tree Hashing Insertion Sort Bucket Sort

Josephus Problem Tree Traversal Heaps Quick Sort Merge Sort

## @ Cui tutorial, courses, past papers and final year projects

#what is data structure # introduction to data structures #Data structure and algorithm in C++ # Data structure using C++ #Data structure projects in C++ # Data structure Project idea #Data structure MCQ #Data structure Interview Question #data structure question paper #free course online #past papers #final year projects for computer science with source code #semester project ideas #computer programming #computer science interview questions# tutorial #cui

#courses #pastpaper #Finalyearproject #tutorial #cui #project #programming #computer science

adx