Data Structures and Algorithms - Advanced Algorithm

Avatto > > UGC NET COMPUTER SCIENCE > > PRACTICE QUESTIONS > > Data Structures and Algorithms > > Advanced Algorithm

11. The time taken by an odd even merge network that merges two sorted arrays of size 64 each is ____________.

Answer
Comment
Array

Option : B
Explanation :

You must be logged in to post a comment.

You must be logged in to post a 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

Answer
Comment
Array

Option : B
Explanation :

You must be logged in to post a comment.

You must be logged in to post a comment.

13. Which of the following is a bitonic sequence?

Answer
Comment
Array

Option : A
Explanation :

You must be logged in to post a comment.

You must be logged in to post a comment.

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 ___________.

Answer
Comment
Array

Option : B
Explanation :

You must be logged in to post a comment.

You must be logged in to post a comment.

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?

Answer
Comment
Array

Option : C
Explanation :

You must be logged in to post a comment.

You must be logged in to post a comment.

Related Quiz.
Advanced Algorithm

Forgot your password?

I agree with the Terms.