MCQOPTIONS
Saved Bookmarks
MCQOPTIONS
This section includes 657 Mcqs, each offering curated multiple-choice questions to sharpen your Testing Subject knowledge and support exam preparation. Choose a topic below to get started.
| 1. |
Index which has an entry for some of key value is classified as |
| A. | Linear index |
| B. | Dense index |
| C. | Non dense index |
| D. | Cluster index |
| Answer» D. Cluster index | |
| 2. |
Primary indexes, secondary indexes and cluster indexes are all types of |
| A. | Ordered indexes |
| B. | Unordered indexes |
| C. | Linear indexes |
| D. | Relative search indexes |
| Answer» B. Unordered indexes | |
| 3. |
In multilevel indexes, primary index created for its first level is classified as |
| A. | Zero level of multilevel index |
| B. | Third level of multilevel index |
| C. | Second level of multilevel index |
| D. | First level of multilevel index |
| Answer» D. First level of multilevel index | |
| 4. |
Indexes which specifies address of records on disk with a physical pointer are classified as |
| A. | Structural index |
| B. | Hashing index |
| C. | Physical index |
| D. | Logical index |
| Answer» D. Logical index | |
| 5. |
Example of non dense index is |
| A. | Ternary index |
| B. | Secondary index |
| C. | Primary index |
| D. | Clustered index |
| Answer» E. | |
| 6. |
In data file, first record of any of block is called |
| A. | Anchor record |
| B. | Dense record |
| C. | Non dense record |
| D. | None of above |
| Answer» B. Dense record | |
| 7. |
File which has secondary index for its every field is classified as |
| A. | Fully inverted file |
| B. | Fully indexed file |
| C. | Secondary indexed file |
| D. | Primary indexed file |
| Answer» B. Fully indexed file | |
| 8. |
First field in primary index having same data type as in ordering field is considered as |
| A. | Indexed key |
| B. | Ternary key |
| C. | Secondary key |
| D. | Primary key |
| Answer» E. | |
| 9. |
In multilevel indexes, primary index created for its second level is classified as |
| A. | Second level of multilevel index |
| B. | First level of multilevel index |
| C. | Zero level of multilevel index |
| D. | Third level of multilevel index |
| Answer» E. | |
| 10. |
Incase the indices values are larger, index is created for these values of index. This is called |
| A. | Pointed index |
| B. | Sequential index |
| C. | Multilevel index |
| D. | Multiple index |
| Answer» D. Multiple index | |
| 11. |
In B+ tree the node which points to another node is called |
| A. | Leaf node |
| B. | External node |
| C. | Final node |
| D. | Internal node |
| Answer» E. | |
| 12. |
While inserting the record into the index, if the search-key value does not appear in the index. |
| A. | The system adds a pointer to the new record in the index entry |
| B. | The system places the record being inserted after the other records with the same search-key values |
| C. | The system inserts an index entry with the search-key value in the index at the appropriate position |
| D. | None of the mentioned |
| Answer» D. None of the mentioned | |
| 13. |
Which of the following scenarios leads to linear running time for a random search hit in a linear-probing hash table? |
| A. | All keys hash to same index |
| B. | All keys hash to different indices |
| C. | All keys hash to an even-numbered index |
| D. | All keys hash to different even-numbered indices |
| Answer» B. All keys hash to different indices | |
| 14. |
The database design that consists of multiple tables that are linked together through matching data stored in each table is called |
| A. | Hierarchical database |
| B. | Network database |
| C. | Object oriented database |
| D. | Relational database |
| Answer» E. | |
| 15. |
The hash functions that does not maintain order of values of hash field are called |
| A. | Order preserving |
| B. | Pointer preserving |
| C. | Block preserving |
| D. | Record preserving |
| Answer» B. Pointer preserving | |
| 16. |
The kind of hashing technique in which a directory of having addresses 2d is maintained is called |
| A. | Dynamic hashing |
| B. | Extendible hashing |
| C. | Non extendible hashing |
| D. | Static hashing |
| Answer» C. Non extendible hashing | |
| 17. |
The type of organization in which the records are inserted at the end of stored file is classified as |
| A. | Pile file |
| B. | Linear search file |
| C. | Relative file |
| D. | External file |
| Answer» B. Linear search file | |
| 18. |
The kind of field with which the record searching is done is classified as |
| A. | Sorting field |
| B. | Relative field |
| C. | Linear field |
| D. | Ordering field |
| Answer» E. | |
| 19. |
The hashing process if used for disk files is classified as |
| A. | Preserving hashing |
| B. | External hashing |
| C. | Internal hashing |
| D. | Reversal hashing |
| Answer» C. Internal hashing | |
| 20. |
The fields which are used to retrieve the related records from other files are called |
| A. | Secondary fields |
| B. | Primary fields |
| C. | Key fields |
| D. | Connecting fields |
| Answer» E. | |
| 21. |
The command in DBMS software which is used to locate records that fulfills the search condition is classified as |
| A. | Find All command |
| B. | Find n |
| C. | Find Ordered command |
| D. | Reorganize command |
| Answer» B. Find n | |
| 22. |
The number of values taken by hash field are called |
| A. | Cluster field space |
| B. | Span field space |
| C. | Hash field space |
| D. | Folding field space |
| Answer» D. Folding field space | |
| 23. |
The index which has an entry for some of the key value is classified as |
| A. | Linear index |
| B. | Dense index |
| C. | Non dense index |
| D. | Cluster index |
| Answer» D. Cluster index | |
| 24. |
The primary indexes, secondary indexes and cluster indexes are all types of |
| A. | Ordered indexes |
| B. | Unordered indexes |
| C. | Linear indexes |
| D. | Relative search indexes |
| Answer» B. Unordered indexes | |
| 25. |
In multilevel indexes, the primary index created for its first level is classified as |
| A. | Zero level of multilevel index |
| B. | Third level of multilevel index |
| C. | Second level of multilevel index |
| D. | First level of multilevel index |
| Answer» D. First level of multilevel index | |
| 26. |
The indexes which specifies address of records on disk with a physical pointer are classified as |
| A. | Structural index |
| B. | Hashing index |
| C. | Physical index |
| D. | Logical index |
| Answer» D. Logical index | |
| 27. |
The example of non dense index is |
| A. | Ternary index |
| B. | Secondary index |
| C. | Primary index |
| D. | Clustering index |
| Answer» E. | |
| 28. |
In the data file, the first record of any of the block is called |
| A. | Anchor record |
| B. | Dense record |
| C. | Non dense record |
| D. | None of above |
| Answer» B. Dense record | |
| 29. |
The files used for speedy disk search by providing the specialized structures of data are classified as |
| A. | Indexes |
| B. | Glossaries |
| C. | Content specification |
| D. | Listing documents |
| Answer» B. Glossaries | |
| 30. |
In database management system, the types of data structures used in indexes are |
| A. | Hash data structures |
| B. | Tree data structures |
| C. | Content and glossary structures |
| D. | Both a and b |
| Answer» E. | |
| 31. |
In linear hashing, the formula of file load factor is |
| A. | L = r / (bfr * N) |
| B. | L = r / (bfr + N) |
| C. | L = r / (bfr - N) |
| D. | L = r / (bfr * 2N) |
| Answer» B. L = r / (bfr + N) | |
| 32. |
The kind of allocation in which the file blocks contain the pointer to the next blocks of file is classified as |
| A. | Linked allocation |
| B. | Indexed allocation |
| C. | Header allocation |
| D. | Contiguous allocation |
| Answer» B. Indexed allocation | |
| 33. |
The hashing technique which allocates fixed number of buckets is classified as |
| A. | Dynamic hashing |
| B. | Static hashing |
| C. | External hashing |
| D. | Internal hashing |
| Answer» D. Internal hashing | |
| 34. |
In linear hashing, the formula used to calculate number of records if the blocking factor, loading factor and file buckets are known is as |
| A. | R =l + bfr + N |
| B. | R =l - bfr - N |
| C. | R =l + bfr - N |
| D. | R =l * bfr * N |
| Answer» E. | |
| 35. |
The hashing technique which allows increase or decrease in number of buckets without a need of directory is classified as |
| A. | Global depth hashing |
| B. | Linear hashing |
| C. | Relative hashing |
| D. | Local depth hashing |
| Answer» C. Relative hashing | |
| 36. |
The type of data organization which does not allow cross block boundaries is called |
| A. | Unspanned organization |
| B. | Spanned organization |
| C. | Factor organization |
| D. | Indexed organization |
| Answer» B. Spanned organization | |
| 37. |
If the global depth is more than local depth then the operation must be performed in directory array is |
| A. | Adding |
| B. | Subtracting |
| C. | Halving |
| D. | Doubling |
| Answer» D. Doubling | |
| 38. |
In extendible hashing array of bucket addresses 2d then d is considered as |
| A. | Global depth |
| B. | Global width |
| C. | Global length |
| D. | Global multiplier |
| Answer» B. Global width | |
| 39. |
The open addressing, multiple hashing and chaining are all the methods used for |
| A. | Multiple hashing resolution |
| B. | Chaining resolution |
| C. | Collision resolution |
| D. | Address space resolution |
| Answer» D. Address space resolution | |
| 40. |
The record searching technique which is based on the blocks rather than records is called |
| A. | Tertiary search |
| B. | Binary search |
| C. | Ordinary search |
| D. | Ternary search |
| Answer» C. Ordinary search | |
| 41. |
The additional access path added into ordered file is called |
| A. | Ternary index |
| B. | Tertiary index |
| C. | Primary index |
| D. | Secondary index |
| Answer» D. Secondary index | |
| 42. |
The first field in the primary index having same data type as in the ordering field is considered as |
| A. | Indexed key |
| B. | Ternary key |
| C. | Secondary key |
| D. | Primary key |
| Answer» E. | |
| 43. |
In multilevel indexes, the primary index created for its second level is classified as |
| A. | Second level of multilevel index |
| B. | First level of multilevel index |
| C. | Zero level of multilevel index |
| D. | Third level of multilevel index |
| Answer» E. | |
| 44. |
The kind of index which is based on any candidate key or a non key field which may have duplicate values is classified as |
| A. | Ternary index |
| B. | Secondary index |
| C. | Primary index |
| D. | Clustering index |
| Answer» C. Primary index | |
| 45. |
In multilevel indexes, the blocking factor is also called |
| A. | Fan out of multilevel index |
| B. | Fan in of multilevel index |
| C. | Distinct value of multilevel index |
| D. | Ordered field of multilevel index |
| Answer» B. Fan in of multilevel index | |
| 46. |
The index which has an entry for every key value is classified as |
| A. | Linear index |
| B. | Dense index |
| C. | Sparse index |
| D. | Cluster index |
| Answer» C. Sparse index | |
| 47. |
The special node in the tree structure which has many child nodes and one parent node is called |
| A. | Descendant nodes |
| B. | Root node |
| C. | Leaf node |
| D. | Search node |
| Answer» C. Leaf node | |
| 48. |
The tree structure diagram in which the pointers of data are stored at the leaf nodes of diagram is classified as |
| A. | B tree |
| B. | B+ tree |
| C. | B2 tree |
| D. | B* tree |
| Answer» C. B2 tree | |
| 49. |
The type of multilevel index which leaves space for inserting new entries in its blocks is called |
| A. | Dynamic multilevel index |
| B. | Static multilevel index |
| C. | Non dense multilevel index |
| D. | Dense multilevel index |
| Answer» B. Static multilevel index | |
| 50. |
In tree structure, the node which is free of child nodes is called |
| A. | Descendant nodes |
| B. | Root node |
| C. | Leaf node |
| D. | Search node |
| Answer» D. Search node | |