Ans.

1 A the simplest
​ linear search is

approach employed to search for

an element in a data set. It
examines each element until it
finds a match, starting at the
beginning of the data set, until the
end. The search is finished and
terminated once the target
element is located.
Linear Data Structure

Where data elements are arranged

sequential or every element is
attacked to its previous and next
adjacent is called linear data
structure. Ex. array, stact, Queue
and linked list etc.
Ans.2 Indexed Sequential File (ISF)
is a data storage method that
combines the advantages of
sequential file organization with
the ability to perform indexed
access. In an ISF, data records are
stored in sequential order, allowing
for efficient batch processing.
Additionally, an index structure is
built on top of the sequential file,
enabling direct access to specific
records based on key values. This
combination of sequential and
indexed access makes ISF
suitable for a wide range of data
processing and analytics tasks.
How Indexed Sequential File
Works
In an Indexed Sequential File, data
records are organized into fixed-
length blocks, with each block
containing multiple records. These
blocks are stored sequentially on
the underlying storage medium,
such as a hard disk or solid-state
drive.

Ans.3 Hash Function

A hash function can be defined
function, a input and transforms it
by that talke key as into a hash
index. It is denoted by H.
H:K→M
where H→ hash function.
K→ set of keys
M→ set of memory address.

Ans.6 Big Omega notation (N) :

It is define as lower bound and
lower bound on an algorithm is the
least amount of time required (the
most efficient way possible, in
other words best case). Just like O
notation provide an asymptotic
upper bound, notation provides
asymptotic lower bound.
Let f(n) define running time of an
algorithm; f(n) is said to be (g (n))
if there exists positive constant C
and (n0) such that
0 <= Cg(n) <= f(n) for all n >= no
used to given lower bound on a

function

If a function is (n-square) it is automatically (n) as well.

Graphical example for Big Omega (2):