can you please show me how exactly i should change the code in order for it to run? def wordtomorse(words):/* 1.py/* 12.pyMcode ={"%3D%3D*2.py"-.."}%3D/*2m.py/* ASS1.pyconverted={}9./* assg1 219283610for i in words:code = .for j in i. lower():code += Mcode [ord(j)-97]11/* assg2_219283612/* assg3_219283613/* class27.py14if code not in converted:15.16converted [code]=0return len(converted)/* feb9.py/* forloop.py1718/* hellow.py19/* helloworld.py2021words=["ab","a","ems"]/* hw.py22/* importturtle.py23print(wordtomorse(words))24/* march7.py25/* midterm_219282627/* my.py28/* print ("hello wo2930/*te.py313233343536373839File "/Users/foramodedara/Desktop/i2p/assg3_219283662.py", line 17, in wordtomorsecode + Mcode [ord(j)-97]KeyError: 0Forams-MacBook-Pro:12p foramodedara$ python3 assg3_219283662.pyTraceback (most recent call last):File "/Users/foramodedara/Desktop/i2p/assg3_219283662.py", line 23, in print (wordtomorse(words))File "/Users/foramodedara/Desktop/i2p/assg3_219283662.py", line 13, in wordtomorsecode + Mcode [ord(j)-97]TypeError: 'set' object is not subscriptableForams-MacBook-Pro:12p foramodedara$2345 678

Here in the function wordtomorse(), we have a set named Mcode. Next, we have iterated over the…

Answered: can you please show me how exactly i…

Engineering

Computer Science

can you please show me how exactly i should change the code in order for it to run?

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

in java Integer numVals is read from input and integer array userCounts is declared with size numVals. Then, numVals integers are read from input and stored into userCounts. If the first element is less than the last element, then assign Boolean firstSmaller with true. Otherwise, assign firstSmaller with false. Ex: If the input is: 5 40 22 41 84 77 then the output is: First element is less than last element 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 import java.util.Scanner; public class UserTracker { publicstaticvoidmain(String[] args) { Scannerscnr=newScanner(System.in); intnumVals; int[] userCounts; inti; booleanfirstSmaller; numVals=scnr.nextInt(); userCounts=newint[numVals]; for (i=0; i<userCounts.length; ++i) { userCounts[i] =scnr.nextInt(); } /* Your code goes here */ if (firstSmaller) { System.out.println("First element is less than last element"); } else { System.out.println("First element is not less…
class BinaryImage: def __init__(self): pass def compute_histogram(self, image): """Computes the histogram of the input image takes as input: image: a grey scale image returns a histogram as a list""" hist = [0]*256 return hist def find_otsu_threshold(self, hist): """analyses a histogram it to find the otsu's threshold assuming that the input hstogram is bimodal histogram takes as input hist: a bimodal histogram returns: an optimal threshold value (otsu's threshold)""" threshold = 0 return threshold def binarize(self, image): """Comptues the binary image of the the input image based on histogram analysis and thresholding take as input image: an grey scale image returns: a binary image""" bin_img = image.copy() return…
java getDup accepts an array and returns an int. If there is any element is duplicated, the method counts how many of those present in the array. Example : getDup(["1","2","aa"',"1"]) returns:2 ("1" is duplicated and there are two "1"s so return is 2) class Main { public static int getDup(String[] r) { } public static void main(String[] args) { Scanner in = new Scanner(System.in); String [] strs = new String[in.nextInt()]; for(int i=0; i < strs.length; i++) { strs[i] = in.next(); } System.out.println(getDup(strs)); } } hint: you will need a nested array the will run on the array we get from the method argument. inside the nested loop you will need to check if the main array element is equal to the current
in java Integer numVals is read from input and integer array userScore is declared with size numVals. Then, numVals integers are read from input and stored into userScore. Replace the last element in userScore with -1. Ex: If the input is: 4 93 94 9 42 then the output is: Updated scores: 93 94 9 -1
Please help me fix this code Make it run out like the picture import java.util.ArrayList; import java.util.Random; import java.util.Scanner; public class FrogListApp { public static void main(String[] args) { final int MIN_WEIGHT = 1; final int MAX_WEIGHT = 25; // Step 3: Create an array list to store Frog objects ArrayList frogsList = new ArrayList<>(); // Step 4: Create a Scanner object Scanner scanner = new Scanner(System.in); // Step 5: Read an integer as the number of frogs // using prompt "Enter the number of frogs: " System.out.print("Enter the number of frogs: "); int numberOfFrogs = scanner.nextInt(); // Step 6: Read an integer as the random generator seed // using prompt…
Implement in C Program 5.20 LAB: Word frequencies Write a program that reads a list of words. Then, the program outputs those words and their frequencies. The input begins with an integer indicating the number of words that follow. Assume that the list will always contain fewer than 20 words, and each word contains fewer than 10 characters. Ex: If the input is: 5 hey hi Mark hi mark the output is: hey - 1 hi - 2 Mark - 1 hi - 2 mark - 1 Hint: Use two arrays, one array for the strings and one array for the frequencies. #include <stdio.h>#include <string.h> int main(void) { /* Type your code here. */ return 0;}
java: Run length coding is a method to represent a string in a more compact manner. Each character that occurs more than 2 times in a row is represented by the character and a number following it. Two examples are: "abba" → "abba""abcccbbbba" → "abc3b4a"Write a function that calculates how many characters the encoded string is shorter than the original.
For any element in keysList with a value greater than 40, print the corresponding value in itemsList, followed by a semicolon (no spaces). Ex: If the input is: 32 105 101 35 10 20 30 40 the output is: 20;30; import java.util.Scanner; public class Compare { public static void main(String args[]) {final int SIZE_LIST = 4;int[] keysList = new int[SIZE_LIST];int[] itemsList = new int[SIZE_LIST];int i;Scanner input = new Scanner(System.in); keysList[0] = input.nextInt();keysList[1] = input.nextInt();keysList[2] = input.nextInt();keysList[3] = input.nextInt(); itemsList[0] = input.nextInt();itemsList[1] = input.nextInt();itemsList[2] = input.nextInt();itemsList[3] = input.nextInt(); /* Your code goes here */ System.out.println();} }
JAVA - Multi Dimensional Arrays Ask the user for the number of rows and columns of a two-dimensional array and then its integer elements. Print the row number of the row where the sum of all of its elements is even. For this problem, it is guaranteed that there is one and only one row of such case. Row count starts at 0. Input 1. One line containing an integer for the number of rows 2. One line containing an integer for the number of columns 3. Multiple lines containing at least one integer each line for the elements of the array Sample 2 7 4 1 1 2 0 5 0 Output Note that the row number starts at 0, not 1. Enter # of rows: 3 Enter # of columns: 3 Enter elements: 2 7 4 1 1 2 0 5 0 Even row: 1
For any element in keysList with a value smaller than 50, print the corresponding value in itemsList, followed by a space. Ex: If the input is: 32 105 101 35 10 20 30 40 the output is: 10 40 import java.util.Scanner; public class Compare { public static void main(String args[]) { final int SIZE_LIST = 4; int[] keysList = new int[SIZE_LIST]; int[] itemsList = new int[SIZE_LIST]; int i; Scanner input = new Scanner(System.in); keysList[0] = input.nextInt(); keysList[1] = input.nextInt(); keysList[2] = input.nextInt(); keysList[3] = input.nextInt(); itemsList[0] = input.nextInt(); itemsList[1] = input.nextInt(); itemsList[2] = input.nextInt(); itemsList[3] = input.nextInt(); //answer// System.out.println(); } }
in java ecplise . Implement a program that randomly generates 10 integers from -100 to 100,stores them in a 1D array, and finds their maximum value. Calculate theexecution time of finding a maximum. Repeat the test for 10,000 and10,000,000 numbers. Provide your results in the form of a table below andprovide a small summary.
please help me with the following 1) make a sierpenski triangle using java and recursion. Make it similar to the code below. And please comment the code 2) Please make the follow code out put on the console. It a t square fractal import java.awt.image.*;import java.awt.Color;import java.io.*;import javax.imageio.*; public class Main{ static final int DIMENSION = 1000; static BufferedImage image = new BufferedImage(DIMENSION, DIMENSION, BufferedImage.TYPE_INT_RGB); static final int WHITE = Color.WHITE.getRGB(); static final int BLACK = Color.BLACK.getRGB(); private static void drawSquare(int x, int y, int side) { if (side <= 0) return; else { int left = x - side/2; int top = y - side/2; int right = x + side/2; int bottom = y + side/2; for (int i = left; i < right; i++) for (int j = top; j < bottom; j++) { image.setRGB(i, j, BLACK); }…