The Full Wiki

B-tree: Quiz


Question 1: MS/DOS, for example, used a simple ________ (FAT).
Open XML Paper SpecificationFile Allocation TableNTFSMicrosoft Windows

Question 2: Apple's filesystem and Microsoft's ________[3] use B-trees.
File Allocation TableInternet ExplorerMicrosoft WindowsNTFS

Question 3: This maximizes access concurrency by multiple users, an important consideration for ________ and/or other B-Tree based ISAM storage methods.
DatabaseRelational modelSQLDatabase model

Question 4: In the ________ filesystem, there were only 4,096 entries, and the FAT would usually be resident.
File Allocation TableOpen XML Paper SpecificationNTFSMicrosoft Windows

Question 5: Searching is similar to searching a ________.
Binary search treeB-treeHeap (data structure)Tree (data structure)

Question 6: ________ (and possibly TENEX) used a 0 to 2 level tree that has similarities to a B-Tree[citation needed].
Digital Equipment CorporationTOPS-20RSTS/EOpenVMS

Question 7: A ________ of a sorted table with N records, for example, can be done in O(log2N) comparisons.
Sorting algorithmBinary search algorithmAlgorithmHash table

Question 8: ________ is typically (but not necessarily) used within nodes to find the separation values and child tree of interest.
Hash tableSorting algorithmBinary search algorithmAlgorithm

Question 9: In ________, a B-tree is a tree data structure that keeps data sorted and allows searches, sequential access, insertions, and deletions in logarithmic amortized time.
Computer scienceComputer programmingProgramming paradigmSoftware engineering

Question 10: The B-tree is a generalization of a ________ in that more than two paths diverge from a single node.
Red-black treeBinary search treeHeap (data structure)Tree (data structure)


Got something to say? Make a comment.
Your name
Your email address