Data Structures and Algorithms - Advanced Algorithm

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

Cancel reply

Your email address will not be published. Required fields are marked *


Cancel reply

Your email address will not be published. Required fields are marked *


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

Cancel reply

Your email address will not be published. Required fields are marked *


Cancel reply

Your email address will not be published. Required fields are marked *


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

Cancel reply

Your email address will not be published. Required fields are marked *


Cancel reply

Your email address will not be published. Required fields are marked *


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?

Cancel reply

Your email address will not be published. Required fields are marked *


Cancel reply

Your email address will not be published. Required fields are marked *


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

Cancel reply

Your email address will not be published. Required fields are marked *


Cancel reply

Your email address will not be published. Required fields are marked *