Interview Questions

For inserting, deleting, and locating elements in a Map, the HashMap offers the best alternative. If, however, you need to traverse the keys in a sorted order, then TreeMap is your better alternative. Depending upon the size of your collection, it may be faster to add elements to a HashMap, then convert the map to a TreeMap for sorted key traversal.

Automated testing cannot replace manual testing because of following reason:

- Automated testing cannot replace the analytical skills required to conduct testing. It can only enhance or supplement manual testing,

- Through manual testing, information can be gathered about the application, and real-time decisions can be made about how to enhance a test that would be too difficult to program into an automated script.

- We need a manual tester to analyze and maintain the automated scripts after they can run.

It is the ability of an object to behave differently on different situations for the same message.

Standard deviation measures total risk in stocks.

- Because of the block nature, multiple statements are processed at once thereby improving performance. 

- PL/SQL handles exceptions on catching which, action can be taken. 

- PL/SQL is highly portable as it works with all procedural languages and is highly secured because of privileges.

Here by this question the employer need to know do you have any computer skills for managing an admin's job.

Example Answer :

I'm proficient with Microsoft Office suite including Word, Excel, and Power Point. I'm very comfortable using these programs and have a lot of experience doing so in my previous job roles.

Interface data is static data why bcoz interface supports multiple inheritance.

if inteface data is non-static then there is chance for replication of the data (bcoz of replication of data ambiguity problem occurs )

The garbage collector assumes that all objects in the managed heap are garbage. It starts walking the roots and builds a graph of all objects reachable from the roots recursively. It stops when it attempts to add an object to the graph that it previously added. The graph contains the set of all objects that are reachable from the application's roots. Any object/s that is not in the graph is not accessible by the application, and is considered garbage. Collection only occurs when the heap is full. In such a case, each and every garbage object calls the Finalize method and reclaims the unused memory