1. What is true about array of object?

   		It holds primitive data.
   		It holds reference value.
   		It contains unlimited object elements.
   		We can apply arrayname.length to find the first element in the array.

1. Which statement is TRUE about array doll. Doll doll[] = new Doll[10];?

   		Array doll has 9 elements
   		Doll.size() will return 10
   		Every element in array doll must be initialised with new object Doll before use.
   		The last index of array doll is 10.

1. The time complexity for searching operation of a random key using Binary Search is __________

   		O(log (n))
   		O(1)
   		O(n)
   		O(n2)

1. Big O notation tells__________________.

   		how the speed of an algorithm relates to the size of the memory of items.
   		how the size of a data structure related to the number of items.
   		the performance time of an algorithm for a given size data structure.
   		None of the above.

1. Searching maximum values in an ordered array is ___________.

   		O(1)
   		O(n)
   		O(n2)
   		O(log n)