translate this peace of java into php please? public static Movie[] getPG(Movie[] mov) { Movie[] pgMov = new Movie[mov.length]; int newArrayIndex = 0; for (int i = 0; i < mov.length; i++) { if (mov[i].rating.equals(“PG”)) { pgMov[newArrayIndex] = mov[i]; newArrayIndex++; } } return pgMov; }
Q: I want is, from the code I've given, I want the program to perform the same but using…
A: It is defined as programs can be asked from control statements, array, string, oops etc. Java basic…
Q: Write a client program that loops around getting two fractions from the user,output their sum, and…
A: Program code: Fraction.java //Define the class Fractionpublic class Fraction { // declaring instance…
Q: In the Java class MatrixHelix, implement the method int[][] helix(int[][]) that returns a matrix of…
A: Required: In the Java class MatrixHelix, implement the method int[][] helix(int[][]) that returns a…
Q: Write a method called average that accepts an array list of floating point numbers and returns their…
A: One Java method is asked which can return an average of an ArrayList of floating numbers.
Q: Show the expected output of the following program: package ch09.apps; import ch09.priorityQueues. *;…
A: See the expected output for above code in second step.
Q: Develop a program in Java to demonstrate the operations of a Hash Table. Use the following class…
A: The code is below:
Q: IN PYTHON-Suppose that you leave your dog in the middle of a large city whose streets form a…
A: Answer: I have done code and also I have attached code as well as code screenshot .
Q: You will write a library of static methods that performs various geometric transforms on polygons.…
A: Here is the Required Code for the following purpose. In the main function, all the statements for…
Q: IN JAVA Write a method that accepts two integer parameters rows and cols. The output is a…
A: In this problem, we need to design the Java program that will be able to solve the mentioned…
Q: IN JAVA Write a method that accepts two integer parameters rows and cols. The output is a…
A: Algorithm - Take one string as input. Now use the below logic for (int i=1; i<=r; i++) for…
Q: Write a method that takes a String array and an integer as parameters and prints the Strings in the…
A: Use length() method available in String class to find the length of string and then compare this…
Q: In java, Implement a method that removes all duplicates. Keep the first instance of the element but…
A: Given files: Demo6.java public class Demo6 { public static void main(String[] args) {…
Q: Write a method named getSquares which takes an integer array and returns a new integer array of the…
A: 1) Find number of element in input array 2) Create new array of length n 3) Iterate over input array…
Q: Write a method that sums all the numbers in the major diagonal in an n x n matrix of double values…
A: Note: The below program has been complied and executed in NetBeans IDE 8.2
Q: One of the following is a valid for-loop syntax to iterate through the elements of a HashMap:…
A: Option - In foreach loop, an entry is a word missed after the string parameter in the specified line…
Q: Write a java application that stores the number of food stocks in a supermarket, particularly, we…
A: We need to create a public class Super Market, we had initialized a static array with the given…
Q: What will be the output of the following Java program? class Output { public…
A: GIVEN: What will be the output of the following Java program? class Output {…
Q: I need to write a program called Table.Java that takes a command-line argument N and prints a table…
A: import java.util.Scanner; import java.lang.*; /* Program By Ghanendra Yadav Visit…
Q: You have a card on which the letter J is written on one side and K on the other. You want to see all…
A: The program illustrate a recursive function in java with a simple card problem as given in the…
Q: do you separate a string into ArrayLists of Integers, Strings, and Doubles in Java; for example,…
A: We can separate only integers and strings from strings because in double values there is the point…
Q: write, in Java, a method that runs in Θ(N2logN) time complexity. It doesn't matter what gibberish…
A: Note: since you have asked to provide method whose time complexity is Θ(N2logN). we have provide…
Q: In Java, consider the following declaration. double[] list = new double[75]; Which of the…
A: Here we have an array whose size is initialized to 75. This array will store 75 elements in the…
Q: Write a method called samePosition in a class called stackExt that receives two parameters st1 and…
A: ArrayStack is a class which holds collection of Integer objects <Integer> wrapper class used…
Q: A Java Program Write a method called samePosition in a class called StackExt that receives two…
A: Write a method called samePosition in a class called StackExt that receives two parameters st1 and…
Q: Analyse the case study given in chapter 3 Linked list Answer the following questions from…
A: 1. The different class names with class keyword 2. The different methods using public and private…
Q: package Bned; import java.util.HashMap; import java.io.*; public class CardPointsList { static…
A: import java.util.HashMap;import java.io.*;public class CardPointsList { static…
Q: Write a method that returns the index of the smallest element in an array of doubles. The method…
A: As given, I need to write a Java program having a method that should receive an array for formal…
Q: Given marks of 10 students in a class, write a program in PHP to print the least three marks in…
A: Here I have created an array with name marks and stored the values given in the question. Next, I…
Q: • Write a JAVA program to build an appropriate implementation for the UML diagram below, which…
A: Given: Write a JAVA program to build an appropriate implementation for the UML diagram below, which…
Q: Write a static recursive method in Java called mrecursiv that displays all of the permutations of…
A: PROGRAM INTRODUCTION: Start definition of utility function to swap two characters in a character…
Q: public class Soru32 { // Returns length of LCS for X[0..m-1], Y[0..n-1] static void…
A: Algorithm Name:- Longest Common Subsequence
Q: In python Tuples can contain elements mixed from different types. True or false?
A: Python is an interpreted program, object-oriented language, high-level programming language with…
Q: The popularity of a combination is the number of frosh selecting exactly the same combination of…
A: In this question, we are asked to write a java program which check the combinations of matrix and…
Q: Write a method in Java called largestAbsVal that accepts three integers as parameters and returns…
A: Introduction: In this question, we are asked to write a JAVA program to return the maximum absolute…
Q: Purpose To review threads in Java. Threading Divisors Directions and Example: A divisor is a number…
A: According to the information given:- we have to follow the instruction mentioned and modify the code…
Q: Requirements: Use Java Programming only. Show screenshots of your work. 6. Write…
A: Since you have asked multiple question, we will solve the first question for you. If you want any…
Q: I'm developing a card game that requires one deck of 52 cards using Java. The 52 card has 4 suits…
A: A HashMap is a list that contains a key and a value for that key. For a given key, the value can be…
Q: Exception in thread "main" java.lang.Error: Unresolved compilation problem: at…
A: The code works just fine if the Class name is replaced with Main, as it is showing that the main…
Q: import java.util.HashMap; import java.io.*; public class CardPointsList { static HashMap Code =…
A: It is defined as A "standard" deck of playing cards consists of 52 Cards in each of the 4 suits of…
Q: What is the time complexity and pseudocode of the above algorithm?
A: The best option to do the comparison of the algorithms would be to express or indicate the running…
Q: Write a Java method that returns the sum of all even Fibonacci numbers. Consider all Fibonacci…
A: Fibonacci series is a series in which the element is the sum of the previous two element of the…
Q: IN JAVA Write a method that accepts two integer parameters rows and cols. The output is a…
A: In this problem, we need to design the Java program that will be able to solve the mentioned…
Q: I need a help in making a method that will Input a text that will be converted to Huffman code and…
A: Above code is right only we changes ; public class Huffman=> we use only…
Q: Write a program that reads a list of integers, and outputs whether the list contains all multiples…
A: Hey there, I am writing the required solution of the above stated question.Please do find the…
Q: Write a program Calculator.java. Instead of using integers, use rationals, as shown in Figure .You…
A: Programming approach: Create a class Calculator that extends Number and implements…
Q: developing a card game that requires one deck of 52 cards using Java. The 52 card has 4 suits from…
A: It is defined as programs can be asked from control statements, array, string, oops etc. Java basic…
Q: A new deadly virus has infected large population of a planet. A brilliant scientist has discovered a…
A: So as per the question logic for code should be, vaccine count of midichlorains will be higher than…
Q: Java please, Write a program that reads a list of words. Then, the program outputs those words and…
A: The question asks for reading an input of a list of words and finding the frequency of each word in…
Q: ListInterface
A: java please Create a method for the client perspective to determine if a ListInterface has the…
Q: Write a Java program that includes in its class the following methods: - A method named unitMatrix…
A: Input Program :- class Solution1{ static void unitMatrix(int n)//method { int…
Could anyone translate this peace of java into php please?
public static Movie[] getPG(Movie[] mov) {
Movie[] pgMov = new Movie[mov.length];
int newArrayIndex = 0;
for (int i = 0; i < mov.length; i++) {
if (mov[i].rating.equals(“PG”)) {
pgMov[newArrayIndex] = mov[i];
newArrayIndex++;
}
}
return pgMov;
}
Thank you :)
Step by step
Solved in 2 steps with 1 images
- void getInput(){for(int i =0; i < studentName.length; i++){System.out.print("Student name: ");studentName[i] = keyboard.nextLine();System.out.print("Studnet ID: ");midTerm1[i] = keyboard.nextInt();}keyboard.close();} Can't put full student name becuase nextLine();C++ A robot is initially located at position (0; 0) in a grid [?5; 5] [?5; 5]. The robot can move randomly in any of the directions: up, down, left, right. The robot can only move one step at a time. For each move, print the direction of the move and the current position of the robot. If the robot makes a circle, which means it moves back to the original place, print "Back to the origin!" to the console and stop the program. If it reaches the boundary of the grid, print \Hit the boundary!" to the console and stop the program. A successful run of your code may look like:Down (0,-1)Down (0,-2)Up (0,-1)Left (-1,-1)Left (-2,-1)Up (-2,0)Left (-3,0)Left (-4,0)Left (-5,0)Hit the boundary! or Left (-1,0)Down (-1,-1)Right (0,-1)Up (0,0)Back to the origin! About: This program is to give you practice using the control ow, the random number generator, and output formatting. You may use <iomanip> to format your output. You may NOT use #include "stdafx.h".public void OnSend(View v){ String phoneNumber = number.getText().toString(); String smsmessage = message.getText().toString(); if(phoneNumber == null || phoneNumber.length() == 0 || smsmessage == null || smsmessage.length() == 0){ return; } if(checkPermission(Manifest.permission.SEND_SMS)){ SmsManager smsManager = SmsManager.getDefault(); smsManager.sendTextMessage(phoneNumber, null, smsmessage, null, null); Toast.makeText(this, "Message sent", Toast.LENGTH_SHORT).show(); } Question 2: Explain the following code: button.setOnClickListener(new View.OnClickListener() { @Override public void onClick(View v) { FragmentManager fm = getSupportFragmentManager(); FragmentTransaction ft = fm.beginTransaction(); XFragment xfragment = new XFragment(); ft.add(R.id.Main_fragment, xfragment);…
- int binsearch (int X , int V [] , int n ) { int low , high , mid , i ; low = 0; high = n - 1; for ( i = 0; i < high ; i ++) { if( V[ i ] > V [ i +1]) return -2; } while ( low <= high ) { mid = ( low + high )/2; if ( X < V [ mid ]) high = mid - 1; else if ( X > V [ mid ]) low = mid + 1; else return mid ; } return -1; } This code takes as input a sorted array V of size n, and an integer X, if X exists in the array it will return the index of X, else it will return -1. 1. Draw a CFG for binsearch(). 2. From the CFG, identify a set of entry–exit paths to satisfy the complete statement coverage criterion. 3. Identify additional paths, if necessary, to satisfy the complete branch coverage criterion. 4. For each path identified above, derive their path predicate…Consider the following function: public void bSearch(int[] A, int value, int start, int end) { if (end value) { return bSearch(A, value, start, mid); } else if (value > A[mid]) { return bSearch(A, value, mid+1, end); } else { return mid; } } The mutation program P' changes the part as shown below. } else if (value > A[mid]) { return bSearch(A, value, mid+2, end); } else { return mid; } A test input is given t1: {A = [2, 3, 5, 7, 10, 11], value = 6, start=0, end=5}. Which statement below best describes the mutant with regards to the test input? O a. t1 resolves mutant P O b. The mutant P' with regards to test input t1 is live.Consider the following code fragment: static int f(int[ ] arr, int x ) { int start = 0; int end - arr.length -13; int mid; while(start x) { end - mid-1; } else { return mid; } } return -1; } Give the worst case big-O cost where the length of the array is N. O O(N^2) O (1) O 0(2^N) O O(logN) O(N)
- Code: public class RURottenTomatoes { public static void main (String[] args) { int r = Integer.parseInt(args[0]); int c = Integer.parseInt(args[1]); for ( int i = 0; i < args.length; i++ ) { int[][] array = new int[r][c]; } String input = args[0]; int n = input.length(); String temp; int arrayR = r; int arrayC = c; for ( int i = 0; i < r; i++ ) { temp = input.substring( i, i + 1 ); arrayR = arrayR + Integer.parseInt(temp); for ( i = 0; i < c; c++ ) { temp = input.substring( i + 1, i + 2 ); arrayC = arrayC + Integer.parseInt(temp); } } } } I did all this, but then stuck. I have no idea what to do next, and I think my code is wrong. Can you help me out doing this assignment? Please explain everything that you do clearly! The instructions are below: RU Rotten Tomatoes. Write program RURottenTomatoes.java that creates a 2 dimensional integer array of movie ratings from the command line arguments and displays the index of the movie that has the highest sum of ratings.…Subject: Object Oriented PrgrammingLanguage: Java ProgramTopic: Exception (SEE ATTACHED PHOTO FOR THE PROBLEM) Initial code:public class Matrix{ private int matrix[][]; public Matrix(){} public Matrix(int row, int column){ matrix = new int[row][column]; } //your methods here}a) FindMinIterative public int FindMin(int[] arr) { int x = arr[0]; for(int i = 1; i < arr.Length; i++) { if(arr[i]< x) x = arr[i]; } return x; } b) FindMinRecursive public int FindMin(int[] arr, int length) { if(length == 1) return arr[0]; return Math.Min(arr[length - 1], Find(arr, length - 1)); } What is the Big-O for this functions. Could you explain the recurisive more in details ?
- void ExtractMinimumWeightPath(int path[MAX], int weights[MAX][MAX], int pathWeights[MAX][MAX], int rowc, int colc){int rowsCount = rowc;int colsCount = colc;path[rowsCount];int col = 0;int i = 0;for(i=1;i<colsCount;i++){if(pathWeights[rowsCount-1][i]<pathWeights[rowsCount-1][col]){col = i;}} int row = rowsCount-1;do{path[row] = col + 1;if (col>0 && pathWeights[row-1][col-1] + weights[row][col] == pathWeights[row][col]){col = col - 1;} else if (col < colsCount-1 && pathWeights[row-1][col+1] + weights[row][col] == pathWeights[row][col]){col = col + 1;}row--;} while(row>0);path[0] = col + 1;} This is a code in C, I need to change the code as much as possible, but on condition to perform the same work as this. Changing the var names and the loops is enoughinhinclude Rsing namespace std; int maxResult( ) int maxVal for (int i { for (int j = 0; j <= n 0; i <= n; i += a) i; j += b) %3D %3D float z = (float)(n (i + j)) / (float)(c); if (floor(z) { int x = int y ceil(z)) i / a; j/ b; maxVal = max(maxVal, x + y (int)z); return maxVal; } int main() { max cout << maxResult( ); return 0; 1 } Input Compilation failed due to fellowing ons main.cpp:7:23: error: 'n' was not declared in this scope 7| for (int i = 0; i <= n; i a) main.cpp:7:31: error: 'a was not declared in this scope for (int i = 0; i <= n; i t= a) %3D main.cpp:9:36: error: b' was not declared in this scope | 6 for (int j = 0; j <= n - i; j - b) %3D main.cpp:11:45: error: 'c was not declared in this scopepublic class ArrayMerge { static void arrayMerge(int a[], int b[]){ int c[] = new int[50]; int k = 0; for(int i = 0; i < a.length; i++) { c[k++] = a[i]; } for(int i = 0; i < b.length; i++) { c[k++] = b[i]; } for(int i = 0; i < k; i++) { System.out.println(c[i]); } } public static void main(String[] args) { int a[] = { 18, 36, 41, 78, 56 }; int b[] = { 10, 37, 44 }; arrayMerge(a,b); } } Calculate the algorithm step number and algorithm time complexity of the above program?