Scribd
Upload
14 views6 pages

1 Datastructure

Uploaded by

Rehan Khan
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd
14 views6 pages

1 Datastructure

Uploaded by

Rehan Khan
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd
You are on page 1/ 6

What is an Algorithm?

 In computer programming terms, an algorithm is a set of well-defined


instructions to solve a particular problem.

 It takes a set of inputs and produces the desired output.

 For example:- An algorithm to add two numbers:

1. Take two number inputs

2. Add numbers using the + operator

3. Display the result

4. Stop the program


What are data structures?
 Data structure is a storage that is used to store and organize data. It is a way

of arranging data on a computer so that it can be accessed and updated

efficiently.

 Depending on your requirement and project, it is important to choose the

right data structure for your project. For example, if you want to store data

sequentially in the memory, then you can go for the Array data structure.
Why algorithm is important?

 Algorithm is important because computer by itself doesn’t know what

to do? And from where to start and where to stop?

 And by the help of algorithm we tell to computer what to do and from

where to start and where stop the problem or program.


Introduction to data structure
 Data structure can be define as the group of data elements which provides an
efficient way of storing and organizing data in the computer so that it can be
used efficiently. Ex: array , linked list, stack, queue.

 Data structure is about explaining data elements in term of some


relationship, for better organization and storage. Ex ali is string , age is
integer.

 data can be unorganized facts which can not have any meaning . Ex: eman

 The meaningful or processed data is called the information. Ex: name

 It can be used in various aspect of computer science. OS , compiler, graphics

 Different type of algorithm is used in data structure. Ex search algorithm ,


sort algorithm.
Basic terminology in data structure
 Data structure are the building blocks of any program or software. And
choosing the appropriate data structure for a program is the difficult task for
a programmers .

 Following are the terminologies in Data structure :

 Data: data can be define as an elementary value or the collection of value.

Ex: student id and name .

 Group items : data items which have subordinate data items are called as
group data item. Ex : name of student can have first name and last name .

 Record : is the collection of various data items. Ex: student entity can
have ,its name , address ,course, and marks . And it can be group together to
form a record.
Basic terminology in data structure

 File: is a collection of various records of one type entity.

 attribute and entity: an entity represent a class of certain objects,

and each attribute represent the particular property of that entity.

Student attribute is data of birth.

 Field : is a single elementary unit of information representing the

attribute of an entity. Ex: 35 ,student number

You might also like