Data Structures and Algorithms Basic

Data Structure

Home Next

---

Store your data efficiently !!

With data structure you can improve your system performance

In this tutorial you know everything about data structure from scratch to advance

Data Structure is easy to learn - You will enjoy it !!

---

What is Data Structures ?

Data structure is a way of storing and organizing information ( Data ) in a computer memory. So that it can be use efficiently , when it require.

Without good knowledge of data structures and algorithms you will be only a monkey coder.

It is the most fundamental concept in Computer Science and good knowledge of it help you to design and develop efficient software system.

It enable the programmers to manage huge amount of data easily and efficiently.The primary goal of data structure is to store and retrieve information as fast as possible.

Do you know the story of the stork and the fox ? Imagine the two to be different algorithms trying to work on the same data structure.

Data structures are containers in which we store information. The containers are chosen according to our requirements. Sometimes, we need to manipulate this information, while the rest of the times we just need to query it. Depending on the container, we can change or retrieve information efficiently.

Using the wrong data structure would be equivalent to using a baseball bat in cricket. You should carefully read about which data structures are suggested for a given algorithm.

Types of Data Structures

Data structures are generally categorize into two classes: primitive and non-primitive data structures.

Primitive data structure

These are the fundamental data structure that are available in most of programming language . The primitive data structure are used to represent single value .
Example include integer, byte , long , double, float, short, character and Boolean.

Non primitive data structure

These are those data structures which are created using primitive data structures. These data structure are used to store group of values.

In this series of tutorials we mainly concern on the various non primitive data structures.

Non-primitive data structures can further be classified into two categories: linear and non-linear data structures.

Linear data structures

A data structure is said to be linear if its elements form a sequential or a linear list.

Examples

Array

Linked list

Stacks

Queues

Non-linear data structure

A data structure is said to be non-linear if its elements are stored in a hierarchical order.

Examples

Tree

Graph

Operations on Data Structures

Traversal : Visit every part of the data structure

Search : Traversal through the data structure for a given element

Insertion: Adding new elements to the data structure

Deletion : Removing an element from the data structure

Sorting : Rearranging the elements in some type of order (e.g Increasing or Decreasing)

Merging : Combining two similar data structures into one

Home Next

Share this

yashcode