Sounds like the boogy man is after you and the answer to this question will ward him off!
First of all (IF X <>= Z) is usually written (IF X <> Z) the "=" sign does not make sense to me unless there is an implied "OR" there. But it would appear that there would be a node which examines "X > Y" and a node for "X < Y" and in your statement one for "X = Y". which would indicate the answer might be "3".
Rich is right. The relational operator (<>=) in the conditional expression does not appear to be a valid relational operator. The <> relational operator in BASIC like languages means 'not equal'.
So, assuming this is a BASIC like language and you have 1 boolean conditional expression. Essentially you have 2 nodes (the Boolean condition and the exit point) and 2 edges (the true and the false outcome of the Boolean condition). So, edges - nodes + 2 = 2. An easy way to calculate cyclomatic complexity is to count the number of Boolean conditions and add 1.
Most training I know is not simply about the ability to calculate cyclomatic complexity, but how to interpret what that metric might imply in terms of risk, and also help testers who design white-box structural tests (esp. basis path tests).