-->
Search here and hit enter....

Introduction to Data Structures & Algorithm | Part 1

  Hello Viewer! how are you? I hope you are very well. Today I have learned about the Basic Terminology of Data Structure, the Importance of Data Structure, Selecting an appropriate Data Structure. below I have written whatever I learn today ...

introduction to data structures

Basic Terminology

Our aim has to design a good program that means:-

  • programs run correctly
  • easy to understand
  • easy to debug
  • easy to modify
--If a program is correct then undoubtedly it gives the correct result, but along with it should also run efficiently.

--A program is said to be efficient when it executes in minimum time and with minimum memory space.

--In order to write efficient programs, we need to apply the "Data Management" concept.
  •     "Data Management" is a complex task that includes data collection, Organisation of data into the appropriate structure and developing and maintaining routines for quality assurance.
--Data Structure is a crucial part of data management 
  • A Data Structure is basically a way of storing/structuring data in a computer so that we can access it efficiently. { think of a dictionary, think how searching will become a crucial task if dictionary will not in sorted order, just think how much time it will take to search a single word }
--Data Structure is used in almost every program or software program. some common examples of Data Structures are Arrays, Linked List, Queues, Binary Trees and Hash Tables.

--Data Structure is widely applied in the following areas:-
  • Compiler Design
  • Operating System
  • DBMS
  • Numerical Analysis
  • Graphics
  • Artificial Intelligence
  • Simulation
--When we will study DBMS as a subject we will realize major Data Structure used in the
  • Network Model is "Graphs"
  • Hierarchical Model is "Trees"
  • Relational Model is "Arrays"
--Specific(perfect) data structures are essential ingredients of many efficient algorithms because they help programmers to manage huge amounts of data easily and efficiently.

--Some formal design methods and programming language emphasize "Data Structure and Algorithm" as the KEY factor in software design. This is because representing information is fundamental to Computer Science.

--The primary goal of a program or software is not to perform calculations but to store and retrieve information as fast as possible.

--Be it any problem at hand, by choosing an appropriate "Data Structure" we get the most efficient solution.
  • Any solution is said to be efficient if it solves the problem within the required resource constraint like Space available to store the data, the time allowed to perform subtask.
  • The COST of the solution is the amount of resources it consumes.
  • The COST of the solution is basically measured in terms of a KEY resource such as time.
--Today's Computer programmers do not write programs to just solve a problem but to write an efficient program.
  • For this, they 1st Analyze the problems to determine the performance goals that must be achieved and then think about appropriate Data Structures suitable to the task/problem.


That's All for Today! I hope You like and understand whatever I have written. If you find any error don't forget to mention it in the comment section or mail me. 💗💗

Note:- I learned this from "Data Structure using C" Book written By Reema Thareja.

FB COMMENTS ()