ArrayQueue: Two approaches were given for dealing with the wraparound of the attributes front and rear in ArrayQueue. Which do you think is faster? Can this be quantified? Explain.
What will be an ideal response?
The second method discussed where the modulus operator is used will be slightly faster. The other method first requires that front be incremented, then evaluates the boolean expression front == capacity, and based on the result assigns '0' to front. This takes more operations if wraparound is necessary. The second method will always evaluate a simple arithmetic expression, and then assign the result to front, resulting in fewer steps when wraparound is necessary than the first method, and no more steps if wraparound is not necessary than the first method.
You might also like to view...
A(n) ____________________ is one that is nested inside a list item of another list.
Fill in the blank(s) with the appropriate word(s).
If users experience a delay when editing complex worksheets, they can set calculations to update ________
A) automatically B) manually C) only when the file is saved D) only when the file is closing
Describe how a loop is controlled by a Boolean expression.
What will be an ideal response?
Item A in the accompanying figure is used to create a(n) _______________ in InDesign.
Fill in the blank(s) with the appropriate word(s).