11. Let $A B C D E F$ be a regular hexagon. A frog starts at vertex $A$ and can jump to one of the two adjacent vertices at each step. If it reaches point $D$ within 5 jumps, it stops jumping; if it does not reach point $D$ within 5 jumps, it stops after 5 jumps. How many different jumping sequences can the frog have from the start to the stop? $\qquad$ kinds.
11. 24 It is evident that the frog cannot reach point $D$ after 1, 2, or 4 jumps. Therefore, the classification here can be divided into reaching point $D$ after 3 jumps and stopping after 5 jumps (regardless of whether point $D$ is reached or not).
（1）The frog reaches point $D$ after 3 jumps, with 2 ways to do so.
（2）The frog stops after 5 jumps, meaning it cannot reach point $D$ after the 3rd jump.
Since each jump can go in 2 directions, the first 3 jumps have $2^{3}$ ways, minus the 2 ways to reach point $D$, leaving $2^{3}-$ 2 ways for the first 3 jumps;
The last 2 jumps have $2^{2}$ ways, so the number of ways to stop after 5 jumps is $\left(2^{3}-2\right) \cdot 2^{2}=24$.