Algorithm and Implementation of Banker algorithm to avoid dead lock or finding safe sequence Banker algorithm is responsible for find the safe sequence so that we can able avoid Deadlock. IN order to implement this we are going to make use c programming language. lets first discuss about algorithm to find the safe sequence here …
Q1. Consider a system P1, P2, P3 the peak demand of each process for the resource R is 12, 10,16, Respectively then What is the minimum number of required to ensure dead lock free operation? Q2. Consider the system where 34 binary bit is used to refer the word in the memory and each word …
Design a Learning System in Machine Learning Designing a Learning system is a Five Step Process Included Choosing Training Experience Choosing Training Function Choosing the Representation for Target Function Choosing Function Approximation Algorithm Final Design Step 1: Choosing Training Experience Choosing Training Experience plays an important role in success and failure learning of learner or …
Algorithm and Implementation of contiguous allocation techniques: Worst- Fit using c In order to implement Best fit contiguous allocation techniques there is certain requirement first we need Block size, Number of Block that is m, Number of Process is n, Size of each and every process Let Blocksize is the array of size m. Let …
Algorithm and Implementation of contiguous allocation techniques: Worst- Fit using c Read More »
Algorithm and Implementation of contiguous allocation techniques: Best- Fit using c Let Blocksize is the array of size m. Let SizeofProcess is the array of size n. Let AllocationStatus is an array of size n. it is the function we are going to use Best_fitCAT(int Blocksize[ ],int SizeofProcess[ ],AllocationStatus[ ]) 1- Initilze the Blocksize …
Algorithm and Implementation of contiguous allocation techniques: Best- Fit using c Read More »
Algorithm and Implementation of contiguous allocation techniques: First- Fit In order to implement First fit contiguous allocation techniques there is certain requirement first we need Block size, Number of Block that is m, Number of Process is n, Size of each and every process Let Blocksize is the array of size m. Let SizeofProcess is …
Algorithm and Implementation of contiguous allocation techniques: First- Fit using c Read More »
Dead Prevention In this blog we are going to talk about how to prevent dead lock, preventing dead lock is one of the most important concern of operating system in this blog, I am going to cover what are the necessary condition to lead deadlock and what are various way to prevent these condition to happen …
Dead lock in Operating System A dead lock is situation in which two or more process waiting on same event to happen which is never going to be happen then we say those processes are in dead lock. Dead lock in Operating System In order to analyze Dead lock in any system we make use of …
 Unit 2 Web Page designing | Long answer Question with answer | Web Technology | AKTU Previous Year Q1 Explain the HTML tags: Table Frame and forms with the help of suitable example? Q2 What is CSS? What are different ways of creating style sheet? Q3 What is XML? Discuss the significance of XML? How …
 Introduction to Web Technology | Long answer Question with answer | Web Technology | AKTU Previous Year Q1 What is internet? Discuss the various internet services in brief? Q2 what do you mean by web project? Describe the various protocol governing web projects? Q3 What is the difference between JDK, JRE, JIT and JVM? Q4 …
