Date Structure

What is Data Structure?

Data Structure is a method for gathering and sorting out information so that we can perform operations on this information in an efficient manner.

Data Structures are tied to rendering information components in some relationship, for better association and capacity. For instance, we have a few information which has, player’s name “Dravid” and age 26. Here “Dravid” is of String data type, and 26 is of the number data type. We can sort out this information as a record like Player record, which will have both player’s names and ages in it. Presently we can collect and store a player’s records in a document or database, which is known to be data structure—for example, “Nehru” 30, “Parthiv” 31, “Yuvraj” 33.

If you know about Object Oriented programming ideas, at that point, a class additionally does. Likewise, it gathers a distinctive sort of information under one single substance. The main distinction being, data structures accommodate methods to get to and control information proficiently. In basic language, Data Structures are are programed and customized to store requested Data, with the goal that different operations can be performed on it, no problem at all. It serves as the information of data to be sorted out in memory. It ought to be planned and executed in a way that it decreases the multifaceted nature and increases productivity.

Different Types of Data Structures

As we have examined above, whatever can store information can be called a Data structure, thus Whole number, Buoy, Boolean, Roast, and so on, all are Data structures. They are technically known to be Primitive Data Structures. 

At that point, we likewise have some unpredictable Data Structures, which are utilized to store enormous and connected Data.

Some cases of Abstract Data Structure are given below : 

  • Linked List
  • Tree
  • Graph
  • Stack, Queue, etc.
  • Lists: They are a group of the same type of items with a connection to the previous or the next data items.
  • Arrays: They are a set of homogeneous values
  • Records: they are a set of fields, where each of the fields consists of data belonging to one data type.

Every one of these information structures permits us to perform various operations on information. We select these information structures depending on what kind of operation is required.

What is an Algorithm?

An Algorithm is a limited set of directions or rational, written in a certain order, to achieve a Particular predefined Job. The algorithm isn’t a finished code or program, it is only the center logic(solution) of an issue, which can be communicated either as an elevated level description as pseudocode or utilizing the flowchart.

Every Algorithm must always fulfill these certain properties: 

  • Definiteness– Every single step of the Algorithm should be relevant, concise, and well defined.
  • Input– There should always be 0 or more inputs given externally to the Algorithm.
  • Output– There must be a minimum of 1 output extracted.
  • Finiteness– The Algorithm must have a limited number of steps.
  • Accuracy: Every single step of an Algorithm must generate a correct result.

/ General

Search Posts

About the Author

Share the Post

Comments

No comment yet.

Leave a Reply

Your email address will not be published. Required fields are marked *