Assume there is a variable , h already associated with a positive integer value. write the code necessary to count the number of perfect squares whose value is less than h , starting with 1 . (a perfect square is an integer like 9 , 16 , 25 , 36 that is equal to the square of another integer (in this case 3*3 , 4*4 , 5*5 , 6*6 assign the sum you compute to a variable q for example, if h is 19 , you would assign 4 to q because there are perfect squares (starting with 1 ) that are less than h are: 1 , 4 , 9 , 16 .

pseudo code:

x=1

q=0

while x*x<h: {

x += 1}

q=x-1

complete code in C language

#include <stdio.h>

int main() {    

   int h=19;

  int q=0;

   int x=1;

  while ((x*x)<h){

 x += 1;

   }

   q=(x-1);

   printf("The sum of total perfect squares less than %d is: %d", h,q);

   return 0;

}

Explanation:

first '%d' in print statement refers to h and second '%d' in print statement refers to q

solution:

this situation is called an ip conflict.

data from a server is sent in small bits called packets. in an ip conflict, some packets will end up in one computer while some other packets will end up in another computer.

so…overall none of the computers get the data as the original message or picture being sent by the server cannot be retrieved with only half the packets. so it will show up as an error.

thus the final answer is d.

a software engineer i believe