Agile Placement Papers
Again, this is fairly old paper so may not be that useful but anyway here it is. If you have any latest info than do tell us in forum, in comment section or through our http://www.coders2020.com/contact form
java:
(1)find out three keywords
(a)synchronized
(b)implement
(c)throws
etc
(2)which are not keywords
(a)NULL
(b)synchronize
etc
(3)two to three questions on legal array declaration
(a)int a[][]=new int[3][3];
(b)int[] a[]=new int[3][3];
(c)int a[3][4]=new int[3][4];wrong
(d)int[3][4] a=new int[3][4];wrong
(e)int a[][]=new int[3][4];
(4)++i+++j is equivalent to
(a)i+j+1
(b)i+j+2
(c)i+j
(d)can't be compiled(correct)
(5)the content of the array after execution of following statement:int a[][]=new int[3][3];
(a)all elements contain zeroes
(6)find legal statements
(a)int a=30;
(b)float f=1.4;(error)
(c)double d=34.5;
(d)byte b=128;(error)
(7)find illegal statements
(a)int i='2';
(b)char a=12;
(8)some 5 qns on collection interfaces
(9)to find the length of array
(a)arr.length-1
(b)arr.length(correct)
(c)arr.length()
(10)write code for accessing array length without assigning it to another variable
(11)recursion is
(a)any function which refer itself
(12)the sorting method which don't generally use recursion
(a)heap sort
(b)bubble sort(ans)
(c)quick sort
(d)bubble sort
(13)one qn regarding abstract
(14)some 2 qns on hash table
C++:
(1)the difference b/w pure virtual fn.& virtual fn.
(a)pure virtual fn. is initialized to zero.
(b)
(2)virtual destructors are used for
(a)
(3)find legal statement
(a)cout>>"name">>endl;
(b)cout<<"name<
(c)cout<<"name"<
(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<
}
(a)it don't be compiled
(b)it compiles and o/ps 10 4(ans)
(5)a qn on copying or assigning
(6)early or static binding means
(a)at runtime
(b)at compiletime(ans)
(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
(a)2(check)