Algorithm

 Midterm

1. Write an algorithm to sort the word E, X, A, M, P, L, E in alphabetical order.

 

2. Given the numbers 12, 4, 33, 24, 25, 6, write an algorithm that separates the numbers into two lists: the even numbers on the left, and the odd numbers on the right, all in decreasing order.

 

3. Given this program segment below with min = 2; i = 3.

A[] = {9, 4, 1, 6, 8}   

                    temp = A[min];

                   A[min] = A[i];

                   A[i] = temp;

After executing the three-line segment:

   a) Write the value for A[2]. _________________

 

  b) Write the value for A[3]. _________________

 

 

4. Given the program below,

   for (int i=0; i<4; i++)

n = 5+i;

 

a) Write the value for n when i = 3. n =_______________

 

b) What value must “ i ” be equal to for the loop to stop? i =_________

 

5. From the instruction:

printf("\n The values are %d", val[i]);

   a) What does “ \n ” represent? ___________________________________________

 

  b) What does “ %d ” represent? ___________________________________________

 

6.  Complete the instructions below by fill in the blank for parts a, b, and c, to make the program print “stop” 10 times.

            for (int pass = ?; pass>=?; pass--){

                         for (int i = 0; i<= ?; i++){

                                             printf(“ stop “);

    }

}

 

  a) pass = _____

 

  b) pass >= _____

 

  c) i<= _____