Technical Questions

Wide-mouth frog is the simplest known key distribution center (KDC) authentication protocol

Yes, it can be used, if an accurate clock frequency  is not required. also the component cost is low compared to LC or Crystal.

11

Because, on preprocessing the expression becomes  a = ( 3 + 2 * 2 + 3),  as Ist preference is multiply & then addition, it evalvates as(3+ 2 * 3 +2) = (3+6+2)=11.

#include <stdio.h>

int main() {

  int a[5][5], b[5][5], c[5][5], i, j, k, sum = 0, m, n, o, p;

  printf( "\nEnter the row and column of first matrix" );

  scanf( "%d %d", &m, &n );

  printf( "\nEnter the row and column of second matrix" );

  scanf( "%d %d", &o, &p );

  if(n!=o) {

      printf( "Matrix mutiplication is not possible" );

      printf( "\nColumn of first matrix must be same as row of second matrix" );

  }

  else {

      printf( "\nEnter the First matrix" );

      for( i=0; i<m; i++ )

      for( j=0; j<n; j++ )

           scanf( "%d", &a[i][j] );

      printf( "\nEnter the Second matrix" );

      for( i=0; i<o; i++ )

      for( j=0; j<p; j++ )

           scanf( "%d", &b[i][j] );

      printf( "\nThe First matrix is\n" );

      for( i=0; i<m; i++ ) {

      printf("\n");

      for( j=0; j<n; j++ ) {

           printf( "%d\t", a[i][j] );

      }

      }

      printf( "\nThe Second matrix is\n" );

      for( i=0; i<o; i++ ) {

      printf("\n");

      for( j=0; j<p; j++ ) {

           printf( "%d\t", b[i][j] );

      }       

      }

      for( i=0; i<m; i++ )

      for( j=0; j<p;j++ )

           c[i][j] = 0;

      for( i=0; i<m; i++ ) { //row of first matrix

      for( j=0; j<p; j++ )  {  //column of second matrix

           sum = 0;

           for( k=0; k<n; k++ )

               sum = sum + a[i][k]*b[k][j];

           c[i][j] = sum;

      }

      }

  }

  printf( "\nThe multiplication of two matrix is\n" );

  for( i=0; i<m; i++ ) {

      printf("\n");

      for( j=0; j<p; j++ ) {

           printf( "%d\t", c[i][j] );

      }

  }

  return 0;

}

Scheduling is the activity of the deciding when process will receive the resources they request.

FCS ---> FCSFS stands for First Come First Served. In FCFS the job that has been waiting the longest is served next.

Round Robin Scheduling--->Round Robin scheduling is a scheduling method where each process gets a small quantity of time to run and then it is preempted and the next process gets to run. This is called time-sharing and gives the effect of all the processes running at the same time

Shortest Job First ---> The Shortest job First scheduling algorithm is a nonpreemptive scheduling algorithm that chooses the job that will execute the shortest amount of time.

Priority Scheduling--->Priority scheduling is a scheduling method where at all times the highest priority process is assigned the resource.

Glass Box (or white box) testing is the process of giving i/p to the system and checking how the system processes i/p to generate o/p

Black Box testing is the process of giving i/p to the system and checking if the system is giving correct o/p without bothering how the o/p is generated.

As we can see from the definitions, the role of black box testing is to ensure that the o/p generated is correct. And role of white box testing is to ensure that methods used to generate the o/p are correct.

It is any routing protocol used within an autonomous system.