1)Whenever bfs and used and what are the methodology to implement these terms 2) Why we use cache even we have register also 3) Subnetting term 4) Round Robin algorithm 5) Merge sort algorithm why better than other and from whom 6) Why java don't use pointers 7) There is an array we have to print all the elements that occurs even time in O(1) Space complexity And many more multiple questions from networks operating system DBMS etc.