Already have an account? Get multiple benefits of using own account!
Login in your account..!
Remember me
Don't have an account? Create your account in less than a minutes,
Forgot password? how can I recover my password now!
Enter right registered email to receive password!
Explain the Fork Function
Fork function causes a new process to be created. The calling progress is duplicated as an exact copy (called the child process) that differs only in process IDs and parent IDs. This function returns the chid's process ID to the parent process and a value of 0 to the child process. After that it is possible to distinguish the two process as a result to the fork () call. The child inherits many handles, IDs, and masks from the parent process. The fork is generally used in conjunction with exec () to load or spawn new process. First the fork is initiated to create a new process context, then exec () is used to overlay the child process with a new executable image. execl(execName, arg0,....) The exec family of functions changes the state of the calling process into a new process.
Once executed, exec will replace the currently executing process with one specified by execName. Optionally parameters may be passed to the newly running process as variable-number command line arguments (arg0....) This function is usually used to either replace or overlay an existing running process or in conjunction with the fork () system call to initiate a new process. Once the fork () call is initiated to copy the process, the child process may in turn exec the new process to be executed. The original process is thus still in memory and active, and the child process has become a new executable image specified by exec Name.
what common event leads to the creation of a process?
explain how response time are reduced by allowing time sharing on top of multiprogramming
Explain internal fragmentation The Internal fragmentation signifies to the result of reserving a piece of space without ever intending to use it. This space is wasted that this
How can the deadlock be prevented Bankers algorithm : The Resource allocation graph algorithm isn't applicable to a resource allocation system with multiple instances of every
Define ‘LRU’ page replacement policy LRU is Least Recently Used page replacement policy.
What is parsing Parsing is the procedure of analyzing a text, made of a sequence of tokens, to define its grammatical structure regarding to a given formal grammar. Parsing is
How do we overcome the disadvantages of the two-level directory? Give links from one user directory to another, creating path names; system files become available by letting th
What are the main advantages of the microkernel approach to system design? Benefits typically contain the following (a) Adding a new service does not require modifying the
Define the Communications Techniques - Application interaction protocols Communications techniques are well defined. They give developer the programmatic mechanism to transf
LRU page replacement In slightest recently used page replacement algorithm we will replace that page that hasn't been used for the longest period of time. This is similar as an
Get guaranteed satisfaction & time on delivery in every assignment order you paid with us! We ensure premium quality solution document along with free turntin report!
whatsapp: +91-977-207-8620
Phone: +91-977-207-8620
Email: [email protected]
All rights reserved! Copyrights ©2019-2020 ExpertsMind IT Educational Pvt Ltd