Java slips solution SEM 5 tybsc cs

 Java Slips

Click here to view the link


I will upload the slips as I solve it. 

Slip Count: 13















Comments

Post a Comment

Popular posts from this blog

Least Recently Used (LRU) page algorithm in c

Exploring MRU Page Replacement Algorithm in C TheLazyBusyCoder's Blog Welcome to my coding adventures! In this post, we'll explore a C program. Least Recently Used page algo in C Watch this video for explanation #include<stdio.h> #include<stdbool.h> bool find(int frame[] , int framesize , int cur) { int i; for(i = 0; i = 0; j--) { if(cur == arr[j]) break; } if(j
Read more

Optimal Page Replacement (OPT) in C

Exploring Optimal Page Replacement Algorithm in C TheLazyBusyCoder's Blog Welcome to my coding adventures! In this post, we'll explore a C program. Optimal Page Replacement(OPT) in C Check out YouTube video explaining theory: Watch now #include <stdio.h> int find(int frame[], int frameSize , int cur) { int i; for(i = 0; i max) { max = j; rep = i; } } return rep; } void opt(int ref[] , int framesize , int n) { int frame[framesize]; int i; for(i = 0; i
Read more

LFU Page Replacement Algorithm in C

Exploring LFU Page Replacement Algorithm in C TheLazyBusyCoder's Blog Welcome to my coding adventures! In this post, we'll explore a C program. Optimal Page Replacement(OPT) in C The page which has less frequency gets replaced #include <stdio.h> #include<stdbool.h> typedef struct Frame { int p , f , t; } Frame; void display(Frame frame[] , int framesize , bool isHit) { int i; for(i = 0; i < framesize; i++) { printf("%2d | " , frame[i].p); } if(isHit == true) printf(" HIT\n"); else printf(" *\n"); } bool find(Frame frame[] , int framesize, int cur) { int i = 0; for(i = 0; i < framesize; i++) { if(frame[i].p == cur) return true; } return false; } int replace(Frame frame[] , int framesize) { int i; for(i = 0; i < framesize; i++) if(frame[i].p == -1) return...
Read more