Sutherland Java Questions: Agile Java QuestionsTab.amp

Examrace Placement Series prepares you for the toughest placement exams to top companies.

About company:

It is a small mnc with total no. Of employees 600 worldwide and with 60 members in Bangalore. Their clients are 1250 in number. They give solutions for improving product lifecycle. Agile PLM solution is their trade name. They are offering a salary of 2.5lack per annum with stock options in addition. They give good importance to good acadamics. The interview is only personal and most simple for

high percentage getters. This compeny name is not in the cmm level 5 list. The test contains 60qns Duration: 1hr.

30 qns from c + +, 30 qns from java. The qns are objective type may have more than one ans

java:

  1. find out three keywords

    1. synchronized

    2. implement

    3. throws

    etc

  2. which are not keywords

    1. NULL

    2. synchronize

    etc

  3. two to three questions on legal array declaration

    1. int a[][] = new int[3][3]

    2. int[] a[] = new int[3][3]

    3. int a[3][4] = new int[3][4]; wrong

    4. int[3][4] a = new int[3][4]; wrong

    5. int a[][] = new int[3][4]

  4. + + i + + + j is equivalent to

    1. i + j + 1

    2. i + j + 2

    3. i + j

    4. can't be compiled (correct)

  5. the content of the array after execution of following statement: Int a[][] = new int[3][3]

  6. find legal statements

    1. int a = 30

    2. float f = 1.4 (error);

    3. double d = 34.5

    4. byte b = 128 (error);

  7. find illegal statements

    1. int i = ‘2’

    2. char a = 12

  8. some 5 qns on collection interfaces

  9. to find the length of array

    1. arr. Length-1

    2. arr. Length (correct)

    3. arr. Length ()

  10. write code for accessing array length without assigning it to another variable

  11. recursion is

  12. the sorting method which don't generally use recursion

    1. heap sort

    2. bubble sort (ans)

    3. quick sort

    4. bubble sort

  13. one qn regarding abstract

  14. some 2 qns on hash table

C + + Language

  1. the difference b/w pure virtual fn. & virtual fn.

  2. virtual destructors are used for

  3. find legal statement

  4. find the o/p of the program void main () { int a = 10; b; if (a ⇐ 10) b = 4; if (a>10) b = 5; cout< }

  5. a qn on copying or assigning

  6. early or static binding means

  7. one qn on global variables, one qn on globally declared static variable

  8. two qns on “vector” type

  9. the branch of a tree which has no childs is called

  10. when a node c is inserting b/w nodes a and b how many pointer will be modified