Data Structures and Algorithms - Advanced Algorithm

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

16. The number of comparators in a bitonic sort merge sorter with 8 inputs is _________.

Answer
Comment
Array

Option : D
Explanation :

You must be logged in to post a comment.

You must be logged in to post a comment.

17. The time taken by a bitonic sort merge network that merges two sorted arrays of size 64 each is ____________.

Answer
Comment
Array

Option : A
Explanation :

You must be logged in to post a comment.

You must be logged in to post a comment.

18. A comparator network that has a depth of d and cost of c can be simulated on a p processor PRAM in ___________ time.

Answer
Comment
Array

Option : C
Explanation :

You must be logged in to post a comment.

You must be logged in to post a comment.

19. When a bitonic sequence 20 30 40 50 60 55 45 35 is subjected to compare-exchange of diametrically opposite elements, the lower-higher sides are defined using a diameter passing between 20 and 30. If the lower-higher sides were defined using a diameter passing between 30 and 40 instead, which two elements swap places?

Answer
Comment
Array

Option : D
Explanation :

You must be logged in to post a comment.

You must be logged in to post a comment.

20. The number of edges in a linear array of n nodes is _____

Answer
Comment
Array

Option : A
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.