Tucker states the problem as follows:
"A set of 8 binary digits are equally spaced about the edge of a disk. We want to choose the digits so that they form a circular sequence in which every subsequence of length three is different. Model this problem with a graph with 4 vertices, one for each different subsequence of two binary digits. Make a directed edge for each subsequence of three digits whose origin is the vertex with the first two digits of the edge's subsequence and whose terminus is the vertex with the last two digits of the edge's subsequence. a) Build this graph. b) Show how an Euler cycle will correspond to the desired 8-digit circular sequence. c) Find such an 8 digit circular sequence with this graph model. d) Repeat the problem for 4 digit binary sequence."
Gross states the problem as follows:
"Find a (2,3)-deBruijn digraph and sequence. Repeat the same for a (2,4)-deBruijn digraph and sequence."
The problem is identical, although it is stated in obviously different terms. The question is, which is the optimal wording.
It should be noted that in Tucker, the question is presented after a chapter on Euler cycles, which mentions nothing at all about deBruijn sequences. In fact, this problem appears very early in the book, and very little has been said about digraphs at all, up to that point. In Gross, it follows an elaborate chapter dedicated entirely to deBruijn sequences, about half way into the book. However, I think that the Tucker approach works better in an introductory course. It's very much in spirit with the notion of letting the student "discover" the math that they need to solve a particular problem. Granted, the idea of a disc of binary digits probably does not stir the imagination for most students. But I think that it's a more constructive way of presenting the problem, as opposed to just explicitly stating the exact subject that you want the student to understand. If nothing else, the Tucker wording is far less conducive to just googling the answer.