Recent questions tagged b-tree / GATE Overflow for GATE CSE

6 votes

3 answers

1

GO Classes Test Series 2024 | Mock GATE | Test 14 | Question: 14
A B-Tree of order $m$ is an $m$-way search tree. What is the minimum number of keys that can be stored on the leaf level of a B-Tree of order 20 with 3 levels? (Note: the root of a tree counts as its first level)

A B-Tree of order $m$ is an $m$-way search tree. What is the minimum number of keys that can be stored on the leaf level of a B-Tree of order 20 with 3 levels? (Note: th...

GO Classes

681 views

GO Classes asked Feb 5

0 votes

0 answers

2

Memory Based GATE DA 2024 | Question: 58
DBMS question: One SQL query is given. Based on the query which data structure can be used involving hashing, B+ tree, etc?

DBMS question: One SQL query is given. Based on the query which data structure can be used involving hashing, B+ tree, etc?

GO Classes

137 views

GO Classes asked Feb 4

3 votes

1 answer

3

GO Classes Test Series 2024 | Mock GATE | Test 13 | Question: 32
The order of a leaf node in a $\text{B tree}$ is the maximum number of (value, data record pointer) pairs it can hold. Given that the block size is $1 \mathrm{~K}$ bytes, data record pointer is $7$ bytes long, the value field is $9$ bytes long and a block pointer is $6$ bytes long, what is the order of the leaf node?

The order of a leaf node in a $\text{B tree}$ is the maximum number of (value, data record pointer) pairs it can hold. Given that the block size is $1 \mathrm{~K}$ bytes,...

GO Classes

481 views

GO Classes asked Jan 28

0 votes

1 answer

4

Database system concepts by abraham silberschatz #14th chapter
is it allowed in a B+ tree, while deletion to leave behind a key in internal nodes while deleting it from the leaf ?

is it allowed in a B+ tree, while deletion to leave behind a key in internal nodes while deleting it from the leaf ?

phaniphani

200 views

phaniphani asked Nov 16, 2023

0 votes

1 answer

5

Ace Test Series | DBMS | B+ Trees
Consider the following description: To construct the B+ tree use the following values. Consider the database block size as 512 bytes, block pointer as 6 bytes, record pointer as 7 bytes and search key value as 9 bytes. What will be the number of data entries possible in level 2 of the B+ tree, if fill factor of the node is 0.8? 17,954 16,954 18,954 19,954

Consider the following description:To construct the B+ tree use the following values. Consider the database block size as 512 bytes, block pointer as 6 bytes, record poin...

none30

388 views

none30 asked Sep 6, 2023

0 votes

0 answers

6

TestBook TestSeries question to find max child possible in B+ Tree
In a B+ Tree index having order 6, which is the maximum number of child pointers it can have. Keys are numbered from 1 to 83. What can be the maximum number of nodes which can be used to store all the keys? A. 17 B. 19 C. 59 D. 57

In a B+ Tree index having order 6, which is the maximum number of child pointers it can have. Keys are numbered from 1 to 83. What can be the maximum number of nodes whic...

Sahil_Lather

516 views

Sahil_Lather asked Jan 29, 2023

0 votes

0 answers

7

Unacademy AIMT -1
the answer is 28

the answer is 28

TusharKumar

637 views

TusharKumar asked Dec 23, 2022

0 votes

1 answer

8

do we have B trees in gate 2023 syllabus?

Sai eswar

659 views

Sai eswar asked Oct 24, 2022

tags	tag:apple
author	user:martin
title	title:apple
content	content:apple
exclude	-tag:apple
force match	+apple
views	views:100
score	score:10
answers	answers:2
is accepted	isaccepted:true
is closed	isclosed:true