Does Second chance Page replacement algorithm suffer with Belady's anomaly?
This is not true.  This is only a special case in once instance of 2nd chance algorithm.  All reference bits set to one does not persist for each page that tested for a page replacement.  Since LRU does not suffer from Belady's anomaly, and since 2nd chance is an approximation to LRU, then it follows that 2nd chance does not suffer from Belady's anomaly.