int oddCount = 0; int evenCount = 0; // To initialize the array, declare array to have M-1 (e.g. point to R1) // Then directly initialize each of the elements {1, 1, 3, 5, 8, 13, 21, 34, 55, 89 } // in registers R1, ..., R10 respectively int[] array = { 1, 1, 3, 5, 8, 13, 21, 34, 55, 89 }; // Loop through all 10 indices of the array for (int i = 0; i < 10; i++) { // If the array element bitwise and with 1 is equal to 0, increment even count if ((array[i] & 1) == 0) evenCount++; // Otherwise, increment odd count else oddCount++; }

Draw your Flowchart using Flowgorithm for the following pseudocode    MODULE main()  DECLARE ArrayOfName[1:20] OF STRING  FOR index = 0 to 20 STEP +1  OUTPUT ("Enter Name : ")  INPUT ArrayOfName[i]  ENDFOR  CALL: bubbleSort(ArrayOfName,20)  FOR index = 0 to 20 STEP +1  OUTPUT ArrayOfName[i]  ENDFOR END MODULE

Java

Give the output for the given ruby code.   If 11<2 print "11 is smaller" end print "11 is greater"