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
Questions by souravsaha
2
votes
2
answers
1
MadeEasy Test Series 2018: Databases - Indexing
In a database file structure, the search key field is 9 bytes long, the block size is 1024 bytes, a record pointer is 7 bytes and a block pointer is 6 bytes. The largest possible order of a leaf node in a B+ tree implementing this file structure is ________. I am getting 63 as the answer, but in the solution, it's saying 64. Can anyone check?
In a database file structure, the search key field is 9 bytes long, the block size is 1024 bytes, a record pointer is 7 bytes and a block pointer is 6 bytes. The largest ...
1.7k
views
asked
Jan 15, 2018
Databases
databases
indexing
made-easy-test-series
madeeasy-testseries-2018
+
–
0
votes
1
answer
2
Memory Interfacing problem in Computer Organisation and Architecture
Hi All, I have one doubt regarding avg access time in various levels of memory. There are 2 ways in which the processor is connected to various levels of memory. 2 levels Case 1: (parallel access) T avg = H1 * T1 + ( ... , nothing is mentioned solved via case 1 only. Can anyone please let me know which one should I use. Thank you.
Hi All,I have one doubt regarding avg access time in various levels of memory. There are 2 ways in which the processor is connected to various levels of memory.2 levelsCa...
1.1k
views
asked
Oct 14, 2017
CO and Architecture
co-and-architecture
memory-interfacing
+
–
1
votes
0
answers
3
Made Easy Test Series :
Can anyone help to find the value of S2. The ans is (B). please help to evaluate the series s2. Thank you in advance.
Can anyone help to find the value of S2. The ans is (B). please help to evaluate the series s2. Thank you in advance.
297
views
asked
Sep 10, 2017
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register