GTU CSE

#include #include void main() { int i,os_m,nPage,total,pg[25]; clrscr(); printf("\nEnter total memory size:"); scanf("%d",&total); printf("\nEnter memory for OS:"); scanf("%d",&os_m); printf("\nEnter no. of pages:"); scanf("%d",&nPage); for(i=0;i =pg[i]) { printf("\n Allocate page %d",i+1); total=total-pg[i]; } else printf("\n page %d is not allocated due to insufficient memory.",i+1); } printf("\n External Fragmentation is:%d",total); getch(); } OUTPUT Enter total memory size:1024 Enter memory for OS:256 Enter no. of pages:4 Enter size of page[1]:128 Enter size of page[2]:512 Enter size of page[3]:64 Enter size of page[4]:512 Allocate page 1 Allocate page 2 Allocate page 3 page 4 is not allocated due to insufficient memory. External Fragmentation is:64

#include #include void main() { int allocated[15][15],max[15][15],need[15][15],avail[15],tres[15],work[15],flag[15]; int pno,rno,i,j,prc,count,t,total; count=0; clrscr(); printf("\n Enter number of process:"); scanf("%d",&pno); printf("\n Enter number of resources:"); scanf("%d",&rno); for(i=1;i OUTPUT Enter number of process:5 Enter number of resources:3 Enter total numbers of each resources:10 5 7 Enter Max resources for each process: for process 1:7 5 3 for process 2:3 2 2 for process 3:9 0 2 for process 4:2 2 2 for process 5:4 3 3 Enter allocated resources for each process: for process 1:0 1 0 for process 2:3 0 2 for process 3:3 0 2 for process 4:2 1 1 for process 5:0 0 2 available resources: 2 3 0 Allocated matrix Max need 0 1 0| 7 5 3| 7 4 3 3 0 2| 3 2 2| 0 2 0 3 0 2| 9 0 2| 6 0 0 2 1 1| ...

#include #include int fsize; int frm[15]; void display(); void main() { int pg[100],change[15],nPage,i,j,k,l,index,pf=0,temp,flag=0,flag1=0,found,max; clrscr(); printf("\n Enter frame size:"); scanf("%d",&fsize); printf("\n Enter number of pages:"); scanf("%d",&nPage); for(i=0;i OUTPUT Enter frame size:3 Enter number of pages:12 Enter page[1]:1 Enter page[2]:2 Enter page[3]:3 Enter page[4]:4 Enter page[5]:1 Enter page[6]:2 Enter page[7]:5 Enter page[8]:1 Enter page[9]:2 Enter page[10]:3 Enter page[11]:4 Enter page[12]:5 page | Frame content -------------------------------------- 1 | 1 -1 -1 2 | 1 2 -1 3 | 1 2 3 4 | 1 2 4 1 | 1 2 4 2 | 1 2 4 5 | 1 2 5 1 | 1 2 5 2 | 1 2 5 3 | 3 2 5 4 | 4 2 5 5 | 4 2 ...

#include #include int fsize; int frm[15]; void display(); void main() { int pg[100],valid[15],nPage,i,j,k,l,index,pf=0,temp,flag=0,flag1=0; clrscr(); printf("\n Enter frame size:"); scanf("%d",&fsize); printf("\n Enter number of pages:"); scanf("%d",&nPage); for(i=0;i OUTPUT Enter frame size:3 Enter number of pages:12 Enter page[1]:1 Enter page[2]:2 Enter page[3]:3 Enter page[4]:4 Enter page[5]:1 Enter page[6]:2 Enter page[7]:5 Enter page[8]:1 Enter page[9]:2 Enter page[10]:3 Enter page[11]:4 Enter page[12]:5 page | Frame content -------------------------------------- 1 | 1 -1 -1 2 | 1 2 -1 3 | 1 2 3 4 | 4 2 3 1 | 4 1 3 2 | 4 1 2 5 | 5 1 2 1 | 5 1 2 2 | 5 1 2 3 | 3 1 2 4 | 3 4 2 5 | 3 4 5 ---...

#include #include int fsize; int frm[15]; void display(); void main() { int pg[100],nPage,i,j,pf=0,top=-1,temp,flag=0; clrscr(); printf("\n Enter frame size:"); scanf("%d",&fsize); printf("\n Enter number of pages:"); scanf("%d",&nPage); for(i=0;i OUTPUT Enter frame size:3 Enter number of pages:12 Enter page[1]:1 Enter page[2]:2 Enter page[3]:3 Enter page[4]:4 Enter page[5]:1 Enter page[6]:2 Enter page[7]:5 Enter page[8]:1 Enter page[9]:2 Enter page[10]:3 Enter page[11]:4 Enter page[12]:5 page | Frame content -------------------------------------- 1 | 1 -1 -1 2 | 1 2 -1 3 | 1 2 3 4 | 4 2 3 1 | 4 1 3 2 | 4 1 2 5 | 5 1 2 1 | 5 1 2 2 | 5 1 2 3 | 5 3 2 4 | 5 3 4 5 | 5 3 4 ---------------------------...

#include #include void main() { int njob,pID[15],aTime[15],bTime[15],jTime[15],taTime[15],wTime[15],i,j,temp,sTime[15],aBtime[15]; int texe=0,qtime,aexe=0; float totalWait,totalTA; clrscr(); printf("\n Enter number of process:"); scanf("%d",&njob); printf("\n Enter quantum time:"); scanf("%d",&qtime); for(i=0;i =qtime) { aexe=aexe+qtime; bTime[i]=bTime[i]-qtime; jTime[i]=aexe; } else { if(bTime[i]!=0) { aexe=aexe+bTime[i]; bTime[i]=0; jTime[i]=aexe; } } } } for(i=0;i OUTPUT Enter number of process:3 Enter quantum time:4 Enter Burst time for process[0]:24 Enter Burst time for process[1]:3 Enter Burst time for process[2]:3 _+_+_+_+_+_+_+_+_+_+_+_+_+_+_+_+_+_+_+_+_+_+_+_+_+_+_+_+_ | process | burst time | Waiting time | TA time| _+_+_+_+_+_+_+_+_+_+_+_+_+_+_+_+_+_+_+_+_+_+_+_+_+_+_+_+_ | 0 | 24 | 6 30...

#include #include void main() { int njob,pID[15],aTime[15],bTime[15],jcTime[15],taTime[15],wTime[15],i,j,temp,sTime[15],prior[15]; float totalWait,totalTA; clrscr(); printf("\n Enter number of process:"); scanf("%d",&njob); for(i=0;i prior[j]) { temp=pID[i]; pID[i]=pID[j]; pID[j]=temp; temp=aTime[i]; aTime[i]=aTime[j]; aTime[j]=temp; temp=bTime[i]; bTime[i]=bTime[j]; bTime[j]=temp; temp=prior[i]; prior[i]=prior[j]; prior[j]=temp; } } } for(i=0;i OUTPUT Enter number of process:5 Enter the Arrival time , Burst time and Priority for process[1]:0 10 3 Enter the Arrival time , Burst time and Priority for process[2]:0 6 5 Enter the Arrival time , Burst time and Priority for process[3]:0 2 2 Enter the Arrival time , Burst time and Priority for process[4]:0 4 1 Enter the Arrival time , Burst time and Priority for process[5]:0 8 4 Process ArrivalTime BurstTime Priority Turnarou...

#include #include void main() { int njob,pID[15],aTime[15],bTime[15],jcTime[15],taTime[15],wTime[15],i,j,temp,sTime[15]; float totalWait,totalTA; clrscr(); printf("\n Enter number of process:"); scanf("%d",&njob); for(i=0;i bTime[j]) { temp=pID[i]; pID[i]=pID[j]; pID[j]=temp; temp=aTime[i]; aTime[i]=aTime[j]; aTime[j]=temp; temp=bTime[i]; bTime[i]=bTime[j]; bTime[j]=temp; } } } for(i=0;i OUTPUT Enter number of process:5 Enter the Arrival time & Burst time for process[1]:0 9 Enter the Arrival time & Burst time for process[2]:1 5 Enter the Arrival time & Burst time for process[3]:2 2 Enter the Arrival time & Burst time for process[4]:3 6 Enter the Arrival time & Burst time for process[5]:4 8 Process ArrivalTime BurstTime TurnaroundTime WaitingTime _+_+_+_+_+_+_+_+_+_+_+_+_+_+_+_+_+_+_+_+_+_+_+_+_+_+_+_+_+_+_+_+ 3 2 2 2 ...

#include #include int fsize; int frm[15]; void display(); void main() { int pg[100],nPage,i,j,pf=0,top=-1,temp,flag=0; clrscr(); printf("\n Enter frame size:"); scanf("%d",&fsize); printf("\n Enter number of pages:"); scanf("%d",&nPage); for(i=0;i OUTPUT Enter the number of processes:5 Enter the Arrival Time & Burst Time for process[1]:0 9 Enter the Arrival Time & Burst Time for process[2]:1 5 Enter the Arrival Time & Burst Time for process[3]:2 2 Enter the Arrival Time & Burst Time for process[4]:3 6 Enter the Arrival Time & Burst Time for process[5]:4 8 PId ArrivalTime BurstTime JCTime WaitingTime TAtime _+_+_+_+_+_+_+_+_+_+_+_+_+_+_+_+_+_+_+_+_+_+_+_+_+_+_+_+_+_+_+ 1 0 9 9 0 9 2 1 5 14 8 13 3 2 2 16 12 14 4 3 6 22 ...

Here you can find all the previous GTU examination papers for reference. you can download the papers.

From this page you can download syllabus of all semester. *if you find any changes in syllabus than inform me

OBJECT ORIENTED ANALYSIS DESIGN AND UML Oriented Modeling and Design wih UML second edition by michael Blaha and James Rambaugh Solution Manual of Oriented Modeling and Design wih UML second edition by michael Blaha and James Rambaugh OPERATING SYSTEM Modern Operating Systems -By Andrew S. Tanenbaum Operating System – Internals & Design Principles -By William Stallings