Back to the 2025 paper
Similar questions
Database Management SystemWhat is a B-tree? Explain its structure, order, and properties. How is a B-tree used in database indexing? Demonstrate insertion and search operations in a B-tree with a proper example. Also compare B-tree with binary search tree in context of database performance.20247mDATABASE MANAGEMENT SYSTEMWhich of the following is true? - (i) B+ tree allows only the rapid random access (ii) B+ tree allows only the rapid sequential access (iii) B + tree allows rapid random access as well as rapid sequential access (iv) B + tree allows rapid random access and slower sequential access20212mDatabase Management SystemWhich of the following is used for indexing in database systems? (i) Transaction log (ii) B-tree (iii) Views (iv) Triggers20242mDatabase Management SystemExplain different indexing techniques used in databases.20257m
PreviousSuppose relation R(A,B,C) is decomposed into: R1(A,B) and R2(B,C). The decomposition is lossless if: (i) B \rightarrow A or B \rightarrow C (ii) A \rightarrow B (iii) A \rightarrow C (iv) C \rightarrow BNextFor a B-tree of order m, every non-root internal node must have at least: (i) m/2 children (ii) [m/2] children (iii) [m/2]-1 children (iv) m-1 children
AI LearningWeb Platform
Coursify — Personal AI Course Generator
Struggling with a difficult subject or concept? Turn any engineering topic into a structured course with interactive lessons, quizzes, and research-backed explanations.