- Computer Science Engineering (CSE)
- Data Structures (DS)
- The hashing file space is divided into__...

Q. |
## The hashing file space is divided into_______________. |

A. | nodes and roots. |

B. | roots and slots. |

C. | buckets and slots. |

D. | slots and nodes. |

Answer» C. buckets and slots. |

View all MCQs in:
Data Structures (DS)

- Which hash function satisfies the condition of simple uniform hashing?
- Data items that are divided into subitems are called ___________.
- New data are to be inserted into a data structure, but there is no available space; this situation is usually called__________.
- What is the space complexity for deleting a linked list?
- What is the space complexity of a linear queue having n elements?
- What is the space complexity of the post-order traversal in the recursive fashion? (d is the tree depth and n is the number of nodes)
- What is the space complexity of the in-order traversal in the recursive fashion? (d is the tree depth and n is the number of nodes)
- In _______________all the records contain the same data items with the same amount of space.
- Which of the following conditions checks available free space in avail list?
- The space factor when determining the efficiency of algorithm is measured by___________.

Login to Continue

It will take less than 2 minutes

Report MCQ