Java Assessment Test Preparation

As a candidate, it is important to understand that the job description usually changes the content of the appropriate assessment test. For example, engineers and programmers are much more likely to only be tested on Java while the web developers and web masters will also be tested on JSP, the Java-based web language. Since it is possible to embed Java code in a JSP page, web developers and webmasters must also be familiar with the rules of Java programming.

The types of questions found on these assessment tests fall into two broad categories: multiple-choice and programming. Multiple-choice questions can test basic concepts as well as proper coding techniques. Programming questions involve actually writing complete code based on the requirements of the question (e.g. write a function that accepts two numerical variables and returns the value of the lesser number).

These multiple-choice tests will typically ask about the different aspects of Java and/or JSP. These tests seem to have an average of about 30 questions, taking an average of 45 - 60 minutes to complete.

For programming tests, the difficulty is more easily gauged than on multiple-choice tests. This is because writing code to return the lesser of two numbers is much easier than writing code to return the median of an array of unordered numbers.

The number of questions and time to complete the tests vary more than the multiple choice tests. The time allotted for programming tests mainly depends on whether the programming test is independent (or in place) of the multiple choice test. If the programming test is separate from the multiple choice test, then the programming test will typically be comparably lengthy time-wise.

There are two main assessment companies that provide SQL assessments: Brainbench and Kenexa Prove It. Brainbench provides many different Java tests including, but not limited to: Java 1 and 2, J2EE, Java EE and JSP. Kenexa Prove It has fewer Java specific tests, but does include Java Hibernate, JSP, and Java EE.

1. Given a string S, 1<=len(S)<=1000, containing only alphabets and digits, find the number of lowercase alphabets, uppercase alphabets and digits in it.The output format is count(lower_alpha):count(upper_alpha):count(digit).Example:Input: HelloWorld42Output: 8:2:2
2. Given an integer array A[0…N-1] (1 <= N <= 1000), count the number of inversions. An inversion is a pair (i, j) such that i < j and A[i] > A[j].Input: You need to correct a function which takes two inputs:input1 – size of array, Ninput2 – integer arrayOutput: number of inversionsExample:Input: 3,{1,3,2}Output: 1Explanation: {3,2} is the only inversion here.