What do you know about the big-o notation and can you give some examples with respect to different data structures?
- 1 Answers
- 1021 Views
- I also Faced
- E-Mail Answers
Answer / Vishwajeet
Big O notation is a mathematical notation that describes the time complexity or space complexity of an algorithm. It provides upper and lower bounds on the performance of an algorithm as the size of the input grows. For example, searching for an element in an array (using linear search) has a time complexity of O(n), while searching in a sorted array has a time complexity of O(log n) due to binary search. Insertion into an ArrayList also has a time complexity of O(n) when adding elements at the beginning, but is O(1) when adding them at the end.
| Is This Answer Correct ? | 0 Yes | 0 No |
Does concurrenthashmap allow null?
Differentiate between hashmap and hashtable.
What is data in computer science?
How do you sort an array in decreasing order?
Which sorting algorithm is worst?
When would you use a tuple?
In which matrix, we can use multilinked structures?
Can a hashset contain duplicates?
Name two algorithms two find minimum spanning tree?
What is merge sort in daa?
Is Linked List 'linear' or 'Non-linear' data structure?
What are the tasks performed during postorder traversal?
Windows 
