Assignment #9 will be the construction of a program that reads in a sequence of integers from standard input until 0 is read, and stores them in an array (zero is the sentinel-it is not stored in the array). This is done using iteration (choose while or do-while loop). You may assume that there will not be more than 100 numbers. Then find the maximum number, find the largest even integer, sum of the numbers that are larger than the last number in the array, and count of numbers that are divisible by 3 using recursion. Thus, you will create four recursive methods findMax, largestEven, sumLargerThanLast and countDivisibleBy3 in Assignment9 class and they will be called by the main method. Specifically, the following recursive methods must be implemented (These methods should not contain any loop): public static int findMax(int[] numbers, int startIndex, int endIndex) public static int largestEven(int[] numbers, int startIndex, int endIndex) public static int sumLargerThanLast(int[] numbers, int startIndex, int endIndex, int lastElement) public static int countDivisibleBy3(int[] numbers, int startIndex, int endIndex)

Write a modular program (no classes yet, just from what you learned last year), that allows two players to play a game of tic-tac-toe. use a two-dimensional char array with 3 rows and 3 columns as the game board. each element of the array should be initialized with an asterisk (*). the program should display the initial board configuration and then start a loop that does the following: allow player 1 to select a location on the board for an x by entering a row and column number. then redisplay the board with an x replacing the * in the chosen location. if there is no winner yet and the board is not yet full, allow player 2 to select a location on the board for an o by entering a row and column number. then redisplay the board with an o replacing the * in the chosen location. the loop should continue until a player has won or a tie has occurred, then display a message indicating who won, or reporting that a tie occurred. player 1 wins when there are three xs in a row, a column, or a diagonal on the game board. player 2 wins when there are three ox in a row, a column, or a diagonal on the game board. a tie occurs when all of the locations on the board are full, but there is no winner. input validation: only allow legal moves to be entered. the row must be 1, 2, or 3. the column must be 1, 2 3. the (row, column) position entered must currently be empty (i. e., still have an asterisk in it).

Which cultural aspect does this type of song best portray? a german polka dance

Suppose there is a relation r(a, b, c) with a b+-tree index with search keys (a, b).1. what is the worst-case cost of finding records satisfying 10 < a < 50 using this index, in terms of the number of records n1, retrieved and the height h of the tree? 2. what is the worst-case cost of finding records satisfying 10 < a < 50 and 5 < b < 10 using this index, in terms of the number of records n2 that satisfy this selection, as well as n1 and h defined above? 3. under what conditions on n1 and n2, would the index be an efficient way of finding records satisfying the condition from part (2)?