Indexing and Hashing Quiz

Indexing and Hashing Quiz

University

10 Qs

quiz-placeholder

Similar activities

UNIT-IV 2

UNIT-IV 2

University

15 Qs

SQL Indexing - Kelas B

SQL Indexing - Kelas B

University

8 Qs

special exam in BINARY TREE

special exam in BINARY TREE

University

15 Qs

Binary Tree

Binary Tree

University

14 Qs

Trees

Trees

University

10 Qs

8.2 Arrays Cambridge IGCSE 0478

8.2 Arrays Cambridge IGCSE 0478

10th Grade - University

10 Qs

Heap and Search Tree

Heap and Search Tree

University

15 Qs

Heap

Heap

University

15 Qs

Indexing and Hashing Quiz

Indexing and Hashing Quiz

Assessment

Quiz

Computers

University

Hard

Created by

N.ILAYARAJA IT

FREE Resource

10 questions

Show all answers

1.

MULTIPLE CHOICE QUESTION

30 sec • 1 pt

What is the purpose of indexing mechanisms?

To slow down access to desired data

To increase the file size

To speed up access to desired data

To delete data efficiently

2.

MULTIPLE CHOICE QUESTION

30 sec • 1 pt

What are the two basic kinds of indices mentioned in the text?

Ordered indices and Hash indices

Dense indices and Sparse indices

Sequential indices and Random indices

Primary indices and Secondary indices

3.

MULTIPLE CHOICE QUESTION

30 sec • 1 pt

What is the primary index in a sequentially ordered file?

An index with duplicate keys

An index with no order

An index with sequential order

An index with random order

4.

MULTIPLE CHOICE QUESTION

30 sec • 1 pt

What is the advantage of B+ tree index files over indexed-sequential files?

Have a fixed height regardless of the number of search key values

Have extra insertion and deletion overhead

Automatically reorganize with small changes

Require periodic reorganization

5.

MULTIPLE CHOICE QUESTION

30 sec • 1 pt

What is the property of leaf nodes in a B+ tree?

Have a variable number of children

Pointers to file records

Contain between 3 and 5 values

Store search-key values in sorted order

6.

MULTIPLE CHOICE QUESTION

30 sec • 1 pt

What is the rule of thumb for handling deletions in B+ trees?

Always merge nodes

Always redistribute pointers

First attempt redistribution, then merge

Always split nodes

7.

MULTIPLE CHOICE QUESTION

30 sec • 1 pt

What is prefix compression used for in B+ trees?

To increase the fanout of leaf nodes

To compress key values at internal nodes

To decrease the height of the tree

To increase the number of pointers

Create a free account and access millions of resources

Create resources
Host any resource
Get auto-graded reports
or continue with
Microsoft
Apple
Others
By signing up, you agree to our Terms of Service & Privacy Policy
Already have an account?