You are given an array of integers below. Write a Java program to perform the following operation on the array. Double the number if both the adjacent elements are equal. • Subtract the number from 5 if both the adjacent elements are not equal but both are odd. The array should be modified in one go, i.e. once an element is modified, the original number should be considered for the modification of the remaining numbers and not the modified number. int [Jarr = {12, 7, 12, 53, 2, 5, 49, 5, 21, 0}

You are given an array of integers below. Write a Java program to perform the following operation on the array. Double the number if both the adjacent elements are equal. • Subtract the number from 5 if both the adjacent elements are not equal but both are odd. The array should be modified in one go, i.e. once an element is modified, the original number should be considered for the modification of the remaining numbers and not the modified number. int [Jarr = {12, 7, 12, 53, 2, 5, 49, 5, 21, 0}

Database System Concepts

7th Edition

ISBN:9780078022159

Author:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Publisher:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Chapter1: Introduction

Section: Chapter Questions

Problem 1PE

See similar textbooks

Similar questions

For this exercise, you need to shift all the elements in the array one space to the right (increase the index of the element by 1). The last element will wrap around and become the new first element. For example, given: moveUp({"first", "second", "third", "fourth"}); You would return: {"fourth", "first", "second", "third"} in java
Write a program that prompts the user for an integer, then asks user to enter that many integer value. Store these values in an integer array and print the array. Reverse the array elements so that first element become the last element, the second element become the second to last element, and so on, with the old last element now first. Do not just reverse the order in which they are printed; actually, change the way they are stored in the array. Try not to create a second array; just rearrange the elements within the array you have. (Hints; Swap elements that need to change place.) When the elements have been reversed, Print the array again.
I need to write an array method that Shift all elements to the right by one and move the last element into the first position. For example, 1 4 9 16 25 would be transformed into 25 1 4 9 16. For some reason, I managed to get it to shift to the left, but I cannot figure out to shift it to the right? The problem is from Big Java 6th E. E7.10.b
Can you help with the following question? Write a Java program that creates and initializes an array of integers. Then it finds and prints theminimum odd value in this array with its index. Assume that all the values < 1,000,000.
Write a program in JAVA to input the number of elements in an array, also input the values in the array from the console. Replace all those elements which are even and greater than 5, with -99. Print the final array. Constraints: The array should initially not contain -99. The value of the number of elements should not be greater than 50.
Write a Java program to find continuous sub array of the given array whose sum is equal to a given number. For example, If {12, 5, 31, 9, 21, 8} is the given array and 45 is the given number, then you have to find continuous sub array in this array such that whose elements add up to 45. In this case, {5, 31, 9} is such sub array whose elements add up to 45.
JAVA: Below is a method intended to modify the input array by doubling each element and a main method that calls it. What does this code print out? If the method does not do what is intended, what needs to be modified?
You are given two int variables j and k, an int array zipcodeList that has been declared and initialized, and a boolean variable duplicates. Write some code that assigns true to duplicates if any two elements in the array have the same value, and that assigns false to duplicates otherwise. Use only j, k, zipcodeList, and duplicates. this is a java program
I am trying to write a code that swaps 1st element of an array with 2nd one, 3rd with 4th and keeps like that. It is not working and instead I wrote a code that is reversing the order. (better explanation on pictures attached.) I am using Java. public static void swapPairs(String[]array) {for(int i= 0; i< array.length / 2; i++) {int j= array.length - i -1;swap(array, i, j);}}public static void swap(String[] array, int i, int j) {String temp= array[i];array[i]= array[j];array[j]= temp;}
Write a java code that computes the alternating sum of all the elements in an array. For example, if your program has an array with these elements. 1 4 9 16 9 7 4 9 11 It will compute: 1 - 4 + 9 - 16 + 9 - 7 + 4 - 9 + 11 = -2
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}
FOR JAVA Write a method that takes a one dimensional integer array and an integer, and returns the index of the integer in the array. If the integer is not in the array, your program must return -1. If there are multiple occurrences of that number, your program must return the smallest index. Repeat the second question, but if there are multiple occurrences of the number, your program must return the largest index instead of the small- est.