Using the arrangements formula, it is found that there are 1152 ways for the students to be arranged alternatively at the table.
The number of possible arrangements of n elements is given by the factorial of n, that is:
[tex]A_n = n![/tex]
In this problem, we have that:
Hence the number of ways is:
2 x 4! x 4! = 1152
More can be learned about the arrangements formula at https://brainly.com/question/24648661
#SPJ1