1 [14 points]

a) Machine Language


b) 
   i   x && (a > b)
   ii  (i <= j) && (a >= b)
   iii (((a >= b) && !( b >= c)) && ( b >= d))


c) printf("*%9.5f*\n", f);



2) [10 points] 

##48470#5.8599 #0003##
##6 3 8976 3.14159##

##2.718282#8#29.718##



3) [24 points] 

a)

  if(c == 1)
    printf("1\n");
  else if (c == 2)
    printf("2\n3\n4\n");
  else if (c == 3)
    printf("3\n4\n");
  else  if (c == 4)
    printf("4\n");
  else
    printf("Default\n");

(or anything equivalent)


  switch(x)
    {
    case 16: printf("1\n");
      break;
    case 12:
      switch(y)
	{
	case 12:
	  printf("same\n");
	  break;
	default: printf("different\n");
	}
    case 1:
    case 2: printf("3\n");
    }
     

(or anything equivalent)


4) [15 points] 

a)

1 5 10 
2 6 11 
3 7 13 
infinite

b) 

7 3 7

c)

0 2 2
1 1 2
2 0 4

d) 

2 1 4 3
3 0 5 2


5)  [12 points] 

a) 6

b) 6

c) 1

d) 5

6) [25 points]

#include<stdio.h>

main()
{
  int num, currprime, primecount, factor, flag;

  scanf("%d", &num);

  for(primecount = 0, currprime = 2; primecount < num; currprime ++)
    {
      for(factor = 2, flag = 1; factor < currprime && flag; factor++)
	if (!(currprime % factor))
	  flag = 0;  
      if (flag)
	{
	  printf("%d\n", currprime);
	  primecount++;
	}
    }
  return 0;
}

Another version:

#include <stdio.h>

main ()
{

   int num, prime, n = 1, factor, nprimes = 0;

   scanf ("%d", &num);

   while (nprimes < num)
   {
      prime = 1;
      n++;
      factor = 2;
      while (prime && factor < n)
      {
         if (n % factor == 0)
            prime = 0;
         factor++;
      }
      if (prime)
      {
         printf ("%d ", n);
         nprimes++;
      }
   }   
   printf ("\n");

   return 0;
}