QUESTION 19 2 points Save Answer The Barnes-Hut Algorithm for Gravitational N-Bo

Question

QUESTION 19 2 points Save Answer The Barnes-Hut Algorithm for Gravitational N-Body Problem starts with whole space in which a cube contains all the bodies (or particles), then there is a recursive procedure in which a non-empty cube is divided into subcubes 0B16 D.2 QUESTION 20 2 points Save Answer Orthogonal recursive bisection method for solving N-Body problem ensures that the partitioning of the space result in a balanced tree O True O False QUESTION 21 2 points Save Answer A tree in which each node (except leaves) has 4 children is called O A square tree O B. binary tree ° C. octtree D. quadtree

Explanation / Answer

Question 19)

The Barnes hur algorithm for gravittional N-body problem starts with the whole space in which a cube contains all the bodies(or particles), then there is a recuursive procedure in which a non empty cube is divided into __________ subcubes.

Answer:- C.8

----------------------------------------------------

Question 20)

Orthogonal recursive bisection method for solving N-Body problem ensures that the partitioning of the space result in a balance tree

Answer:- A. True

----------------------------------------------------------

Question 21)

A tree in which each node (except leaves) has 4 children called

Answer:- D. Quadtree

--------------------------------------------------

Question 23)

Two communication cannot be composed of the same group of processes.

Answer:- False

---------------------------------------------------------

Question 24)

If we use structured communication to distribute an array of 16 element evenly accross a set of 8 processes, how many elements will be held by each process?

Answer:- C.4

Related Questions

Navigate

• Browse (All)
• Browse Q
• Subjects

---