The purpose of this homework is to give you a chance to focus your knowledge of ABOC Chapter 4 (and similar parts of Chapter 1).
Do problems 4.1-3, 6-11, 12 (but it will never be infinite on any system), 14, 15, 18 (use the first version from 17), 20, 21, 22 (they intend 3 programs), 29, and 30.
(I know it seems like a lot of problems, but they are rather small.)
To hand this in, make sure you script your tests. But avoid scripting a vi session. (You may want to try this to see why I say not to, but make it a short session.) You can avoid this by simply having multiple terminal windows open: script in one and vi in another.
This assignment is (Level 2.5).
Add (Level 0.5) to do problem 4.4. You can use to___er() from ctype.h to help.
Add (Level 1) to do problem 4.5.
Add (Level 1.5) to do problem 4.16.
Add (Level 2) to do problems 4.23 and 4.24 together in a single program. You must show all roots for the input formula. Complex roots should be in the form a+bi where a and b are the real and imaginary parts, respectively. For example: x2+2x+1 has roots: -1+1.414i, -1-1.414i. (You can make it prettier if you like: -1 + 1.414 i, -1 - 1.414 i. *shrug*)
Add (Level 2) to do problems 4.26 and 4.27 together in a single program (of course).
Add (Level 1) to do problem 4.28. Also use the ctype.h is___() functions to your advantage -- even rewriting the parts of code given to some extent.
Add (Level 1) to do problem 1.12. Allow the user to enter both the minimum and maximum number for the integers. Make sure your columns line up neatly. If a result overflows your data type or cannot fit in the column you've decided upon, fill the column full of '*'s.
Add (Level 0.5) to do problem 1.13. Also try adding ; after the close brace.