All the members of a record must be _______.

_______ is an ordered collection of data in which each element contains the location of the next element.

In a linked list, each element contains _______

The _______ is a pointer that identifies the next element in the linked list.

Given a linked list called children, the pointer variable children identifies ________ element of the linked list.

An empty linked list consists of _______

To traverse a list, you need a _______ pointer

In an abstract data type, _______.

A stack is a _________ structure

A(n) _______ list is also known as queue

If A is the first data element input into a stack, followed by B, C, and D, then _______ is the first element to be removed.

If A is the first data element input into a queue, followed by B, C, and D, then _______ is the first element to be removed

The pop operation _______ of the stack

The push operation _______ of the stack.

In a binary tree, each node has _______ two subtrees.

In preorder traversal of a binary tree, the ______

In _______ traversal of a binary tree, the right subtree is processed last.

In postorder traversal of a binary tree, the root is processed _______

In postorder traversal of a binary tree, the left subtree is processed _______

In _______ traversal of a binary tree, the left subtree is processed last.

In an inorder traversal of a binary tree, the root is processed _______

_______ file can be accessed randomly

_______ file can be accessed sequentially.

When a sequential file is updated, the ______ file gets the actual update.

When a sequential file is updated, the ______ file contains a list of all errors occurring during the update process.

When a sequential file is updated, the ______ file contains the changes to be applied.

After a sequential file is updated, the _______ file contains the most current data.

If the transaction file key is 20 and the first master file key is 25, then we _______.

If the transaction file key is 20 with a delete code and the master file key is 20, then we _______.

An indexed file consists of _______

The index of an indexed file has _______ fields

In the _______ hashing method, selected digits are extracted from the key and used as the address.

In the _______ hashing method, the key is divided by the file size, and the address is the remainder plus 1

In the _______ hashing method, there are no synonyms or collisions.

_______ are keys that hash to the same location in the data file.

When a hashing algorithm produces an address for an insertion key and that address is already occupied, it is called a _______.

The address produced by a hashing algorithm is the _______ address.

The _______ area is the file area that contains all the home addresses.

In the ______ collision resolution method, we try to put data that cannot be placed in location 123 into location 124.