Register

B tree dbms

34 views

Please log in or register to answer this question.

Voting & Accepting an answer helps improve the community
← PreviousNext →
← Previous in categoryNext in category →

Related questions

2 votes
2 votes
2 answers
1
HeartBleed asked Feb 4, 2019
3,237 views
Gate 2019: B+ Tree
Which of the following is not correct about B + Tree, which is used for creating index of relational database table? (a) Key values in each node kept in sorted order (b) Leaf node pointer points to next node (c) B + tree is height balanced tree (d) Non-leaf node have pointers to data records
Which of the following is not correct about B + Tree, which is used for creating indexof relational database table?(a) Key values in each node kept in sorted order(b) Lea...
User Avatar
0 votes
0 votes
1 answer
3
rajveer43 asked Jan 16
316 views
UPENN | ML | DECISION TREE
Given the following table of observations, calculate the information gain $IG(Y |X)$ that would result from learning the value of $X$. X Y Red True Green False Brown False Brown False (a) 1/2 (b) 1 (c) 3/2 (d) 2 (e) none of the above
Given the following table of observations, calculate the information gain $IG(Y |X)$ that would result from learning the value of $X$. XYRedTrueGreenFalseBrownFalseBrownF...
User Avatar
0 votes
0 votes
1 answer
4
jugnu1337 asked May 16, 2023
977 views
data structure tree
The total number of binary trees possible with height n - 2 having n nodes are? (2n - 5)^ 2n - 3 (2n - 7)^2n - 3 (n - 3) ^2n - 2 (2n - 7)^ 2n - 2
The total number of binary trees possible with height n - 2 having n nodes are?(2n - 5)^ 2n - 3 (2n - 7)^2n - 3(n - 3) ^2n - 2(2n - 7)^ 2n - 2
User Avatar
Link Copied!