1) Data structure is a specialized format for organizing and storing data.

General data
structure types include the array, the file, the record, the table, the tree, and so on. Any
data structure is designed to organize data to suit a specific purpose so that it can be
accessed and worked with in appropriate ways. In computer programming, a data
structure may be selected or designed to store data for the purpose of working on it with
various algorithms.

2) Data type in a programming language is a set of data with values having predefined
characteristics. Examples of data types are: integer, floating point unit number, character,
string, and pointer. Usually, a limited number of such data types come built into a
language. The language usually specifies the range of values for a given data type, how
the values are processed by the computer, and how they are stored.

3) Abstract data type (ADT) is a specification of a set of data and the set of operations that
can be performed on the data. Such a data type is abstract in the sense that it is
independent of various concrete implementations.

4) Big-O Notation:
- T(N)=O(f(n)) if there are constant c and n0 such that T(n) <= cf(n)
when n >=no .
5) Big-Omega Notation:
- T(N)=Ω(g(n)): if there are constant c and n0 such that T(n) >= cg(n)
when n >=no .

6) Big-Theta Notation:
- T(N)=Ω(h(n)) if and only if T(n) = O(h(n)) and T(n)= Ω(h(n))

7) Master’s Theorem provides a cookbook solution in asymptotic terms for recurrence

relations of types that occur in practice.

Given a relation of the form:

a = the number of subproblems in the recursion,

1/b = the portion of the original problem represented by each sub-
problem
f(n) = the cost of dividing the problem + the cost of merging the
solution. It is possible to determine an asymptotic tight
bound according to these three cases:
Case 1
Generic Form

If it is true that:

for some constant ε > 0

it follows that:

Case 2
Generic Form

If it is true that:

for some

it follows that:
 Case 3
Generic Form

If it is true that:

for a ε > 0

and if it is also true that:

for a c < 1 and sufficiently large n

it follows that:

8)