Create 2 int arrays, apple and orange, each length 3. Consider the product of the values in each array. Return the array which has the largest product. In event of a tie, return "tie". Ex: If the input is: 1 2 3 4 5 6 the output is: 4 5 6 Ex: If the input is: 1 1 1 1 1 1 the output is: tie 449182.3196742.qx3zqy7 LAB ACTIVITY 13.10.1: CodingBird (Array): compair2 1 import java.util.Scanner; 3 public class compair2 { public static void main(String[] args) { /* Type your code here. */ compair2.java 0/10 Load default template...

Create 2 int arrays, apple and orange, each length 3. Consider the product of the values in each array. Return the array which has the largest product. In event of a tie, return "tie". Ex: If the input is: 1 2 3 4 5 6 the output is: 4 5 6 Ex: If the input is: 1 1 1 1 1 1 the output is: tie 449182.3196742.qx3zqy7 LAB ACTIVITY 13.10.1: CodingBird (Array): compair2 1 import java.util.Scanner; 3 public class compair2 { public static void main(String[] args) { /* Type your code here. */ compair2.java 0/10 Load default template...

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

Consider the int Array below and determine the values of A and B so that Array[0] has an integer in the range Array[0] = A + rand () % B: = -23 , B 95 a. O b.A = -24, B = 95 Oc.A = -22 ,B = 94 O d.A = -23 ,B = 96 O e.A = -23, B = 94
Write a program that calculates your final grade. The program prompts the user to enter 4 grades and stores them in "grades" array. The program should at first find and display the maximum grade, then it should calculate and display the average grade. Your program should execute exactly as the below sample runs Samplel: Enter Grade 1 100 Enter Grade 2 90 Enter Grade 3 80 Enter Grade 4 90 The maximum grade is : 100.0 Your average grade is 90.0 Sanıple2. Enter Grade 1 50 Enter Grade 2 10 Enter Crade 3 50 Enter Grade 4 70 The maxlnun grade is 70.0 Youc aveage grade is : 60.0U
text file 80 1 2 3 100 100 100 1001 0 2 100 3 4 100 1002 2 0 4 4 100 5 1003 100 4 0 100 100 4 100100 3 4 100 0 3 3 3100 4 100 100 3 0 100 1100 100 5 4 3 100 0 2100 100 100 100 3 1 2 0 My code below. I am getting an error when trying to create my adjacency matrix. i dont know what i am doing wrong def readMatrix(inputfilename): ''' Returns a two-dimentional array created from the data in the given file. Pre: 'inputfilename' is the name of a text file whose first row contains the number of vertices in a graph and whose subsequent rows contain the rows of the adjacency matrix of the graph. ''' # Open the file f = open(inputfilename, 'r') # Read the number of vertices from the first line of the file n = int(f.readline().strip()) # Read the rest of the file stripping off the newline characters and splitting it into # a list of intger values rest = f.read().strip().split() # Create the adjacency matrix adjMat = []…
Task 02: Review the concept of arithmetic progressions from chapter-2. Write a method that takes an array of n integers as input. The method checks whether an arithmetic progression can be formed using all the given elements. If possible print "Yes", else print "No". hint: The array of integers {18, 15, 6, 9, 12} can form arithmetic progression if arranged as 6,9,12,15,18 so the method returns "Yes" in this case, but the array (12, 40, 11, 20} cannot form an arithmetic progression. The answer returned in this case will be "No".
Write a loop that sets newScores to oldScores shifted once left, with element 0 copied to the end. Ex: If oldScores = {10, 20, 30, 40}, then newScores = {20, 30, 40, 10}.Note: These activities may test code with different test values. This activity will perform two tests, both with a 4-element array (int oldScores[4]). Also note: If the submitted code tries to access an invalid array element, such as newScores[9] for a 4-element array, the test may generate strange results. Or the test may crash and report "Program end never reached", in which case the system doesn't print the test case that caused the reported message. #include <iostream>using namespace std; int main() { const int SCORES_SIZE = 4; int oldScores[SCORES_SIZE]; int newScores[SCORES_SIZE]; int i; for (i = 0; i < SCORES_SIZE; ++i) { cin >> oldScores[i]; } /* Your solution goes here */ for (i = 0; i < SCORES_SIZE; ++i) { cout << newScores[i] << " "; } cout…
Mmnmkk
Suppose you have given a circular array of integers where start and size is given. You need to find the second largest even number and second smallest even number of the array. After that, replace the next index value of the second largest even value index with summation of the second largest even value and second smallest odd value, and previous index value of the second smallest even value index with the multiplication of the second largest odd and second smallest even value. Note: You must change the start and size accordingly. Assume that O represents empty spaces in the array. [You are not allowed to use any additional array/list or any built-in functions except lenO, range0].
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 four methods named insertionSort(), bubblesort(), mergesort() and quicksort(). Implement the sorting algorithms in the corresponding methods. In the main method, create four arrays a, b, c, d and initialize them with the same values. Pass these four arrays in four different functions. Create four instance variables named insertionSwap, bubbleSwap, countMerge, and countQuickSort and initialize them to 0. In methods insertionSort(), bubblesort() and quicksort(), increment the variables insertionSwap, bubbleSwap, and countQuickSort respectively by one whenever they call the method swap(). In method mergesort(), increment the variable countMerge by one to count the swaps. Use method swap() to swap the values.