We are not here to answer your homework questions. You should ask your professor.

Please log in or register to post a reply.

And it’s not even dificult to answer…

Imagine the 2D case. Google for “Manhattan distance”. Do the same in 3D. Apply the general formula you discovered to the 4D case. Done.

It does not seem you find it interesting or difficult. It just seems like you want the answer without thinking a bit for yourself.

Did you google for manhattan distance?

The problem may have been just the way you posed the question. You should have described what you did to solve the problem and what you couldn’t figure out yourself. That would have looked less like you just want us to solve your homework.

Draw a 16 x 16 grid. Count the number of hops from one corner to the
next??

I dont even need to draw it, its pretty simple the longest distance is
15 across and 15 down, ie 30 hops.

This is so simple, it would appear you havent even tried.

- Upcoming Multiplatform Game Program...
- Our first game - looking for feedbacks
- Network Emulation Tool
- Trouble with accessing GLSL array
- Fiction
- Game Programming Patterns: Bytecode
- Interactive WebGL Water Demo
- Skeletal Animation Tutorial with GP...
- Unreal Engine 4
- Microsoft xbox one selling poorly

Hi gus, i need help in answering the below question:

A multicomputer with 256 CPUs is organized as 16*16 grid. What is the worst-case delay (in hops) that a message might have to take?

Now consider a 256-CUP hypercube. What is the worst-case delay here, again in hops?