## Question:Note that xor will change a bit (in effect, do a NOT) whereever there is a 1 in the mask.
## change the case of all letters in the string "ans"
## simplifying assumption: All characters >='A' are letters
## (no test cases will use {}[], etc)
##
## Divide "number" by 32, using shift, not div
##
## Then print "ans" followed by "number" (after dividing) and a newline
stack2.a
- Using a stack, that
has been built in the "leadin" code above the cut line. I
recommend that you "pop" the words off the stack as you go.
Get the file, design your code, and type it in before the lab
period.
## Question: ## The program must sum a sequence of numbers ## stored on the stack. The word ## on the top of the stack tells you how ## many numbers are in the sequence. ## Do not include this first word in the sum.
mipsmark stack2.a
submit cs216 stack2.a
If you have trouble with mipsmark, check the validity of your
calculations.
Then see common reasons mipsmark may
fail.