CS 1713, Intro. to CS, Final Exam — Answers, Tue Dec 10 1996, Page 1 of 2
PROBLEM 1.
runner% cat final1.c /* another solution */
#include <stdio.h> #include <stdio.h>
void main(void) void main(void)
{ {
int i = 0, n; int n;
scanf("%i", &n); scanf("%i", &n);
for (i = n-1; i >= 0; i--) while (n > 0)
printf("%i ", i); printf("%i ", i);
printf("\n"); printf("\n");
} }
coyote19% cc -o final1 final1.c
coyote19% final1
5
4 3 2 1 0
runner%
PROBLEM 2.
#include <stdio.h>
void main(void)
{
int i;
double arr[200];
int zero_found;
for (i = 0; i < 100; i++)
arr[i] = (double)(i+1);
/* search for zero */
zero_found = 0;
for (i = 0; i < 100; i++) {
if (arr[i] == 0.0) zero_found = 1;
break; /* works without the break */
}
if (zero_found) printf("Zero found\n");
else printf("No zeros\n");
}
PROBLEM 3.
#include <stdio.h>
#include <ctype.h>
void main(void)
{
char ch;
int digits = 0;
while( (ch = getchar()) != EOF)
if (isdigit(ch)) digits++;
printf("Number of digits: %i\n", digits);
}
runner% cc -o final_1 final_1.c
runner% final_1 < final_1.c
Number of digits: 1
PROBLEM 4.
runner% cat final3.c
#include <stdio.h>
#define MAXFIB 40
void main(void)
{
int f[MAXFIB];
int i;
f[0] = 0; f[1] = 1;
for (i = 2; i < MAXFIB; i++)
f[i] = f[i-1] + f[i-2];
for (i = 0; i < MAXFIB; i++)
printf("Fibonacci number %2i = %8i\n",
i, f[i]);
}
runner% cc -o final3 final3.c
