info@avatto.com
+91-9920808017
11. The time taken by an odd even merge network that merges two sorted arrays of size 64 each is ____________.
6
7
8
12
Your email address will not be published. Required fields are marked *
Report
Name
Email
Website
Save my name, email, and website in this browser for the next time I comment.
Comment
12. A 2-D array of log log n rows and n/log log n columns have processors marching down the columns, one position per step. Each array element holds an integer in [1, log log n]. In the first step, elements of value 1 in row-1 are processed
log log n
2 log log n − 1
2 log log n
2 log log n + 1
13. Which of the following is a bitonic sequence?
17 19 20 16 10 11 15
17 19 20 10 10 11 18
17 19 18 16 10 11 20
7 19 15 16 10 11 20
14. When OEM network is invoked on the two sorted sequences 4, 8, 9, 14 and 3, 7, 10, 11, then the sequence produced before the final step is ___________.
3 4 7 8 9 10 11 14
3 7 4 8 9 11 10 14
3 4 7 9 8 10 11 14
3 4 9 10 7 8 11 14
15. When a purported sorting algorithm is run on input 4 3 8 10 9 11 14 7, the output is not sorted. The smallest element that appears out of order is 8. Which of the following is a binary sequence guaranteed to fail the algorithm?
0 0 1 1 1 1 1 0
0 0 0 1 1 1 1 0
0 1 1 1 1 1 1 0
Login with Facebook
Login with Google
Forgot your password?
Lost your password? Please enter your email address. You will receive mail with link to set new password.
Back to login
