Draw four gantt charts illustrating the execution of these processes using FCFS, SJF, a non-preemptive priority (a smaller priority number implies a higher priority), and RR(quantum = 1) scheduling.
What is the turn around time of each process for each of the scheduling algorithms in part (a)?
What is the waiting time of each process for each of the scheduling algorithms in part (a)?
Explain the evaluation of each algorithm.

comming soon
3 Discuss the similarities and differences between the basic strategies for non-contiguous allocation of disk space.
comming soon.



4 Discuss in detail the features, security and protection mechanism in Linux Operating System.

Linux secure protection systems details are given below:

Least privilege . Each user and program should operate using the fewest privileges possible. This principle limits the damage from an accident, error, or attack. It also reduces the number of potential interactions among privileged programs, so unintentional, unwanted, or improper uses of privilege are less likely to occur. This idea can be extended to the internals of a program: only the smallest portion of the program which needs those privileges should have them.
Economy of mechanism/Simplicity . The protection system's design should be simple and small as possible. In their words, ``techniques such as line-by-line inspection of software and physical examination of hardware that implements protection mechanisms are necessary. For such techniques to be successful, a small and simple design is essential.'' This is sometimes described as the ``KISS'' principle (``keep it simple, stupid'').
Open design . The protection mechanism must not depend on attacker ignorance. Instead, the mechanism should be public, depending on the secrecy of relatively few (and easily changeable) items like passwords or private keys. An open design makes extensive public scrutiny possible, and it also makes it possible for users to convince themselves that the system about to be used is adequate. Frankly, it isn't realistic to try to maintain secrecy for a system that is widely distributed; decompilers and subverted hardware can quickly expose any ``secrets'' in an implementation. Bruce Schneier argues that smart engineers should ``demand open source code for anything related to security'', as well as ensuring that it receives widespread review and that any identified problems are fixed [Schneier 1999].
Complete mediation . Every access attempt must be checked; position the mechanism so it cannot be subverted. For example, in a client-server model, generally the server must do all access checking because users can build or modify their own clients.
Fail-safe defaults (e.g., permission-based approach) . The default should be denial of service, and the protection scheme should then identify conditions under which access is permitted.
Separation of privilege . Ideally, access to objects should depend on more than one condition, so that defeating one protection system won't enable complete access.
Least common mechanism . Minimize the amount and use of shared mechanisms (e.g. use of the /tmp or /var/tmp directories). Shared objects provide potentially dangerous channels for information flow and unintended interactions.
Psychological acceptability / Easy to use . The human interface must be designed for ease of use so users will routinely and automatically use the protection mechanisms correctly. Mistakes will be reduced if the security mechanisms closely match the user's mental image of his or her protection goals.