11Hash indexes are best suited for:AEquality searchesBLIKE '%text%' searchesCRange queriesDSortingView AnswerDiscussWorkspaceReportSaveEasy
12In a B+ tree of order n, each internal node (except the root) has at least:An childrenB2n childrenC⌈n/2⌉ childrenD1 childView AnswerDiscussWorkspaceReportSaveMedium
13In a B+ tree, actual data pointers are stored in:ANo nodesBThe root onlyCThe leaf nodesDInternal nodes onlyView AnswerDiscussWorkspaceReportSaveEasy
14Which data structure is most commonly used for database indexes?ALinked listBQueueCB+ treeDStackView AnswerDiscussWorkspaceReportSaveEasy
15EXPLAIN (or EXPLAIN PLAN) in SQL is used to:ACreate an indexBExplain SQL syntaxCDocument a tableDShow how the database will execute a queryView AnswerDiscussWorkspaceReportSaveEasy