: Given a sorted array of strings that is interspersed with empty strings, write a method to find the location of a given string. EXAMPLE Input: ball, {"at", ""} Output: 4

Write a loop that counts how many elements in an array are equal to zero. arrays.cpp 1 #include // sizet 2 int countZeros (const int values[], size_t size) { int count = 0; 3 4 for (int i; i using namespace std; 3 2 4 int countZeros(const int values[], size_t size); 5 int main() { int a[] = {1, 2, 0, 3}; cout <« countZeros (a, 4) <« endl; cout « "Expected: 1" « endl; 6 7 8 9 10 11 int b[] = {0, 2, 0, 3}; cout <« countZeros (b, 4) <« endl; cout « "Expected: 2" « endl; 12 13 14 15 int cl] -{1, 0, θ, 0, 0 ; cout <« countZeros (c, 5) <« endl; cout « "Expected: 4" « endl; 16 17 18 19 } CodeCheck Reset Testers Running Tester.cpp pass fail fail 1 Expected: 1 Expected: 2 Expected: 4 Score 1/3

1. Given a string of at least 3 characters as input, if the length of the string is odd return the character in the middle as a string. If the string is even return the two characters at the midpoint.   public class Class1 {    public static String midString(String str) { //Enter code here } }   -----------   2. Given an array of integers return the sum of the values stored in the first and last index of the array. The array will have at least 2 elements in it   public class Class1 {    public static int endSum(int[] values) { //Enter code here }    }   -----------   3. The method takes a string as a parameter. The method prints treat if the string is candy or chocolate (of any case, such as CaNdY) Otherwise print trick   import java.util.Scanner;   public class Class1 { public static void trickOrTreat(String str) { //Enter code here }    public static void main(String[] args) { Scanner s = new Scanner(System.in); trickOrTreat(s.nextLine()); } }

Write a while loop to read positive integers from input until a non-positive integer is read. For each positive integer read before the non-positive integer, add the positive integer plus five to vector vect1. Ex: If the input is 9 1 2 8 -999, then the output is: 14 6 7 13 Note: Positive integers are greater than 0. 1 #include 2 #include 3 using namespace std; 4 5 int main() { 6 7 8 9 10 11 12 13 14 15 16 17 } vector vect1; int value; int i; V* Your code goes here */ for (i = 0; i < vect1.size(); ++i) { cout << vect1.at (i) << endl; } return 0; I

Write code in assembly language Question 1: Construct a program using 2D array. Define a list of strings in the 2D arrays, the list should be only a string. Get a string from a user as input Search the user's string in the list of strings. If string is found print the string, and a message "String is Found". If string is not found print only a message "String is Not Found".

Question in image Please explain the algorithm with the answer. Python programming

Matich the following statements with the correct data structure by clicking on the drop down arrow and selecting the correct choice.. You need to store a list of elements and the number of elements in the program is fixed. If most of operations on a list involve retrieving an element at a given index. You have to add or delete the elements at the beginning of a list. Linked List ArrayList Array

Write a version of the binary search algorithm that can be used to search a list of strings. (Use the selection sort that you designed to sort the list.)

def findOccurrences(s, ch):     lst = []     for i in range(0, len(s)):         if a==s[i]:             lst.append(i)     return lst Use the code above instead of enumerate in the code posted below. n=int(input("Number of rounds of Hangman to be played:")) for i in range(0,n):     word = input("welcome!")     guesses = ''     turns = int(input("Enter the number of failed attempts allowed:")) def hangman(word):            secrete_word = "-" * len(word)     print(" the secrete word " + secrete_word)         user_input = input("Guess a letter: ")         if user_input in word:         occurences = findOccurrences(word, user_input)         for index in occurences:             secrete_word = secrete_word[:index] + user_input + secrete_word[index + 1:]         print(secrete_word)     else:         user_input = input("Sorry that letter was not found, please try again: ")   def findOccurrences(s, ch):     return [i for i, letter in enumerate(s) if letter == ch]  *** enumerate not discussed in…

Java Task Write a for loop that prints the characters stored in a String object backward. The String is entered by the user.  ***Use ch = phrase.charAt(i); to get the character that is in index i of the String phrase.**** For example The user enters “Good morning!” The printout should be “!gninrom dooG”.