Use python only and show the code of your IDE. You are given two arrays: Array1 andArray2.Array1 will be sorted. For each elementv in Array2, you need to write apseudocode that will print the numberof elements in Arr1 that is greater thanor equal to v and the element mustbe a prime number. For example: if Igive you two arrays of size 5 and 45 4 [size of two arrays]Arri = 13579Arr2 = 6 4 8The output should be: 12 oThere are two parts in the question.First you need to know how manynumbers are there in Array1 which aregreater than 6. Here, we find there aretwo numbers (7,9). Then we need tofind whether these numbers are primeor not. The searching portion must nottake more than O(log n) time.Sample inputSample output552311137 10 12 1761 14 8 9

Actually, python is a easiest programming language. It is a dynamically typed programming language.

You are given two arrays: Array1 and Array2. Array1 will be sorted. For each element v in Array2, you need to write a pseudocode that will print the number of elements in Arr1 that is greater than or equal to v and the element must be a prime number. For example: if I give you two arrays of size 5 and 4 54 [size of two arrays] Arri = 13579 648 The output should be: 12 o Arr2 = There are two parts in the question. First you need to know how many numbers are there in Array1 which are greater than 6. Here, we find there are two numbers (7,9). Then we need to find whether these numbers are prime or not. The searching portion must not take more than O(log n) time. Sample input Sample outpu 55 37 10 12 17 6114 8 9 23111

You are given two arrays: Array1 and Array2. Array1 will be sorted. For each element v in Array2, you need to write a pseudocode that will print the number of elements in Arr1 that is greater than or equal to v and the element must be a prime number. For example: if I give you two arrays of size 5 and 4 54 [size of two arrays] Arri = 13579 648 The output should be: 12 o Arr2 = There are two parts in the question. First you need to know how many numbers are there in Array1 which are greater than 6. Here, we find there are two numbers (7,9). Then we need to find whether these numbers are prime or not. The searching portion must not take more than O(log n) time. Sample input Sample outpu 55 37 10 12 17 6114 8 9 23111

EBK JAVA PROGRAMMING

9th Edition

ISBN:9781337671385

Author:FARRELL

Publisher:FARRELL

Chapter8: Arrays

Section: Chapter Questions

Problem 9PE

See similar textbooks

Similar questions

Problem2 Write a program that display the position of a given element in an array. You should print the index (i.e. the position) of the element. If the element appears more than one time than you should print all its positions. The size of the array should be entered by the user. If the element does not occur then you should display element not found. Sample1: Enter the size of the array: 5 Enter an array of size 5: 44 5 13 44 67 Enter the element to find: 44 44 is found at position 44 is found at position 44 occurs 2 time(s) Sample2: Enter the size of the array: 4 Enter an array of size 4: 12 150 17 20 Enter the element: 18 18 is not found
In C++Monkey Business A local zoo wants to keep track of how many pounds of food each of its three monkeys eats each day during a typical week. Write a program that stores this information in a two-dimensional 3 × 5 array, where each row represents a different monkey, and each column represents a different day of the week. The program should first have the user input the data for each monkey. Then, it should create a report that includes the following information: Average amount of food eaten per day by the whole family of monkeys. The least amount of food eaten during the week by any one monkey. The greatest amount of food eaten during the week by any one monkey. Write functions: average() least() greatest() main()
___5___. You are given an array of strings arr. A string s is formed by the concatenation of a subsequence of arr that has unique characters. Return the maximum possible length of s. A subsequence is an array that can be derived from another array by deleting some or no elements without changing the order of the remaining elements. Example 1: Input: arr = ["un","iq","ue"] Output: 4 Explanation: All the valid concatenations are: - "" - "un" - "iq" - "ue" - "uniq" ("un" + "iq") - "ique" ("iq" + "ue") Maximum length is 4. Question is here to solve------.
GIven the statement below: intA=(3,6,9}, A.length can't be used to display the number of elements in the array True False
Payroll System In this lab, you're going to be working with partially filled arrays that are parallel with each other. That means that the row index in multiple arrays identifies different pieces of data for the same person. This is a simple payroll system that just calculates gross pay given a set of employees, hours worked for the week and hourly rate. Parallel Arrays First, you have to define several arrays in your main program: 1. employee names for each employee 2 hourly pay rate for each employee 3. total hours worked for each employee 4. gross pay for each employee Second, you will need a two dimension (2-D) array to record the hours worked each day for an employee. The number of rows for the 2-D array should be the same as the arrays above since each row corresponds to an employee. The number of columns represents days of the week (7 last I looked). Functions Needed In this lab, you must read in the employee names first because this identifies how many elements will be in each…
In C++ Programming Lanaguage write a program that simulates the rolling of two dice. The sum of the two values should then be calculated. Your program should roll the two dice 36,000,000 times. Use a one-dimensional array to tally the numbers of times each possible sum appears and print it. Also, determine if the totals are reasonable (i.e., there are six ways to roll a 7, so approximately one-sixth of all the rolls should be 7). [Hint: what is the minimum and maximum sum obtained when you roll a die? Some sums are more frequent than the others.]
Q1_____Given an array nums containing n distinct numbers in the range [0, n], return the only number in the range that is missing from the array. Example 1: Input: nums = [3,0,1] Output: 2 Explanation: n = 3 since there are 3 numbers, so all numbers are in the range [0,3]. 2 is the missing number in the range since it does not appear in nums...!!!
Integer numElements is read from input and represents: • The number of elements in each array. • The number of pairs of integers read from input. Declare two integer arrays, roomIds and serviceFees. Then, read each pair of integers from input. For each pair read, store the first integer into roomlds and the second integer into serviceFees. Ex: If the input is: 3 2 50 4 25 8 40 then the output is: Room id: 2, Fees: $50 Room id: 4, Fees: $25 Room id: 8, Fees: $40 1 import java.util.Scanner; 2 3 public class Cash Records { 4 5 6 8 9 10 11 12 13 14 15 16 17} public static void main(String[] args) { Scanner scnr= new Scanner (System.in); int numElements; int i; numElements = scnr.nextInt (); /* Your code goes here */ for (i = 0; i < numElements; ++i) { System.out.println("Room id: " + roomIds[i] + ", Fees: $" + serviceFees[i]); }
Look at the following array definition: String[ ] sArray = new String[3]; a. What will be returned by sArray.length when printed to screen b. What subscript should be used to access the last element in this array? c. Can we save integer elements in this array?
1. Create an array named arr1 with 20 random numbers between 1 and 10(inclusively). Then produce a new array arr2 based on arr1 as follows: arr2 has the same length as arr1. In arr2, each element is the sum of the corresponding element in arr1 and the previous element of arr1, except the first number in arr2 equals the first number in arr1. For example, If arr1 has the elements: Then arr2 will be: 2 5 19 3 7 6... 2 7 6 10 12 10 13... Please display the two arrays.
You have an array with non-repeating elements. You need to find the second maximum number Input: 7 9 5 4 7 1 3 0 Output: 7 Note: 9 is the maximum. But you need to find the second largest '7' number from the array
An array definition reserves space for the array. true or false