Please explain Consider the following array of twelve numbers: [6,5,6,5,1,7,7,5,1,5,7,3] For each of these twelve numbers, you may highlight them in dark red. You may highlight as many numbers as you wish. The only rule is that you are not allowed to highlight two adjacent numbers. In other words, if you highlight A[i], you cannot highlight A[i−1] or A[i+1]. Add up the numbers you've highlighted to produce your total score. For example, [6,5,6,5,1,7,7,5,1,5,7,3] gives me a total score of 6+6+1+7+1+3=24. Can you do better? Determine the maximum possible score.

Please explain Consider the following array of twelve numbers: [6,5,6,5,1,7,7,5,1,5,7,3] For each of these twelve numbers, you may highlight them in dark red. You may highlight as many numbers as you wish. The only rule is that you are not allowed to highlight two adjacent numbers. In other words, if you highlight A[i], you cannot highlight A[i−1] or A[i+1]. Add up the numbers you've highlighted to produce your total score. For example, [6,5,6,5,1,7,7,5,1,5,7,3] gives me a total score of 6+6+1+7+1+3=24. Can you do better? Determine the maximum possible score.

EBK JAVA PROGRAMMING

9th Edition

ISBN:9781337671385

Author:FARRELL

Publisher:FARRELL

Chapter8: Arrays

Section: Chapter Questions

Problem 9PE

See similar textbooks

Similar questions

Consider the following array of twelve numbers: [6,5,6,5,1,7,7,5,1,5,7,3] For each of these twelve numbers, you may highlight them in dark red. You may highlight as many numbers as you wish. The only rule is that you are not allowed to highlight two adjacent numbers. In other words, if you highlight A[i], you cannot highlight A[i-1] or A[i+1]. Add up the numbers you've highlighted to produce your total score. For example, [6,5,6,5,1,7,7,5,1,5,7,3] gives me a total score of 6+6+1+7+1+3 = 24. Can you do better? Determine the maximum possible score.
Use a two-dimensional array to write a game of Tic-Tac-Toe that represents the board.
Please assist with Java coding (Netbeans) Create a two-dimensional array to contain the three different MCSD Marks (JD521, PRG521, and IP521) for six different students. A single array must be used to store the student names (Maxwell, Carl, Gerhard, Paul, James, and Cena).Allow a user to enter in a number, ranging from 1 to 6, which will represent the student position in the table MCSD max. The program can only stop when the user enter a number greater than 6.Printout the student name including the JD521, PRG521, and IP521 max, the total of marks and the average of all marks. Use a condition statement to decide that the student has passed or not (Pass rate is 70).
Use for loops on the above 2D array to: •Find how many ZEROsand how many negative numbersare in the matrixand display results *HELP: declare a variable “count_zero= 0and count_neg=0” and increment the count each time you findzero and negative •Create an array of size 7 of integers1, -9, 10, 20, 5, 6, 7 . You can set these numbers in the code with initialization. •Write a function that accepts anarray and returns the location/index of any value passed to the function. Test it with value 20 and value -1 *HELP: this is linear search •Test it with value 7and write code in your “main” to see if it is the last element in the array (10 points)
2. Create a 2D array that resembles the matrix below. [[21 22 23 24] [25 26 27 28]] Find out the shape of the above array Your code:
1. Create a 2D char array called grades, to save the grades for three students for five courses (size 3 by 5). Write the nested for loop to initialize the first row with ‘A’, second row ‘B’, and third-row ‘C’. 2. Say the second student got C for the fifth course. The third student got an A for the first course. Make the changes to the above array. 3. Print out the array elements in the 2-dimensional format like the following. Make sure you print out the student # and course numbers so one can easily locate an array element. Format your output like the following. After initialization: Grades of 3 students Course1 Course2 Course3 Course4 Course5Student 1: A A A A AStudent 2: B B B B BStudent 3: C C C C C After change:…
1. Create a 2D char array called grades, to save the grades for three students for five courses (size 3 by 5). Write the nested for loop to initialize the first row with ‘A’, second row ‘B’, and third-row ‘C’. 2. Say the second student got C for the fifth course. The third student got an A for the first course. Make the changes to the above array. 3. Print out the array elements in the 2-dimensional format like the following. Make sure you print out the student # and course numbers so one can easily locate an array element. Format your output like the following.
The student names and the grades for four tests for Mr. Smith’s class have been placed in parallel arrays. Mr. Smith would like to have one student’s name and test scores printed. Develop a solution that will enter the student’s name, search for the name in the same array, and then print the name and test scores. Use the sequential-search method.
Create an array of 3,4,5,2,6,3,7,3,8,9 elements and find the most occurring element in the array i.e., 3.
Interpolation Search Search the array below: 18 10, 12, 13, 16, 18, 19, 20, 21, 22, 23, 24, 33, 35, 42, 47 Insert 49 And search 18 again, what is the difference? How many steps? Insert 1000 And search 18 again, what is the difference? How many steps? Compare these 3 searches and comment
Listen Match the shape to the array. 0000 ['a' 'b' 'c' 'd'] 3.1415 [[1, 2], [3, 4], [5, 6], [7,8]] [[[1, 2, 9], [3, 2, 6]], [[8, 8, 4], [9, 8, 7]]] [[10, 20, 30, 40], [50, 60, 70, 80]] [3.1415] 1. () 2. (2, 2, 3) 3. invalid array 4. (4) 5. (1) 6. (2,4) 7. (4,2)
Please