Page 23 - DCAP407_DATA_STRUCTURE

Data Structure

6. Deletion: Deletion refers to removing an item from the structure. When a node is not required in
the data structure, it can be removed using the delete operation.

A Company has a membership file in which each record contains the following data for a
given member: Name, Sex, Age, and Phone Number.
Suppose the company wants to send email invitations for a party to all the members,
which operation will be used to obtain the name and phone number of each member?
Discuss.

1.6 Summary
• A data structure is the organization or arrangement of data in a computer's memory or disk
storage, so that it can be used efficiently.
• The study of data structure helps students to understand how data is organized and how the data
flow is managed to increase efficiency of any process or program.

• Algorithms are used for data processing, calculations, and automated reasoning. An algorithm can
be defined as a set of rules that accurately define a series of operations.
• A data type comprises a set of data with values and consists of predefined set of characteristics.
The four commonly used data types in C are int (integer), float (real number), char (character), and
pointer.
• Two fundamental goals of data structure are correctness and efficiency. Some of the important
features of data structures are robustness, adaptability and reusability.
• Data structure can be classified into two categories: primitive data structure and non-primitive
data structure.
• Basic data types such as integer, real, character, and Boolean are categorized under primitive data
structures. These data types are also known as simple data types because they consist of characters
that cannot be divided.
• Non-primitive data structures are further divided into linear and non-linear data structure based
on the structure and arrangement of data.
• Arrays, linked lists, stacks, queues are examples of linear data structure. Trees and graphs are
examples of non-linear data structure.

• An Abstract Data Type (ADT) is a technique that is used to specify the logical properties of a data
type. It can be considered as a basic mathematical concept used to define the data types.
• Data that appears in the data structures are processed with the help of certain operations.
Sometimes two or more operations may be used for a data structure in a given situation.
1.7 Keywords
Amorphous: Not having a definite form; shapeless.
Application Program: A program designed to perform a particular function directly for the user or for
another application program.
Private Functions: Functions that can be accessed only by the members of the same data structure.
Public Functions: Functions that can be accessed by the members internal to the data structure as well
as by members of other data structures.

16 LOVELY PROFESSIONAL UNIVERSITY