(i) Software Management
(a) Processor Management
(b) Memory Management
(c) Device Management
(ii) Hardware Management
(a) File Management
(b) Tools Management
(c) Data Security.

Segments require hardware support in the form of a segment table which usually contains the physical address of the segment in memory, its size, and other data such as access protection bits and status (swapped in, swapped out, etc).

(i) An as is a system software which serves as the interface between a user and computer.
(ii) It is defined as a collection of programs that coordinates the operations of computer hardware and software.
(iii) On the basis of interaction, the Operating systems are divided in two types as GUI and CUI.

(i) OS security management refers to specified steps or measures used to protect the as from threats, viruses, worms, malware or remote hacker intrusions.
(ii) OS security encompasses all preventive-control techniques, which safeguard any computer assets capable of being stolen, edited or deleted if OS security is compromised.

(i) Any type of data in a computer is stored in the form of files and directories/folders through File Allocation Table (FAT).
(ii) The FAT stores general information about files like filename, type(text or binary), size, starting address and access mode (sequential/indexed sequential /direct/relative).

(i) To hide details of hardware by creating abstraction.
(ii) To allocate resources to processes.
(iii) Provide a interactive and effective interface.

A mobile operating system controls a mobile device and its design supports wireless communication and different types of mobile applications. It operates 012 smart phones Tablets and Digital Mobile devices.
(i) Google Android
(ii) Apple iOS
(iii) Blackberry
(iv) Symbian

The following algorithms are mainly used to allocate the job (process) to the processor.
(i) FIFO
(ii) SJF
(iii) Round Robin
(iv) Based on Priority
(i) FIFO (First In First Out) Scheduling :This algorithm is based on queuing technique Assume that a student is standing in a queue (Row) to get grade sheet from his/her teacher. The other student who stands first in the queue gets his/her grade sheet first and leaves from the queue (Row). Followed by the next student in the queue gets it corrected and so on. This is the basic logic of the FIFO algorithm.
(ii) SJF (Shortest Job First) Scheduling : This algorithm works based on the size of the job being executed by the CPU. Consider two jobs A and B.
1) A = 6 kilo bytes
2) B = 9 kilo bytes
First the job "A" will be assigned and then job "B" gets its turn.
(iii) Round Robin Scheduling : The Round Robin (RR) scheduling algorithm is designed especially for time sharing systems. Jobs (processes) are assigned and processor time in a circular method. For example take three jobs A, B, C. First the job A is assigned to CPU then job B and job C and then again A, B and C and so on.
(iv) Based On Priority :The given job (process) is assigned based on a Priority. The job which has higher priority is more important than other jobs. Take two jobs A and B. Let the priority of A be 5 and priority B be 7. Job B is assigned to the processor before job A.