Q1. prepare down an algorithm for the addition of n numbers on the Perfect Shuffle network. Illustrate its accuracy with an illustration.
Q2. prepare down an algorithm for the addition of n numbers on the Chordal ring of degree four and illustrate it’s accuracy with an illustration.
Q3. Design an Omega network and describe its routing.
Q4. Illustrate the order of comparators which are used in a BITONIC-SORTER[n], where n are an exact power of 2? Illustrate it.
Q5. describe the term bitonic sequence? Design a sorter circuit and illustrate that it sorts any arbitrary sequence.
Q6. Describe the distributed objects and how such are implemented in the distributed system?