Create a 2d array with the strings "blue", "green", "red", "yellow", "orange" on the first row, and the strings "berry", "pear", "apple", "banana", "orange" on the second row. So, the 2d array should have 2 rows, where each row has 5 columns. Below is an example of how the 2d array should look: "blue" "green" "red" "yellow" "orange" "berry" "pear" "apple" "banana" "orange" Write code that outputs a pair on each line, where the first element in the pair is the color, and the second element in the pair is the associated fruit. Below is an example of the sample output: ("blue", "berry") ("green", "pear") ("red", "apple") ("yellow", "banana") ("orange", "orange")

Create a 2d array with the strings "blue", "green", "red", "yellow", "orange" on the first row, and the strings "berry", "pear", "apple", "banana", "orange" on the second row. So, the 2d array should have 2 rows, where each row has 5 columns. Below is an example of how the 2d array should look: "blue" "green" "red" "yellow" "orange" "berry" "pear" "apple" "banana" "orange" Write code that outputs a pair on each line, where the first element in the pair is the color, and the second element in the pair is the associated fruit. Below is an example of the sample output: ("blue", "berry") ("green", "pear") ("red", "apple") ("yellow", "banana") ("orange", "orange")

Programming Logic & Design Comprehensive

9th Edition

ISBN:9781337669405

Author:FARRELL

Publisher:FARRELL

Chapter6: Arrays

Section: Chapter Questions

Problem 5GZ

See similar textbooks

Similar questions

Using the following two string arrays, output the first item from the first array with the first item from the second array on the same line (OUTPUT: red Ford). Then, output the second item from each array and output the result. Do this for all four items. String[] firstArray = {“red”, “blue”, “yellow”, “black”}; String[] secondArray = {“Ford”, “Honda”, “GM”, “Toyota”};
Create a 2D array of size 14x14 having same values ranging from 0 to 255 in each row. You are free to specify the values of this array. For instance, consider a 3x3 array as;Array [3] [3]= {{12,12,12}, {75, 75, 75}, {247, 247, 247}}12, 75, and 247 pixel values are specified in a way that they are in a range of 0 to 255 and they are same in a row.Write a code namely arraytoimage.c using any pgm (portable gray map) format image that represents an image in a text file in which each pixel is represented by a number ranging from 0 and 255. In this code, write:-P2 (magic number)-Width and height of the image-Maximum grayscale value-Gray scale intensity values you specify in the arrayin an order to this image
The purpose is to write a program with 2D arrays that will display Knight's Tour. Knight's Tour is a fascinating problem that is done on an electronic chessboard with a knight. Starting at any location on the chessboard, a knight proceeds to move on the board in such a manner that all positions on the chessboard are visited, once and once only. The knight may only move according to the rules of chess playing. The matrixes below show a sequence of knight moves that starts from the top-left corner. In most cases, the knight is locked in place and can go no farther. Note: there are only 3 legal knight moves from the 44 locations and they have already been visited. 01 60 39 34 31 18 09 6438 35 32 61 10 63 30 1759 02 37 40 33 28 19 0836 49 42 27 62 11 16 2943 58 03 50 41 24 07 2048 51 46 55 26 21 12 1557 44 53 04 23 14 25 0652 47 56 45 54 05 22 13 01 22 39 20 03 18 09 1600 37 02 23 08 15 04 1335 40 21 38 19 12 17 1000 00 36 41 24 07 14 0500 34 00 32 00 28 11 2600 00 00 00 42 25 06 2900…
The purpose is to write a program with 2D arrays that will display Knight's Tour. Knight's Tour is a fascinating problem that is done on an electronic chessboard with a knight. Starting at any location on the chessboard, a knight proceeds to move on the board in such a manner that all positions on the chessboard are visited, once and once only. The knight may only move according to the rules of chess playing. The matrixes below show a sequence of knight moves that starts from the top-left corner. In most cases, the knight is locked in place and can go no farther. Note: there are only 3 legal knight moves from the 44 locations and they have already been visited. 01 60 39 34 31 18 09 6438 35 32 61 10 63 30 1759 02 37 40 33 28 19 0836 49 42 27 62 11 16 2943 58 03 50 41 24 07 2048 51 46 55 26 21 12 1557 44 53 04 23 14 25 0652 47 56 45 54 05 22 13 01 22 39 20 03 18 09 1600 37 02 23 08 15 04 1335 40 21 38 19 12 17 1000 00 36 41 24 07 14 0500 34 00 32 00 28 11 2600 00 00 00 42 25 06 2900…
A class with 10 students will take 3 exams. Use 3 arrays to hold the scores for each student and another array to hold the average of the 3 exams for each student. Print a table with scores and the average. SAMPLE OF HOW THE OUTPUT SHOULD BE STUDENT EXAM 1 EXAM 2 EXAM 3 AVERAGE 1 2 3
In java, please read the text file as array. Then, replace the null with 0 and calculate the sum of the new students in ABC University.Example of text file: (university,year,total_students,new_students,new_staff,ABC, 2000, 3457, , ,ABC, 2001, 3675,218, ,EFG, 2000, 2389,602, ,EFG, 2001, 2785,396, 65,)
Write a program that prints at least 10 characters of your name (last, first) in uppercase at the terminal. Use a n by m array (i.e., a two dimensional array, with n (=7) as size of the first dimension and m (=10) as the second dimension) to represent each oversize letter. C++, the name is "Krish"
Draw the state of the array after a first pass of a shellsort with gap size 5, and then again after a second pass with gap size 3. Need the first pass with gap size of 5 and second pass with gap size of 3.
Write a program that creates a 2D array of size 4x5. Then, user enters the elements for this 2D array. Display the array in tabular form, using manipulators.
Draw the state of the array after a first pass of a shellsort with gap size 5, and then again after a second pass with gap size 3.
Given an array below, write a program in Java language to print all numbers which are greater than the average of all numbers in the array. int []array = {1,10,-8,16,-12,34,0,19,-23,14}
How to write a program in java that ask the user to input an int size value into a 2d array, then output a table of random 0 and 1 of that size (table must be a perfect square), then output the fraction of your array that is ones and the fraction that is zeros, then output the sum for each row, the sum of colunms and which row and colunm have the largest sum, then determine if the largest row sum is greater than the largest column sum or vice versa, then output the sum of the diagonal(the diagonal starting at location [0][0] and going down to [N-1][N-1] for an array of size N) and determine if the diagonal sum is greater or equal to the largest row sum and greater than or equal to the largest column sum? output should look similar to screen shot