Job Saarnee

JOB SAARNEE

Top Most Platform for Job Updates O Level Results Answer keys AKTU MCQs

Algorithm and Implementation of Banker algorithm to avoid dead lock or finding safe sequence

 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 […]

Algorithm and Implementation of Banker algorithm to avoid dead lock or finding safe sequence Read More »

Design a Learning System in Machine Learning

 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

Design a Learning System in Machine Learning Read More »

DSSSB TGT, Assistant Teacher, Patwari, LDC Online Application Form 2021

 DSSSB TGT, Assistant Teacher, Patwari, LDC Online Application Form 2021 This is to inform all members of “JOB SAARNEE” that DSSSB Delhi Subordinate Service has Released an Online Application for various Post like TGT, Assistant teacher, Patwari, LDC, Clerk Notification 2021. Those candidates interested in working with DSSSB and completed all Eligibility Criteria can visit the Link for complete notification

DSSSB TGT, Assistant Teacher, Patwari, LDC Online Application Form 2021 Read More »

Algorithm and Implementation of contiguous allocation techniques: Worst- Fit using c

 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

 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 using c

 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 »

Unit 2 Web Page designing | Long answer Question with answer | Web Technology | AKTU Previous Year

 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

Unit 2 Web Page designing | Long answer Question with answer | Web Technology | AKTU Previous Year Read More »

You cannot copy content of this page