Take a note while surfing.
Give your Note a Colorful Tag.
Stay on same information and in Sync wherever you are.
Organize your information,It may take Shape.
Differ your Content by Color.
Easy to pull up your content from anywhere anytime.
Don't Let information to miss,Because it take shape
Simple an Easy Way to take a note.
Get the same in next visit.
1. The complexity of searching an element from a set of n elements using Binary search algorithm is
2. Two main measures for the efficiency of an algorithm are
3. If the array is already sorted, then the running time for merge sort is: ?
4. Which is the best data structure for round robin algorithm for CPU scheduling?
5. Which algorithm is having highest space complexity?
6. quicksort algorithm is used to sort an array of N elements. If all the N values w
complexity of quicksort that uses first element as the pivot. ?
7. Algorithms A and B solve the same problem. Time complexity of A is in O(n^2) and that of B is in O(n). Which among the following can you guarantee?
8. The complexity of merge sort algorithm is
9. The complexity of linear search algorithm is
10. The complexity of Binary search algorithm is