MVT(Multi[programming with Variable no of Tasks)

#include<stdio.h> 
#include<conio.h> 
void main() 
{ 
int m=0,m1=0,m2=0,p,count=0,i; 
clrscr(); 
printf("Enter the memory capacity:");
scanf("%d",&m);
printf("Enter the no of processes:"); 
scanf("%d",&p);
for(i=0;i<p;i++) 
{ 
printf("\nEnter memory req for process%d: ",i+1); 
scanf("%d",&m1);
count=count+m1; 
if(m1<=m) 
{ 
if(count==m) 
{ 
printf("There is no further memory remaining:"); 
} 
else 
{ 
printf("The memory allocated for process%d is: %d ",i+1,m); 
m2=m-m1; 
printf("\nRemaining memory is: %d",m2); 
m=m2;
} 
} 
else 
{ 
printf("Memory is not allocated for process%d",i+1); 
} 
printf("\nExternal fragmentation for this process is:%d",m2); 
} 
getch(); 
}

Comments

Post a Comment

Popular posts from this blog

Tree pruning useful in decision tree induction

Why is tree pruning useful in decision tree induction? What is a drawback of using a separate set of tuples to evaluate pruning? The decision tree built may overfit the training data. There could be too many branches, some of which may reflect anomalies in the training data due to noise or outliers. Tree pruning addresses this issue of overfitting the data by removing the least reliable branches (using statistical measures). This generally results in a more compact and reliable decision tree that is faster and more accurate in its classification of data. The drawback of using a separate set of tuples to evaluate pruning is that it may not be representative of the training tuples used to create the original decision tree. If the separate set of tuples are skewed, then using them to evaluate the pruned tree would not be a good indicator of the pruned tree’s classification accuracy. Furthermore, using a separate set of tuples to evaluate pruning means there are less tuples to use for ...
Read more

Machine Learning Syllabus

MACHINE LEARNING UNIT -I: The ingredients of machine learning, Tasks: the problems that can be solved with machine learning, Models: the output of machine learning, Features, the workhorses of machine learning. Binary classification and related tasks: Classification, Scoring and ranking, Class probability estimation UNIT-II: Beyond binary classification:  Handling more than two classes, Regression, Unsupervised and descriptive learning. Concept learning : The hypothesis space, Paths through the hypothesis space, Beyond conjunctive concepts UNIT- III: Tree models: Decision trees, Ranking and probability estimation trees, Tree learning as variance reduction. Rule models: Learning ordered rule lists, Learning unordered rule sets, Descriptive rule learning, First-order rule learning UNIT-IV: Linear models: The least-squares method, The perceptron: a heuristic learning algorithm for linear classifiers, Support vector machines, obtaining probabilities from linear cla...
Read more