Introduction of Data Structure and Algorithm

Example:

Data Structure mainly refers to the basic organization of which data stores in our computers. In short we can say that the basic logical and mathematical organization of data is called as data structure.
Some Terminologies of data structure:

programing with CStechBD

DATA:
It is important to know about what is data? So as some observation in our daily life we can say that data is any kind of description, measurement, results, statistics of any observation etc. But in computer data refers to some collection of anything that may be any information, values, measurement etc.
DATA ITEM:
A single unit of values of any collection, analysis or records is called data item.
Data item has two terms:

Group items: If any data items can be divided into sub-items that are called group items.
Elementary items: If we are unable to divide any data item into two or more sub-item then it is called elementary item.
Suppose we have a collection of our friends name (here name consists of first name and last name) and there phone number.
Such as:
Here in fig:-01 we can see that there is a table containing one of our friend name and his contact no. So this is a collection of information that we refers to data. Here the column name and contact no. is data item. And the item name consists of two sub-items

• First name
• last name

So, the data item name is the group item. And here the item has no sub-item so this is an elementary item.
Entity:
Entity is a kind of data attributes that may have some properties containing values. And the values may be numeric or nonnumerical.
In fig:-01 the each attributes such as name, contact no. has some values so it is an entity.
Primary Key:
A primary key is the value of any properties of a record (such as fig: 01) that determine itself uniquely from the other properties.
In fig:-01 the contact no. of any person is the primary key to search. Cause the contact no. must be unique to different person.
Data structure:
In computers the data stores with different ways here some are given below:

• Arrays
• Link List
• Trees
• Stack
• Queue

The details of these will be discussed in the next section…………………