Interested to Buy Any Domain ? << Click Here >> for more details...
Explain Big-O notation with an example
- 1 Answers
- 1453 Views
- I also Faced
- E-Mail Answers
The Big-O notation depicts the performance of an algorithm as the number of elements in ArrayList. A developer can use Big-O notation to choose the collection implementation. It is based on performance, time, and memory.
For example, ArrayList get(index i) is a method to perform a constant-time operation. It does not depend on the total number of elements available in the list. Therefore, the performance in Big-O notation is O(1).
| Is This Answer Correct ? | 0 Yes | 0 No |
Why is logger singleton?
Is vector synchronized in java?
Definition for connection pooling?
Why are data types important?
write a program to create an vector and listeterator.and value should be enter through keyboard.
What will happen if there is a default method conflict as mentioned above and we have specified the same signature method in the base class instead of overriding in the existing class ?
What are the different http methods?
What is __ init __ functions?
Is a class an object?
What is a JAR file?
Explain about GridBag Layout?
4.1 Supply contracts (in the form of comments specifying pre- and post conditions) for the enqueue() method of the LinkedQueue class given in the Appendix. (2) 4.2 Let Thing be a class which is capable of cloning objects, and consider the code fragment: Thing thing1 = new Thing(); //(1) Thing thing2 = thing1; //(2) Thing thing3 = (Thing) thing1.clone(); //(3) Explain how the objects thing2 and thing3 differ from each other after execution of the statements. (
Core Java 
