CSCI 1312 (Introduction to Programming for Engineering), Fall 2017:
Homework 4

Credit:
50 points.

Reading

Be sure you have read (or at least skimmed) the assigned readings from chapter 4, and section 9 (about recursion) from chapter 6.

Honor Code Statement

Please include with each part of the assignment the Honor Code pledge or just the word ``pledged'', plus one or more of the following about collaboration and help (as many as apply).1Text in italics is explanatory or something for you to fill in. For written assignments, it should go right after your name and the assignment number; for programming assignments, it should go in comments at the start of your program(s).

Programming Problems

Do the following programming problems. You will end up with at least one code file per problem. Submit your program source (and any other needed files) by sending mail to bmassing@cs.trinity.edu with each file as an attachment. Please use a subject line that mentions the course and the assignment (e.g., ``csci 1312 hw 4'' or ``CS1 hw 4''). You can develop your programs on any system that provides the needed functionality, but I will test them on one of the department's Linux machines, so you should probably make sure they work in that environment before turning them in.

  1. (15 points) Write a C program that defines and tests a function for converting Fahrenheit temperatures to Celsius. (You should be able to reuse your code from Homework 2, perhaps with some slight modifications.) Your program must include three functions:

  2. (15 points) Write a C program that asks the user for two non-negative integers, call them $ a$ and $ b$ , not both zero, and computes and prints $ \gcd(a,b)$ , the greatest common divisor of $ a$ and $ b$ , using a recursive version of Euclid's algorithm. Print an error message if what was entered is not two integers, or either input is negative, or both are zero.

    Euclid's algorithm can be described recursively thus: For non-negative integers $ a$ and $ b$ , not both zero, with $ a \ge b$ ,

    $\displaystyle \gcd(a, b) = \begin{cases}a & \text{if } b = 0 \\ \gcd(b, a\bmod b) & \text{otherwise} \end{cases}$    

    where $ a\bmod b$ is the remainder when $ a$ is divided by $ b$ . (You don't actually have to understand this algorithm to turn it into code, but if you want to and don't, a Web search will likely turn up some good explanations of how/why it works.)

    NOTE that the point of this problem is for you to practice defining and using a recursive function, so you will not get full credit unless you do. I recommend putting all the error checking in the main program and having a recursive function declared as

    int gcd(int a, int b);

  3. (20 points) Write a C program that uses a recursive function to ``count'' up or down, specifying a starting value start, an ending value end, and an increment incr. The program should prompt for the three values and (of course?) just print an error message if what is entered is anything but integers, or if incr is 0 (think about why). The function should then count starting at start, incrementing by incr, and stopping when the next value would go beyond end. Examples: NOTE that the point of this problem is for you to practice defining and using a recursive function, so you will not get full credit unless you do. I recommend putting all the error checking in the main program and having a recursive function declared as
    void count(int start, int end, int incr);



Footnotes

... apply).1
Credit where credit is due: I based the wording of this list on a posting to a SIGCSE mailing list. SIGCSE is the ACM's Special Interest Group on CS Education.


Berna Massingill
2017-11-05