Given a binary tree of height H, print the nodes at each level in zig zag order. Means print root, then print level 1 from left to right. Then print Level 2 from right to left

Explain the internal structure of Hibernate First Level Cache

In hibernate below queries are fired Select * from student with id=1 select * from student Select * from student with id=2 Select * from student with id=1 explain how many queries with be hit on the database.

In Spring there is a Prototype bean having a singleton bean. If we get the prototype bean twice what would be the impact on the singleton beans. Means how many instances of each bean be created. Reverse the scenario, means a singleton bean has a prototype bean and we get the singleton bean twice