1. There are some schedules which are possible under basic timestamp but not under 2PL and vice-versa.
2. Lets take an example tp prove the first statement.
Let, TS(T1) = 20 and TS(T2) = 30
Let, the schedule be:
Now, lets see if this possible under basic timestmp protocol.
W(A) of T2 updates the Write-TS(A) = 30 initially.
Then, T1 requests R(A).
Now, TS(T1) < Write-TS(A) and hence, T1 read operation is rejected and T1 is rolled back.
But, this schedule is easily possible under 2PL.
Now, the schedule possible under basic timestamp but not under 2PL: TS(T1) = 20, TS(T2) = 30
3. One ssuch schedule which is conflict serializable but not possible with 2PL is:
2PL scheules $\subseteq$ conflict serializable schedules $\subseteq$ view serializable schedules
Some timestamp schedules that use Thomas' write rule are view serializable but not conflict serializable.