Closed. This question needs to be more focused. It is not currently accepting answers.
Want to improve this question? Update the question so it focuses on one problem only by editing this post.
Closed 7 years ago.
Improve this question
I have a fully working B-Tree, and I want to convert this into a B+tree.
Is there any way that I can achieve that without changing so much of my code? is it possible?
Is there any way that I can achieve that without changing so much of my code?
Nope. Significant amount of change is required. B+ tree doesn't store data pointer in non-leaf nodes.
Related
Closed. This question needs to be more focused. It is not currently accepting answers.
Want to improve this question? Update the question so it focuses on one problem only by editing this post.
Closed 9 days ago.
Improve this question
I want to create an app where i can Store 64 questions and each question will have its own 64 answers.
If i want a particular answer of any one particular question, So there i just type question Number corresponding Answer Number then i can get particular cell data..
Example:-
Question Number 5 Answer Number 7......
Please help me to provide best or efficient way to develop this app....
Closed. This question needs to be more focused. It is not currently accepting answers.
Want to improve this question? Update the question so it focuses on one problem only by editing this post.
Closed 1 year ago.
Improve this question
I want to make an arraylist that has random numbers and make it in order from least to greatest.
How do I do this?
Try using the
Collections.sort(your_array_name)
This sorts your array from least to greatest in place.
If you still want some more information, try this link:
https://www.geeksforgeeks.org/collections-sort-java-examples/
Closed. This question needs to be more focused. It is not currently accepting answers.
Want to improve this question? Update the question so it focuses on one problem only by editing this post.
Closed 5 years ago.
Improve this question
I am realizing that in my project I am using two libraries that, essentially, do the same thing:
1) org.mockito.Mockito.any
2) org.mockito.Matchers.any
I'd like to use just one of them to be clearer, which one should I stick to?
Thanks!
Mockito is a sub class of Matchers that's why you can still access the parent's static method like you did.
So I suggest you stick with Matchers.any() since that is where the implementation is located.
Closed. This question needs to be more focused. It is not currently accepting answers.
Want to improve this question? Update the question so it focuses on one problem only by editing this post.
Closed 5 years ago.
Improve this question
I understand we can do this with file input and output, but why would we want to do this?
It is simply called persistence.
You nailed it: you want to be able to store information (for example after intensive computations) in a way that survives the lifetime of the current JVM process.
In that sense serialization is a (poor) version of database storage.
But of course, that comment is correct: this does not prevent the creation of objects. It is a mechanism to resurrect previous state into "new" objects.
Closed. This question needs to be more focused. It is not currently accepting answers.
Want to improve this question? Update the question so it focuses on one problem only by editing this post.
Closed 9 years ago.
Improve this question
Here i just want to ask one question which i faced in Java interview.
Question was like how hashmap works.I explained and answered all following questions.But i stuck at one question,which was:
Is it better to have more bucket of objects in collection or less bucket?and why? Please help me here with your view
Best HashMap = Unique Ids - one bucket for one object - fastest access to object when you know the key.