Are these two questions same?

1. Given a Bitonic array, find if a given ‘key’ is present in it.
   A Bitonic Sequence is a sequence of numbers that is first strictly increasing then after a point strictly decreasing.
   An array is considered bitonic if it is monotonically increasing and then monotonically decreasing.

2. Search in rotated sorted array.

If not what is the difference, I am really confused with the wordings of some of the Binary search problems.