1A dense index has:AEntries only for NULLsBNo entriesCEntries for only some valuesDAn index entry for every search-key valueView AnswerDiscussWorkspaceReportSaveEasy
2In a B+ tree of order n, each internal node (except the root) has at least:A1 childB2n childrenCn childrenD⌈n/2⌉ childrenView AnswerDiscussWorkspaceReportSaveMedium
3What is the typical height of a B+ tree indexing millions of rows?A3 to 4 levelsBMillions of levelsCHundreds of levelsD1 level alwaysView AnswerDiscussWorkspaceReportSaveEasy
4What is the main purpose of an index?ATo enforce foreign keys onlyBTo speed up data retrievalCTo store backupsDTo compress tablesView AnswerDiscussWorkspaceReportSaveEasy
5A bitmap index is best for columns with:ALong textBUnique valuesCFew distinct values (low cardinality)DFrequent updatesView AnswerDiscussWorkspaceReportSaveEasy