Introduction to Data Structures and Algorithms
Welcome to Introduction to Data Structures and Algorithms course. In this post, we Explain the specification of data structure.
In this blog, We will begin with some simple definitions and questions as well as explain the specification of data structure. we have figured out the most relevant answer to the common queries of the data structure regarding.
Why Data Structures ?
- They help to manage and save the data in a structured form.
- Data Structures(DS) help to organization of data needed to solve the problem.
- DS make code cleaner and easier to understand.
- They make a difference between “OK” program and “OUTSTANDING” program
Definition Of Data Structure
A data structure is a way of “organizing data” so that it can be “used effectively“. Here we used two terms organizing data and used effectively the meaning of these terms is “relationship among different available data items (like int, float, array, etc ) to along with a set of operation (like Traverse, Insertion, Deletion, Search, Update) which can be performed on it”.So we can say
Data Structure = Available Data + Valid Operation on them
Choosing the best data structure
Choosing the best data structure and algorithm is a very important part of any programming. Suppose that you are a Data Science student and you have to write a code to traverse the huge amount of data. If you not choosing the best data structure than it will take five-to-six hours to one day but if you choose the best data structure than it will traverse in five-to-six minutes.
For example :
- Suppose you have to solve a problem where first come and first serve system is used at that particular type, QUEUE type data structure is most suitable
- Some times you have to address the last element to give first priority first in this situation STACK type data structure is good for you.
- Suppose you are working on transportation type project problem than you have preferred to use GRAPH type data structure
Types of Data Structure
Some point should be noted
- Liner Data Type is also known as sequential Data Type
- Non-Linear Data Type is also known as random Data Type
Here, we will only look at its graphical representation of a non-primitive data structure. In the next posts of this course, we will study each subject in detail.
Common and Basic Operation of Data Structure
Traverse − print all the elements one by one.
Insertion − Adds an element.
Deletion − Deletes an element.
Search − Searches an element.
Update − Updates an element.
Allowed operations are used to related data one by one.
No single data structure works admirably for all reasons & purposes, and so it is important to know the ability, and restrictions & limitations of several of them.
Informally, an algorithm is any well-defined computational procedure that takes some value, or set of values, as input and produces some value, or set of values, as output.
An algorithm is thus a sequence of computational steps that transform the input into the output.
An algorithm is said to be correct if, for every input instance, it halts with the correct output. We say that a correct algorithm solves the given computational problem. An incorrect algorithm might not halt at all on some input instances, or it might halt with an answer other than the desired one. Contrary to what one might expect, incorrect algorithms can sometimes be useful, if their error rate can be controlled.