In an array-based implementation of a queue, what purpose is served by treating the array as circular? Is it required in order to have an array-based implementation of a queue?
What will be an ideal response?
Treating an array as a circular data structure allows re-use of the array elements that have been emptied by
dequeue operations. It provides more efficient use of memory.
An array-based implementation of a queue that is not circular is possible. The code to implement the enqueue and dequeue
operations can be simpler than in a circular implementation, but memory use is less efficient because it is not re-used.
You might also like to view...
Suppose we wish to use a constructor of a Foo class (not a class template) that passes in one integer parameter. We wish to make an object called f and pass 5 into this constructor. The code for doing so would look like this:
A. f.Foo( 5 ); B. Foo( 5 ) f; C. Foo f( 5 ); D. f( Foo( 5 ) );
The main page for Facebook members is the ________ page
Fill in the blank(s) with correct word
Case-Based Critical Thinking QuestionsCase 2-1Abby has selected fonts in the past for her Web sites without knowing much about them, so she has resolved to learning more about them so that she can make even more informed choices in the future. If Abby wants to present a series of sans serif fonts, she can use all of the following EXCEPT ____.
A. Verdana B. Geneva C. Tahoma D. New York
When a chart is pasted into a PowerPoint slide and the data that created the chart needs to be edited, the data ________
A) cannot be edited B) is treated like a table and edited in Word C) is edited in PowerPoint D) is edited in Excel