You are responsible for reading and understanding Sections 9.1 and 9.2.

There is one important note. Definition 9.3 in your book is not quite 
correct. This definition describes the language L(M) corresponding to a 
Turing machine M.

The correct definition is as follows:

L(M)={w in Sigma* : 1) q0w derives* x1px2 for p in F,
                       2) x1px2 is a  halting configuration }

In other words, a string w is accepted by a Turing machine M iff M halts 
in a final state from an initial configuration q0w (i.e. the initial 
configuration with just w on the tape).

Your book does not list condition 2, but this is important. The machine 
must halt in order to accept the string.