Login
Register
@
Dark Mode
Profile
Edit my Profile
Messages
My favorites
Register
Activity
Q&A
Questions
Unanswered
Tags
Subjects
Users
Ask
Previous Years
Blogs
New Blog
Exams
Dark Mode
Recent questions tagged b-tree
0
votes
0
answers
1
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
Sahil_Lather
asked
in
Databases
Jan 29
by
Sahil_Lather
106
views
b-tree
testbook-test-series
databases
0
votes
0
answers
2
Unacademy AIMT -1
the answer is 28
TusharKumar
asked
in
Databases
Dec 23, 2022
by
TusharKumar
201
views
databases
b-tree
normal
0
votes
1
answer
3
do we have B trees in gate 2023 syllabus?
Sai eswar
asked
in
Unknown Category
Oct 24, 2022
by
Sai eswar
150
views
b-tree
syllabus
1
vote
1
answer
4
Igate2022 Test Series
consider a ABC university and the relation took(StudentID, CourseNo, Quarter, Year, Units, Grade) contains the grades for the courses completed by ABC students during the last 20 years. For simplicity, assume that there are 25,000 students enrolled each quarter, and ... the B+ use, in the worst case. (n denotes the maximum number of pointers in a node.) Ans 3 Please explain
Amit Mehta
asked
in
Databases
Sep 19, 2022
by
Amit Mehta
186
views
indexing
b-tree
test-series
1
vote
1
answer
5
Applied Mock Test
The smallest number of keys that will force a B-Tree of order 3 to have a height of 3 are _______ Consider that the root node is at height 0.
LRU
asked
in
Databases
Dec 22, 2021
by
LRU
475
views
test-series
databases
b-tree
1
vote
1
answer
6
Ace BITS&BYTES, #Trees #B-Tree
What is the smallest and largest number of entries for 2_3 BTree (B2_3 Tree) of height 8 (i.e 8 levels) ? 255 & 6560 127 & 2186 6561 & 255 255 & 2186
casberg
asked
in
DS
Nov 23, 2021
by
casberg
256
views
data-structures
b-tree
tree
ace-booklet
4
votes
5
answers
7
GATE CSE 1994 | Question: 14b
For a $B^+$ - tree of order $d$ with $n$ leaf nodes, the number of nodes accessed during a search is $O(\_)$.
gatecse
asked
in
Databases
May 3, 2021
by
gatecse
1.9k
views
gate1994
databases
b-tree
normal
descriptive
Page:
1
2
3
4
5
6
7
next »
Subscribe to GATE CSE 2023 Test Series
Subscribe to GO Classes for GATE CSE 2023
Quick search syntax
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
Recent Posts
BITSHD 2023
My journey from being a MSc student to AIR 239 in GATE CSE 2023 and qualified UGC-NET JRF.
NEEPCO Recruitment 2023
GATE CSE 2023 Results
IIIT Banglore MTech 2023-24
Subjects
All categories
General Aptitude
(2.5k)
Engineering Mathematics
(9.3k)
Digital Logic
(3.3k)
Programming and DS
(5.9k)
Algorithms
(4.6k)
Theory of Computation
(6.7k)
Compiler Design
(2.3k)
Operating System
(5.0k)
Databases
(4.6k)
CO and Architecture
(3.8k)
Computer Networks
(4.7k)
Non GATE
(1.3k)
Others
(2.5k)
Admissions
(653)
Exam Queries
(845)
Tier 1 Placement Questions
(17)
Job Queries
(76)
Projects
(9)
Unknown Category
(866)
Recent questions tagged b-tree
Recent Blog Comments
Please provide some tips about NET, since I want...
Amazing story to hear
Link added now:...
Sir can you please provide some good resources...
Where can we see the responses of the form filled?