What are the four categories of linear implementations of tables?
What will be an ideal response?
The four categories are:
• unsorted, array based
• unsorted, reference based
• sorted (by search key), array based
• sorted (by search key), reference based
Computer Science & Information Technology
You might also like to view...
The _________ allows multiple threads to have simultaneous read-only access to an object protected by the lock.
A) ?barrier ? B) ?condition variable C) ?readers/writer lock ? D) ?mutex
Computer Science & Information Technology
Why is the efficiency of algorithms desirable?
A. an inefficient algorithm may use too much time or space B. efficient algorithms always cost less money C. inefficient algorithms always use too much memory D. efficient algorithms always use less memory
Computer Science & Information Technology