Rewrite this java method in SWIFT and GO languages static int[][] ordered2DArray(int row, int col){return Intstream.range (0, row).mapToobj(x-> Intstream.range (x*10, x*10+col) .toArray()). toArray (int[]::new);}

Given: Rewrite this java method in SWIFT and GO languages

Answered: Rewrite this java method in SWIFT and…

Engineering

Computer Science

Rewrite this java method in SWIFT and GO languages

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

Integer dataSize is read from input. Then, strings and integers are read and stored into string vector subjectList and integer vector pageList, respectively. Lastly, integer pageThreshold is read from input. Set matchCount with the number of element pairs with a page greater than or equal to pageThreshold. Output the subject of each pair found with a page greater than or equal to pageThreshold. End with a newline. Ex: If the input is: 3 Environment 416 Cooking 353 Science 306 349 Then the output is: Environment Cooking Total: 2 By using the following code: #include #include using namespace std; int main() { int numElements; int pageThreshold; int matchCount; unsigned int i; cin >> numElements; vector subjectList(numElements); vector pageList(numElements); for (i = 0; i < subjectList.size(); ++i) { cin >> subjectList.at(i); cin >> pageList.at(i); } cin >> pageThreshold; /* Your code goes here */ cout << "Total: " << matchCount;…
THE QUESTION IS ATTACHED: PLEASE AVOID USING import java.util.ArrayList; import java.util.HashMap; import java.util.Map; BECAUSE I HAVEN'T STUDIED THEM YET, YOU CAN USE 1D AND 2D ARRAYS. YOU ARE FREE TO USE import java.io.File; import java.io.FileNotFoundException; import java.io.FileWriter; import java.io.IOException; EFFECTIVELY USE LOOPS AND CONTROL STATEMENTS. TXT. FILE IS INCLUDED BELOW: MOVIE NAME, MOVIE YEAR, RATING AND GENRE. The Martian2015Adventure8.0Murder on the Orient Express2017Crime6.5X-Men: First Class2011Action7.7X-Men: Days of Future Past2014Action7.9This Means War2012Action6.3Godzilla vs. Kong2021Adventure6.5Black Widow2021Action7.5Zack Snyder's Justice League2021Action8.1The Ten Commandments1956Drama7.9The Father2020Drama8.3Nobody2021Crime7.5Promising Young Woman2020Crime7.5What Lies Below2020Horror4.4Shrine2021Horror5.1Bram Stoker's Dracula1992Horror7.4
What are the advantages of using a link list instead of an array?
Please do not give solution in image format thanku USING JAVA Modify the code to use Arraylist Instead of HashmapCODE:import java.util.ArrayList;import java.util.HashMap;import java.util.List;import java.util.Map;class Student {private String name;private List<String> certificates;public Student(String name) {this.name = name;this.certificates = new ArrayList<>();}public void addCertificate(String certificate) { certificates.add(certificate);}public boolean hasCertificate(String certificate) {return certificates.contains(certificate);}public String getName() {return name;}}public class CertificateManagement {public static void main(String[] args) { Map<String, Student> students = new HashMap<>();Student student1 = new Student("John");student1.addCertificate("Java");student1.addCertificate("Python");students.put("John", student1);Student student2 = new Student("Alice");student2.addCertificate("C++");students.put("Alice", student2);Student student3 = new…
THE QUESTION IS ATTACHED: PLEASE AVOID USING import java.util.ArrayList; import java.util.HashMap; import java.util.Map; BECAUSE I HAVEN'T STUDIED THEM YET, YOU CAN USE 1D AND 2D ARRAYS. YOU ARE FREE TO USE import java.io.File; import java.io.FileNotFoundException; import java.io.FileWriter; import java.io.IOException; EFFECTIVELY USE LOOPS AND CONTROL STATEMENTS. ALSO TRY AND CATCH. TXT. FILE IS INCLUDED BELOW: MOVIE NAME, MOVIE YEAR, RATING AND GENRE. The Martian2015Adventure8.0Murder on the Orient Express2017Crime6.5X-Men: First Class2011Action7.7X-Men: Days of Future Past2014Action7.9This Means War2012Action6.3Godzilla vs. Kong2021Adventure6.5Black Widow2021Action7.5Zack Snyder's Justice League2021Action8.1The Ten Commandments1956Drama7.9The Father2020Drama8.3Nobody2021Crime7.5Promising Young Woman2020Crime7.5What Lies Below2020Horror4.4Shrine2021Horror5.1Bram Stoker's Dracula1992Horror7.4
code: public class PasswordGeneratorAndStorage {/*** Adds an application to the applications ArrayList. If index is -1, add application* to the end of applications. Else is index is within the size of applications, add* application at that index in applications. Otherwise, return. However, if applications * or application is null, return.* * @param applications* @param application* @param index*/public static void addApplication(ArrayList<String> applications, String application, int index) {// TODO: FILL IN BODY}/*** Generates a random password of length passwordLength and adds it to the end of* passwords if index is -1, or adds it to the index of passwords if index is within the* size of passwords (similar to how the addApplication adds an application). To generate* the random password, use rand to generate a random int within the size of characters. You* can then use this int to grab the char at that index in characters and concatenate that* to your String password variable.…
public class testRun{public static int find(int[] data, int target,int start, int end) {int[] stored = sort(data);if (start <= end) {int midPoint = (start + end / 2);if (stored[midPoint] == target) {return midPoint;}if (stored[midPoint] > target) {return find(data, target, start, midPoint - 1);//return first half,exclusive itself}if (stored[midPoint] < target) {return find(data, target, start, midPoint + 1);//return last half,exclusive itself.}}return -1;}public static int[] sort(int[] data){// Find the smallest element in the listfor (int i = 0; i < data.length -1 ; i++){ //generate the index position,not =< b/c goes outer boundint min = i; //assign index position to min in each iterationfor (int j = i + 1; j < data.length ; j++){if (data[j] < data[min]){ //if the element in the second index number smaller than// the element in previous index numbermin = j; // assign j to the smallest number}}swap (data,i,min);// data[i] = min the smallest number assign to…
2. Using the Hashtable class, write a spelling checker program that readsthrough a text file and checks for spelling errors. You will, of course, haveto limit your dictionary to several common words.3. Create a new Hash class that uses an arraylist instead of an array for thehash table. Test your implementation by rewriting (yet again) the computerterms glossary application.
Java Program ASAP Please modify Map<String, String> morseCodeMap = readMorseCodeTable("morse.txt"); in the program so it reads the two text files and passes the test cases. Down below is a working code. Also dont add any import libraries in the program just modify the rest of the code so it passes the test cases. import java.io.BufferedReader;import java.io.FileReader;import java.io.IOException;import java.util.HashMap;import java.util.Map;import java.util.Scanner;public class MorseCodeConverter { public static void main(String[] args) { Map<String, String> morseCodeMap = readMorseCodeTable("morse.txt"); Scanner scanner = new Scanner(System.in); System.out.print("Please enter the file name or type QUIT to exit:\n"); do { String fileName = scanner.nextLine().trim(); if (fileName.equalsIgnoreCase("QUIT")) { break; } try { String text =…
Write an application in java language using a hash table that finds all the pairs of two integers within the below array that add up to 12. Array = {4,9,6,13,5,3,2,8}
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 enough
Computer Science Within a Java class, write a method that creates n random strings of length 10 and inserts them in a hash table. The method should compute the average time for each insertion. provide code and output.