Programs, Files Data Structures

1
INTRODUCTION
Programs, Files Data Structures :
2
What is a data structure?

• Data Structure is a way to store and organize data so that it can be
used efficiently.
• Data Structure can be defined 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.
3
Examples and use

• Some examples of Data Structures are arrays, Linked List, Stack,
Queue, Tree, graph, etc.
• Data Structures are widely used in almost every aspect of

Computer Science, i.e. Operating System, Compiler Design,
Artificial intelligence, Graphics and many more.
4
Data structures and Algorithms

• Data Structures are the main part of many computer science
algorithms as they enable the programmers to handle the data
in an efficient way.
• It plays a vital role in enhancing the performance of a

software or a program as the main function of the software is
to store and retrieve the user's data as fast as possible.
• Data structures are the building blocks of any program or the

software Choosing the appropriate data structure for a
program is the most difficult task for a programmer.
5
Basic Terminology
• Data: Data can be defined as an elementary value or the collection
of values, for example, student's name and its id are the data about
the student.
• Group Items: Data items which have subordinate data items are
called Group item, for example, name of a student can have first
name and the last name.
• Record: Record can be defined as the collection of various data

items, for example, if we talk about the student entity, then its name,
address, course and marks can be grouped together to form the
record for the student.
6
Basic Terminology
• File: A File is a collection of various records of one type of entity, for
example, if there are 60 employees in the class, then there will be 20
records in the related file where each record contains the data about
each employee.
• Attribute and Entity: An entity represents the class of certain

objects. It contains various attributes. Each attribute represents the
particular property of that entity.
• Field: Field is a single elementary unit of information representing the

attribute of an entity.
7
Need of Data Structures

As applications are getting complexed and amount of data is increasing day by day,
there may arise the following problems:
•Processor speed: To handle very large amount of data, high speed

processing is required, but as the data is growing day by day to the billions
of files per entity, processor may fail to deal with that much amount of data.
•Data Search: Consider an inventory size of 106 items in a store, If our

application needs to search for a particular item, it needs to traverse 106
items every time, results in slowing down the search process.
•Multiple requests: If thousands of users are searching the data

simultaneously on a web server, then there are the chances that a very
large server can be failed during that process
in order to solve the above problems, data structures are used. Data is
organized to form a data structure in such a way that all items are not
required to be searched and required data can be searched instantly.
8
Advantages of Data Structures

• Efficiency: Efficiency of a program depends upon the choice of data
structures. For example: suppose, we have some data and we need to
perform the search for a particular record. In that case, if we organize
our data in an array, we will have to search sequentially element by
element. hence, using array may not be very efficient here. There are
better data structures which can make the search process efficient like
ordered array, binary search tree or hash tables.
• Reusability: Data structures are reusable, i.e. once we have

implemented a particular data structure, we can use it at any other
place. Implementation of data structures can be compiled into libraries
which can be used by different clients.
• Abstraction: Data structure is specified by the ADT which provides a

level of abstraction. The client program uses the data structure through
interface only, without getting into the implementation details.
9
Data Structure Classification

10
Linear/Non-linear Data Structures

• Linear Data Structures: A data structure is called linear if all of its
elements are arranged in the linear order. In linear data structures,
the elements are stored in non-hierarchical way where each
element has the successors and predecessors except the first
and last element.
• Non Linear Data Structures: This data structure does not form a
sequence i.e. each item or element is connected with two or
more other items in a non-linear arrangement. The data elements
are not arranged in sequential structure.
11
Operations on data structure
1) Traversing: Every data structure contains the set of data elements. Traversing
the data structure means visiting each element of the data structure in order to
perform some specific operation like searching or sorting.
Example: If we need to calculate the average of the marks obtained by a student in

6 different subject, we need to traverse the complete array of marks and calculate
the total sum, then we will divide that sum by the number of subjects i.e. 6, in order
to find the average.
2) Insertion: Insertion can be defined as the process of adding the elements to the
data structure at any location.
If the size of data structure is n then we can only insert n data elements into it.
3) Deletion: The process of removing an element from the data structure is called
Deletion. We can delete an element from the data structure at any random location.
If we try to delete an element from an empty data structure then underflow occurs.
12
Operations on data structure

4) Searching: The process of finding the location of an element within the
data structure is called Searching. There are two algorithms to perform
searching, Linear Search and Binary Search. We will discuss each one of them
later in this tutorial.
5) Sorting: The process of arranging the data structure in a specific order

is known as Sorting. There are many algorithms that can be used to perform
sorting, for example, insertion sort, selection sort, bubble sort, etc.
6) Merging: When two lists List A and List B of size M and N respectively, of
similar type of elements, clubbed or joined to produce the third list, List C of
size (M+N), then this process is called merging
13
Basic information – Course

material
book:
◦ Data Structures and Algorithms in Java by Robert Lafore.
ISBN-
13: 978-0672324536, ISBN-10: 0672324539
◦ Link: https://www.amazon.com/Data-Structures-Algorithms-
Java-2nd/dp/0672324539
References
◦ Michael McMillan. Data Structures and Algorithms Using C#,
2007, Cambridge University Press, New York.
◦ C++ Plus Data Structures, 3rd edition, Nell Dale university of
Texas, Austin 2003, Jones and Bartlett Publishers, ISBN 0-
7637-
0481-4.
◦ Data Structures and Program Design in C++, Prentice
Hall,1999.
Robert L. Kruse and Alexander J. Ryba.
◦ Data Structures and the Java Collections Framework,
McGraw-
Hill, 2002. Collins.

Programs, Files Data Structures

Uploaded by

Copyright:

Available Formats

Programs, Files Data Structures

Uploaded by

Document Information

Original Title

Copyright

Available Formats

Share this document

Share or Embed Document

Sharing Options

Did you find this document useful?

Is this content inappropriate?

Copyright:

Available Formats

Programs, Files Data Structures

Uploaded by

Copyright:

Available Formats

1

What is a data structure?

• Data Structure can be defined as the group of data elements which

Examples and use

• Data Structures are widely used in almost every aspect of

Data structures and Algorithms

• It plays a vital role in enhancing the performance of a

• Data structures are the building blocks of any program or the

• Record: Record can be defined as the collection of various data

• Attribute and Entity: An entity represents the class of certain

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

Need of Data Structures

•Processor speed: To handle very large amount of data, high speed

•Data Search: Consider an inventory size of 106 items in a store, If our

•Multiple requests: If thousands of users are searching the data

Advantages of Data Structures

• Reusability: Data structures are reusable, i.e. once we have

• Abstraction: Data structure is specified by the ADT which provides a

Data Structure Classification

Linear/Non-linear Data Structures

Operations on data structure

Example: If we need to calculate the average of the marks obtained by a student in

Operations on data structure

5) Sorting: The process of arranging the data structure in a specific order

Basic information – Course

You might also like