Computer Science This is a codingbat problem. Please answer in Java and do not change the starter code. You have been asked to write the game of tic tac toe. In the first version of the game, we will only be comparing horizontally for a win. A win is determine by all of the elements in a row either being an X or an O. You need to return a String with the winner or TIE if there is no winner. ticTacToe(["X", "O", "O"], ["X", "O", "O"], ["X", "X", "X"]) → "X" ticTacToe(["X", "O", "X"], ["X", "X", "O"], ["O", "O", "O"]) → "O" ticTacToe(["X", "O", "X"], ["X", "X", "O"], ["O", "X", "O"]) → "TIE" public String ticTacToe(String[] top, String[] middle, String[] bottom) { }

C++

Change this code to show strings that help you cast twelve dice. They should be shown one at a time like this:The first one was A. The second one was B. Afterward, the sum should be shown on a different line.

Please help me this I need answer typing clear urjent no chatgpt used i will give 5 upvotes

Scala Programming: Given string str, write a Scala program to create a new string where "Scala " is added to the front of a given string. If the string already begins with "Scala", return the string unchanged. Otherwise, return the string after adding "Scala ". Test the function for two strings "Scala Programming" and "Programming" inside the main method.

String spell = "Redikulus"; How would you find the index of the 'u' just before the last 's' using a single line of code? Multiple answers may be correct. Given the string String spell = "Redikulus"; How would you find the index of the 'u' just before the last 's' using a single line of code? Multiple answers may be correct. A. spell.substring(5, spell.length()).indexOf('u'); B. spell.indexOf('u', 5); C. spell.lastIndexOf('u'); D. spell.contains('u'); E. spell.indexOf('u', spell.length() - 2); F. spell.indexOf('u', spell.indexOf('l'));

For any element in keysList with a value greater than 50, print the corresponding value in itemsList, followed by a comma (no spaces). Ex: If the input is: 32 105 101 35 10 20 30 40 the output is: 20,30, 1 #include 2 3 int main(void) { const int SIZE_LIST = 4; int keysList[SIZE_LIST]; int itemsList[SIZE_LIST]; int i; 4 6 7 8 scanf("%d", &keysList[0]); scanf ("%d", &keysList[1]); scanf("%d", &keysList[2]); scanf("%d", &keysList[3]); 10 11 12 13 scanf ("%d", &itemsList[0]); scanf ("%d", &itemsList[1]); scanf("%d", &itemsList[2]); scanf ("%d", &itemsList[3]); 14 15 16 17 18 19 /* Your code goes here */ 20 21 printf("\n"); 22 23 return 0; 24 }

Practice / Frequency of Characters Write a method that returns the frequency of each characters of a given String parameter. If the given String is null, then return null If the given String is empty return an empty map Example input: output: empty map explanation: input is empty Example input: null output: null explanation: input is null. Since problem output is focused on the frequency we can comfortably use Map data structure. Because we can use characters as key and the occurrences of them as value. Example input: responsible output: {r=1, e=2, s=2, p=1, o=1, n=1, i=1, b=1, l=1} explanation: characters are keys and oc values ences are

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 = []...

Can you annotate this code. cars = ["Buick","Ford","Honda"]colors = ["Red","Blue","Black","White","Green"]aType = ["Sedan","SUV","Sports","Coupe","Truck"]arr = [[0 for i in range(len(cars))] for j in range(len(cars)*len(colors))]for i in range(0, len(colors)*len(cars)):for j in range(0, len(cars)):if j == 0:arr[i][j] = cars[int(i/5)]if j == 1:arr[i][j] = colors[int(i % 5)]if j == 2:arr[i][j] = aType[int(i % 5)]for i in range(0, len(arr)):print(arr[i])

please name this cards.py. You may use the following code in your program: import random SUITS = "♠ ♡ ♢ ♣".split()RANKS = "2 3 4 5 6 7 8 9 10 J Q K A".split() def create_deck(shuffle=False): """Create a new deck of 52 cards""" deck = [(s, r) for r in RANKS for s in SUITS] if shuffle: random.shuffle(deck) return deck This code creates a random deck of cards (each card is a tuple consisting of a rank and suit). You are to ask the user how many 5-card hands to play and will keep track of the following poker hands. You will need to reshuffle the deck as many times as necessary to get the required number of hands. An example run of the program is as follows. Enter the number of hands to deal: 10000Hand % of Hands Hands of Type2 of a kind 41.290% 4129 3 of a kind 1.970% 197 4 of a kind 0.010% 1 2 pair 4.860% 486 Full house 0.150% 15 Flush 0.220% 22 If you deal enough...

Find the body for: def contains_no_lowercase_vowels(phrase: str) -> bool: """Return True iff (if and only if) phrase does not contain any lowercase vowels. >>> contains_no_lowercase_vowels('syzygy') True >>> contains_no_lowercase_vowels('e') False >>> contains_no_lowercase_vowels('abc') False """

weights = []for i in range(1, 5): weight = float(input(f"Enter weight {i}: ")) weights.append(weight)# Output the list of weightsprint(f"Weights: {weights}")print()# Calculate and output the average of the weightsaverage_weight = sum(weights) / len(weights)print(f"Average weight: {average_weight:.2f}")print()# Find and output the maximum weight in the listmax_weight = max(weights)print(f"Max weight: {max_weight:.2f}")print()# Prompt the user to enter a location in the list and output the weight at that location in pounds and kilogramslocation = int(input("Enter a list location (1 - 4): "))weight_pounds = weights[location - 1]weight_kilograms = weight_pounds / 2.2print(f"Weight in pounds: {weight_pounds:.2f}")print(f"Weight in kilograms: {weight_kilograms:.2f}")print()# Sort the list and output the sorted listweights.sort()print(f"Sorted list: {weights}")