Due: Friday November 2nd during scheduled recitation time.
Goto jumps are often considered to be bad features of a programming
language. Why are they considered bad? Give examples. Can these statements
be useful? And if so, how? How do languages without goto type statements,
such as Java, get around such limitations.
Teshome Boschulte
Due: Friday November 2nd during scheduled recitation time.
Consider the different approaches to arithmetic overflow adopted by C
and Java. Discuss the differences in language design goals that might have
caused the designers to adopt the approached they did.
Due: Friday November 2nd during scheduled recitation time.
Loop index variables is important to calculate number of iterations. Discuss non-integer indexes and resulting round-off errors in the loops in C/C++. How it is in Fortran?
Due: Friday November 2nd during scheduled recitation time.
Most programs need conditional statements to make decisions. The IF-THEN-ELSE conditional statement is one way to make decisions. Discuss IF-THEN-ELSE conditional in Pascal, C/C++ and Java
Due: Friday November 2nd during scheduled recitation time.
Discuss the use of recursion in terms of efficiency, maintainability, writability, etc. In which cases is recursive programming good, and in which cases is it bad? Fortran does not allow recursion. What effect does this have on programming those things that are best handled by recursion (are there situations in which Fortran cannot handle a certain task because of its lack of recursion?)?
Due: Friday November 2th during scheduled recitation time.
Read over section 6.7 in the textbook (Non-determinancy). Discuss this material with the class, and expand your discussion with interesting correllated material from outside sources. Ask the instructor for advice if necessary.
Due: Friday November 2th during scheduled recitation time.
Find a BNF description of Cobol’s syntax, and discuss the Cobol grammar on English verbs.
Due: Friday November 2th during scheduled recitation time.
A tail-recursive function is a function in which additional computation never follows a recursion call. Discuss the difference between iteration, recursive and tail-recursive function by test some examples.