Data Structures & Algorithm Basic Concepts

Data Structures & Algorithm Basic Concepts : Data structure introduction refers to a scheme for organizing data, or in other words a data structure is an arrangement of data in computer’s memory in such a way that it could make the data quickly available to the processor for required calculations.Data Structure is a way of collecting and organizing data in such a way that we can perform operations on these data in an effective way.Data Structures are the programmatic way of storing data so that data can be used efficiently. Almost every enterprise application uses various types of data structures in one or the other way.

Data Structures & Algorithm Basic Concepts

Data Type
There are two data types −

Built-in Data Type

Boolean (true, false)
Floating (Decimal numbers)
Character and Strings
Derived Data Type

  • List
  • Array
  • Stack
  • Queue

Basic types of Data Structures

Example of Abstract Data Structure are :

Linked List
Stack, Queue etc.

What are the basic operations of Data Structures?

  • Traversing
  • Searching
  • Insertion
  • Deletion
  • Sorting
  • Merging

What is Program

A Set of Instructions
Data Structures + Algorithms
Data Structure = A Container stores Data
Algorithm = Logic + Control

#include <iostream>
int main(){
/* My first program in C */
printf("Hello, World! \n");
return 0;

Hope it will Helpful For You.If you Like Please Share with your Friends.Thank you.