king is about to launch


Ready to launch the king




Comments

Post a Comment

Popular posts from this blog

PROGRAM TO IMPLEMENT SSTF DISK SCHEDULING ALGORITHM IN C

Image
/*    SSTF Disk Scheduling Algorithm    Created By: shobabu */ #include<stdio.h> #include<conio.h> #include<math.h> void main() { int queue[100],t[100],head,seek=0,n,i,j,temp; float avg; // clrscr(); printf("*** SSTF Disk Scheduling Algorithm ***\n"); printf("Enter the size of Queue\t"); scanf("%d",&n); printf("Enter the Queue\t"); for(i=0;i<n;i++) {     scanf("%d",&queue[i]); } printf("Enter the initial head position\t"); scanf("%d",&head);   for(i=1;i<n;i++)   t[i]=abs(head-queue[i]); for(i=0;i<n;i++)   {     for(j=i+1;j<n;j++)     {       if(t[i]>t[j])       {         temp=t[i];         t[i]=t[j];         t[j]=temp;         temp=queue[i];         queue[i]=queue[j];         queue[j]=tem...
Read more

Diffie Hellman java code

import java.util.*;   class Diffie_Hellman { public static void main( String args[]) { Scanner sc= new Scanner(System. in ); System.out.println( "Enter modulo(p)" ); int p=sc.nextInt(); System.out.println( "Enter primitive root of " +p); int g=sc.nextInt(); System.out.println( "Choose 1st secret no(Alice)" ); int a=sc.nextInt(); System.out.println( "Choose 2nd secret no(BOB)" ); int b=sc.nextInt(); int A = ( int )Math.pow(g,a)%p; int B = ( int )Math.pow(g,b)%p; int S_A = ( int )Math.pow(B,a)%p; int S_B =( int )Math.pow(A,b)%p; if (S_A==S_B) { System.out.println( "ALice and Bob can communicate with each other!!!" ); System.out.println( "They share a secret no = " +S_A); } else { System.out.println( "ALice and Bob cannot communicate with each other!!!" ); } } }
Read more

PROGRAM TO IMPLEMENT FIFO DISK SCHEDULING ALGORITHM IN C

Image
/*     FCFS Disk Scheduling Algorithm    Created by: shobabu */ #include<stdio.h> #include<conio.h> void main() { int queue[100],n,head,i,j,k,seek=0,diff; float avg; // clrscr();   printf("*** FCFS Disk Scheduling Algorithm ***\n"); printf("Enter the size of Queue\t"); scanf("%d",&n); printf("Enter the Queue\t"); for(i=1;i<=n;i++)   {     scanf("%d",&queue[i]);   }   printf("Enter the initial head position\t"); scanf("%d",&head); queue[0]=head; printf("\n"); for(j=0;j<=n-1;j++) {     diff=abs(queue[j+1]-queue[j]);     seek+=diff;     printf("Move from %d to %d with Seek %d\n",queue[j],queue[j+1],diff);   } printf("\nTotal Seek Time is %d\t",seek);   avg=seek/(float)n; printf("\nAverage Seek Time is %f\t",avg);   getch(); }
Read more