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
Recent activity by s_raj
1
answer
1
Memory Management
Can any one please explain , Why the compile time and load time address-binding generate identical logical and physical address but execution time binding generate different logical and physical address?
Can any one please explain , Why the compile time and load time address-binding generate identical logical and physical address but execution time binding generate differ...
1.3k
views
answer edited
Oct 27, 2017
5
answers
2
#Divide and conquer
Given 2 sorted arrays each of n-elements and distinct. How much time it will take to find middle element of union array? (a) O(1) (b) O(log n) (c) O(n) (d) None of these
Given 2 sorted arrays each of n-elements and distinct. How much time it will take to find middle element of union array?(a) O(1)(b) O(log n)(c) O(n)(d) None of these
3.0k
views
commented
Jun 19, 2017
Algorithms
sorting
time-complexity
divide-and-conquer
+
–
8
answers
3
Minimum number of comparisons required to sort 5 elements is
The minimum number of comparisons required to sort 5 elements is - 4 5 6 7
The minimum number of comparisons required to sort 5 elements is -4567
43.6k
views
answered
Jun 16, 2017
Algorithms
algorithms
sorting
+
–
6
answers
4
GATE CSE 1995 | Question: 1.16
For merging two sorted lists of sizes $m$ and $n$ into a sorted list of size $m+n$, we require comparisons of $O(m)$ $O(n)$ $O(m+n)$ $O(\log m + \log n)$
For merging two sorted lists of sizes $m$ and $n$ into a sorted list of size $m+n$, we require comparisons of$O(m)$$O(n)$$O(m+n)$$O(\log m + \log n)$
47.9k
views
answered
Jun 16, 2017
Algorithms
gate1995
algorithms
sorting
normal
+
–
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register