Data Structures and Algorithms - Introduction

Welcome to my first blog

This is my first lesson.In this lesson I'm going to talk about a brief introduction about the data structures and algorithms.First of all we should know about the importance of the data structures and algorithms.

Why do we learn data structures and algorithms?.........

When an application is getting complex and data rich, there are three basic problems can happened.

• Data search - If the application is very complex,the searching                          time of a data item is getting very slow.

• Processor speed - The speed although getting falls if the data                                 grows.

• Multiple requests - When large number of users search data                                    simultaneously, the fast servers fails while                                   searching the data.

To solve the above mentioned problems, we can use data structures and algorithms.Data can be organized in a data structure and we can use an algorithm to solve above problems.

Lets I'm going to talk about the data structures.

Data Structures........

Data Structure is a systematic way to arrange and organize data to use effectively and efficiently.There are two foundation terms of the data structures.

• Interface -  Each data structure has an interface.The interface                    provides set of operations that a data structure is                      supported.
• Implementation - This provides internal representation of a                                    data structure.

Characteristics of Data Structures.........

There are three characteristics of each and every data structure.

• Correctness - Implementation and interface of the data                                     structure should be correct.
• Time Complexity - Running time or execution time of a data                                    structure must be small.
• Space Complexity - Memory required of a data structure must                                  be little.

Time Cases

There are three time cases to compare different data structures.

• Worst case - The maximum execution time of an operation of                         a data structure.Any operation of a data structure                       will not take more than worst case time.
• Best case - The minimum execution time of an operation of                         a data structure.Any operation of a data structure                       will not take less than worst case time.

Let's I'm going to talk about algorithms.