Tricks and Solutions

 In this post I will explain how to get the output of page replacement algorithms. The page replacement algorithms in this code(c language) are 1.FIFO 2.Optimal 3.LRU 4.LFU   Source Code   Steps 1.Click the Source Code link and copy the code in that link. 2.Paste the code in Online Compiler 3. After executing you will be asked to ENTER YOUR CHOICE. You have to give 1 as your choice.  4. After entering 1 you will be asked ENTER LENGTH OF PAGE REFERENCE SEQUENCE. You have to enter how many page references are there in your problem. 5. After giving the length, You have to give the page reference sequence 6.After giving page reference sequence, You have to give number of frames 7. After giving no.of frames. You have to select which page replacement algorithm you want to execute. 8. You will get the output for your selected page replacement algorithm Online Compiler (Link for online compiler)

 In this post I will present you a best VPN extension for chrome TouchVPN TouchVPN is one of the most deserving Chrome VPN extensions out there.  It’s completely free to use, and offers an easy way to manage your VPN connection . As soon as you install the extension, you would find the TouchVPN icon near other extensions. You don’t have to create an account for using TouchVPN, though. The set-up process is super-easy that way. TouchVPN features 1. VPN 2. AD blocker 3. Cookie blocker 4. Malware blocker 5. Tracker blocker Click the below link you will be redirected to TouchVPN extension and click add to chrome. Link After installing the extension, select any one of the location and click connect.

 In this post, I will explain how to get the waiting time and turn around time in SJF-PRE-EMPTIVE scheduling in C language. To get the desired output you need to follow three steps I have given. After following the three steps you will get the output Step-1 C Program:- #include <stdio.h> int main()  {       int arrival_time[10], burst_time[10], temp[10];       int i, smallest, count = 0, time, limit;       double wait_time = 0, turnaround_time = 0, end;       float average_waiting_time, average_turnaround_time;       printf("Enter the Total Number of Processes:\t");       scanf("%d", &limit);        printf("\nEnter Details of %d Processes\n", limit);       for(i = 0; i < limit; i++)       {             printf("\nEnter Arrival Time:\t");             scanf("%d", &ar...

 To solve the Modulo value of such expression, I will use java code to find the solution. I will explain the steps required to solve the value using the java code. The steps are as follows. Step1:- Copy the below code import java.util.*; import java.math.BigInteger; public class Main{ public static void main(String args[]) {         Scanner sc=new Scanner(System.in);         BigInteger a,b,n,O;         System.out.println("Enter value of a");         a=sc.nextBigInteger();         System.out.println("Enter value of b");         b=sc.nextBigInteger();         System.out.println("Enter value of n");         n=sc.nextBigInteger();          O=a.modPow(b,n);         System.out.println("Answer is");         System.out.println(O);       } } Step2:- After...