Computer Science 269 001 Spring 2000
Forum: Q&A, etc.
Selected email messages from students and the instructor.

-
But it's Not My Fault.
-
Question.
I can't finish my assignment because my account expired
or I ran out of print quota or the lab was closed or the system
was down or my browser couldn't show your web page or ...
-
Answer.
It is really your responsibility to allow some slack. In real life
(your future or present job, for example) machines fail all the time
without warning, but work still needs to be delivered on time.
If you run out of print quota, send me email immediately:
larmore@unlv.edu
If you ran out of print quota because you accidently printed out a 200-page
manual (this has happened) expect to get a stern lecture, but tell me
anyway.
If the system goes down for several days in a row, I might extend a
deadline.
-
How do we turn in Assignment 3?
-
Question.
When we turn in assignment 3, is email from something like hotmail
acceptable (with the files sent as attachments) or do we have to send it
through whatever email system the SGI machines use? Do you want seperate
files or do you want them globbed together?
-
Answer.
You can use "shar" to combine files.
I will post explicit instructions by Monday.
-
What about the run-time stack?
-
Question.
I had already implemented a recursive algorithm as the solution to
assignment 3 when I noticed that on your web site it said that the
program could not do that because in doing so the compiler would create
an internal stack and that would be in violation of the of the one stack
rule. However, if a program has any functions in it at all, a second
stack is used to push/pop the stack frames between calls. Wouldn' t this
also be in violation of that rule? If so, then all of our programs would
be "incorrect". What should I do about this?
-
Answer.
I realize that there is a run-time stack that is automatically created by
the compiler, but that's ok, unless it's used to get around the rule that
there be exactly one stack in the algorithm.
What I do not want is for the student to write an algorithm that needs
two or more stacks. (There is an algorithm that needs two stacks that
some students know.) The rule against recursion is to prevent the student
from subtly implementing a two-stack algorithm by making use of the
run-time stack to hold the second stack that the algorithm needs.
I will go over this in detail in class Monday if needed.
-
You Can't Return Multiple Types.
-
You Said ...
Hi Dr. Larmore,
I just wanted to let you know that return
can't be overloaded to return two different types, simply because
you can't declare a function or define it, by writing its
return types twice. I have tried and it does not work.
I wrote this letter because you told a student that it can be done.
-
Did I Say That?
I certainly did not intend to say that. If anyone heard that, I either
misspoke or they misheard.
I did say that there are many ways to handle the problem of
having a stack which holds both integers and characters, but
that I was not planning to reveal how I did it, the reason being
that I want everyone to do it differently.
-
You can Reverse the Order in HW 7.
-
Hi Dr. Larmore,
is it okay to rearange the symbols and frequency file from accending to
decending order?
Wouldn't change the concept of the assingment much
plus it would give some of the
programmers slack on how to impliment their program
-
Yes. That is perfectly acceptable.
