is a named location that can be used to store and

organize data.

is a collection of steps to solve a

particular problem.

is a collection of instructions to perform a specific

task.

is a step-by-step procedure, which defines a set of instructions

to be executed in a certain order to get the desired output.

Algorithm to search an item in a data structure.

Algorithm to sort items in a certain order.

Algorithm to insert item in a data structure.

Algorithm to update an existing item in a data structure.

Algorithm to delete an existing item from a data structure.

Definition should define a single concept.

Definition should be able to be mapped to some data element.

Definition should be unambiguous.

Definition should be understandable

represents an object having a data.

is a way to classify various types of data such as integer, string, etc. which

determines the values that can be used with the corresponding type of data, the type

of operations that can be performed on the corresponding type of data.

Those data types for which a language has built-in support are known as __________

Those data types which are implementation independent as they can be

implemented in one or the other way are known as

The data in the data structures are processed by certain operations. The particular data structure

chosen largely depends on the frequency of the operation that needs to be performed on the

data structure.

is a container which can hold a fix number of items and these items

should be of the same type.

Each item stored in an array is called an _________

Each location of an element in an array has a numerical _____,

which is used to identify the element.

print all the array elements one by one.

Adds an element at the given index.

Deletes an element at the given index

Searches an element using the given index or by the value

Updates an element at the given index.