What is wrong with implementing a queue by using an array, where index 0 represents the front of the queue?
What will be an ideal response?
If a queue is implemented with an array with the front of the queue at index 0, every time an element is
removed from the queue, all of the remaining elements have to be shifted down one space. This is an inefficient
implementation.
You might also like to view...
To handle an exception, a program must "wrap" the potential exception-throwing statement(s) in a statement called a(n) ____ block.
A. exception B. try-catch C. throw D. test
Replacement selection is
a. arranging the initial runs on the tape in an optimal way b. constructing the runs so they have expected length 2M c. using K way merging instead of 2 way merging d. using K + 1 tapes instead of K tapes e. none of the above
What is signature analysis?
What will be an ideal response?
Case-Based Critical Thinking QuestionsCase 7-2Your roommate knows that you have a lot of expertise with video, so she asks you for a quick primer. If she is looking for a very popular cross-platform solution that will work both on the Web and on a DVD she expects to develop, which format do you suggest she use?
A. Windows Format B. AVI C. QuickTime D. RealNetworks