Fundamental concepts of Data Structure

A computer is a programmable data processing machine that accepts input, instructions to process the program, and generates the required output. The data and the program instruction are stored in the computer's memory. So to better utilization of memory efficiency, we want to store that data into computer's memory in an efficient way. So before going deep into the data structure, just remember these few fundamental concepts of data structure given below:

1. Abstract Data type: Data and the operations on the data are encapsulated and hidden from the user. An abstract data type is a data declaration packaged together with the operations that are meaningful for the data type. It includes the declaration of data, implementation of operations and encapsulation of data and operations.
2. Algorithm: A step-by-step solution of a given problem is known as algorithm. It is independent of any computer system as well as any programming language.
3. Assembler: It is a software that translates assembly written code to machine language ( which is understood by computer system).
4. Compiler: It is a software that translate higher level language (like C, C++, Java etc) written code into machine language ( which is understood by computer system)
5. Data: It is piece of information which is used in any computer program like data input, data manipulation and data output etc.

6. Data Object: A data object provide a container to store the value of any data in it. A data object is a run-time instance of any data used in any computer program.
7. Data Structure: Data Structure refer to data and representation of data objects within a program, i.e the implementation of structured relationships. A data structure is a collection of atomic and composite data types into a set with defined relationships. By structure, we mean a set of rules that holds the data together. 
8. Data Type: It specifies the type of data that a variable may hold in the computer programming language. 
9. Flowchart: It is a pictorial representation of an algorithm used for better understanding of problem. 
10. Non-Linear Data Structure: In this types of data structure, data element have only one predecessor as well as successor. Data elements in this data structure do not follow any sequence.   

11. Linear Data Structure: In this types of data structure, data element may have more than one predecessor as well as successor. Data elements in this data structure follow any sequence.
12. Program: A set of instruction written in any programming language to solve a problem is known as program.

Mukesh Rajput

Mukesh Rajput

Mukesh Rajput

I am a Computer Engineer, a small amount of the programming tips as it’s my hobby, I love to travel and meet people so little about travel, a fashion lover and love to eat food, I am investing a good time to keep the body fit so little about fitness also..

Post A Comment:


Mukesh Rajput