__________involves maintaining two tables in memory.

Related MCQs

• A graph is said to be ……………… if the vertices can be split into two sets V1 and V2 such there are no edges between two vertices of V1 or two vertices of V2.
• In Circular Linked List insertion of a node involves the modification of ____ links.
• For the heap sort, access to nodes involves simple _______________ operations.
• The elements of an array are stored successively in memory cells because
• Linked list is generally considered as an example of _________ type of memory allocation.
• How do you calculate the pointer difference in a memory efficient double linked list?
• The process of accessing data stored in a serial access memory is similar to manipulating data on a
• Which of the following is the most widely used external memory data structure?
• The memory address of the first element of an array is called_________.
• A _______________ is a reference to a memory location, which is used to store data that is described in a data type.