Login
Register
Dark Mode
Brightness
Profile
Edit Profile
Messages
My favorites
My Updates
Logout
Filter
Profile
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
Answers by yashpaneliya
0
votes
1
DBMS Korth Edition 4 Exercise 12 Question 5 (Page No. 490)
Construct a $B^+$-tree for the following set of key values: $(2, 3, 5, 7, 11, 17, 19, 23, 29, 31)$ Assume that the tree is initially empty and values are added in ascending order. Construct B+-trees for the cases where the number of pointers that will fit in one node is as follows: a. Four b. Six c. Eight
Construct a $B^+$-tree for the following set of key values:$(2, 3, 5, 7, 11, 17, 19, 23, 29, 31)$Assume that the tree is initially empty and values are added in ascending...
1.5k
views
answered
Nov 9, 2021
Databases
korth
databases
indexing
b-tree
descriptive
+
–
1
votes
2
GATE CSE 2006 | Question: 34
Consider the regular language $L=(111+11111)^{*}.$ The minimum number of states in any DFA accepting this languages is: $3$ $5$ $8$ $9$
Consider the regular language $L=(111+11111)^{*}.$ The minimum number of states in any DFA accepting this languages is:$3$$5$$8$$9$
34.4k
views
answered
Jun 2, 2021
Theory of Computation
gatecse-2006
theory-of-computation
finite-automata
normal
minimal-state-automata
+
–
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register