Log in
Computer Science
5
answers
0
watching
163
views
31 Aug 2018

18. (2 points) Assume that there is a global array of integers named data, write a code fragment that will count the number of zeros stored in the array and print out the count.

word_media_image1.png
Watch
5
answers
0
watching
163
views

For unlimited access to Homework Help, a Homework+ subscription is required.

Unlock all answers

Get 1 free homework help answer.
Already have an account? Log in
Share
Already have an account? Log in
Share
Already have an account? Log in
Share
Already have an account? Log in
Share
Irving Heathcote
Irving HeathcoteLv2
2 Sep 2018
Already have an account? Log in
Share

Related questions

Coding Question - Sorted array You are to write a method that takes as input an array of integers, returns true if the array is sorted, and returns false otherwise. For example, if a is the array {1,12,5,6,2,87}, then the method has to return false as it is not sorted. Use the 5 following questions to "write" your code. Pay close attention to how your answers group together with each other. 33. Line 1 (A) public static boolean Sorted (int[] a) { (B) public static void Sort (int[] a) { (C) public static int[] Sorted (int a) { (D) public static boolean Sorted() { (E) public static void main(String[] s) {

Programming section (30 points total) The following code must all go inside of a class called Midterm. 21. Write a method sum which takes as input an array of int and returns the sum of the elements in the array. For example, if the array contains 10 2 3, your method should return 15.

18. Which choice below will cause all of the values stored in the array data to be printed out in reverse order? int[] data = {22, 17, 95, 16, 103, -14, 95}; // Choice A for (int i = data.length-1; i >= 0; i--) { print (data[i] + " "); // Choice B for (int i = 0; i < data.length; i++) { print (data[data.length-l-i] + " "); C. Both A and B will print all of the elements in reverse order. D. Neither A nor B will print all of the elements in reverse order

Related Documents

ECS 30
Final Exam
Study Guide
ECS 30 Study Guide - Midterm Guide: Memory Management, C String Handling, C Dynamic Memory Allocation
turquoisegnu128
CS 1044
Final Exam
Study Guide
CS 1044 Midterm: CS 1044 cs1044aF99T2
turquoisegnu128
CS 18000
Final Exam
Study Guide
CS 18000 Midterm: CS18000 Exam 2 2008 Fall with Solutions
turquoisegnu128

Weekly leaderboard

Home
Homework Help 3,900,000
Computer Science 2,000
Start filling in the gaps now
Log in