File organisation may be defined as a method of storing records
in file. Also, the
subsequent implications on the way these
records can be accessed. The following are the factors
involved in selecting a particular file
organisation:
|
• Ease of retrieval
• Convenience of updates
• Economy of storage
|
Algorithm for the implementation of a
Binary tree:
Step-1: If value of new element <
current element, then go to step-2 or else step -3
|
Step-2: If the current element does not
have a left sub-tree, then make new element the left child of
the current element; else make the
existing left child as current element and go to step-1
|
Step-3: If the current element does not
have a right sub-tree, then make new element the right child of
the current element; else make the
existing right child as current element and go to step-1
|
The process of converting the general
tree to a binary tree is as follows: |
struct d_list{
|
int coeff;
|
int exp;
|
struct d_list *left;
|
struct d_list *right;
|
};
|
typedef struct d_list poly;
|
void poly_create(poly*);
|
The term “Levels of Management’ refers to a line of demarcation between
various managerial positions in an organization. The number of levels in management increases when the size of the business and work force increases and vice versa. The level of management determines a chain of command, the amount of authority & status enjoyed by any managerial position. The levels of management can be classified in three broad categories: -
|
Horizontal Organisational Structure
|
Vertical Organisational Structure
| |
It is also known as process oriented.
|
It is also known as Function oriented.
| |
It is superior to vertical organisational structure.
|
It is inferior to horizontal structure. |
