What is the concern about secondary storage when working with a search tree?
What will be an ideal response?
Primary storage or primary memory is the random-access memory that the program has to use. If there is not
enough primary memory to hold all of the data for the tree, then the program will use secondary memory for some of it.
Secondary memory is typically much slower than primary memory, and using it incurs more time. Using more time impacts the
efficiency of an algorithm, so if a search tree can be designed in such a way as to minimize the use of secondary storage, it will be
more efficient.
You might also like to view...
On a traditional IBM mainframe, just before it starts a physical I/O operation, the mainframe operating system places the address of the channel program’s first instruction in the __________.
a. CCW b. PSW c. CAW d. CSW
In PowerPoint, you can create a handout in Word by using commands on the INSERT tab
Indicate whether the statement is true or false
The Restricted Groups policy, under Security Settings, Controls group membership for both domain groups and local SAM groups.
Answer the following statement true (T) or false (F)
When an individual attempts to discover as much information legally possible about their competition, what information gathering technique are they performing?
A. competitive study B. packet study C. basic information D. competitive intelligence