Two players take turns alternatively in placing signs (+ or -) before them, and then they all are added. The sign can be placed before any element of the array that has not been assigned a sign yet. All elements must be assigned a sign. Player 11 wins if the resulting sum is even, else player 22 wins. Find out who shall win if they both play optimally.

Two players take turns alternatively in placing signs (+ or -) before them, and then they all are added. The sign can be placed before any element of the array that has not been assigned a sign yet. All elements must be assigned a sign. Player 11 wins if the resulting sum is even, else player 22 wins. Find out who shall win if they both play optimally.

Programming Logic & Design Comprehensive

9th Edition

ISBN:9781337669405

Author:FARRELL

Publisher:FARRELL

Chapter6: Arrays

Section: Chapter Questions

Problem 17RQ

See similar textbooks

Similar questions

You are given an array A[1..n] of positive numbers where Ai] is the stock price on day i. You are allowed to buy the stock once and sell it at some point later. For each day you own the stock you pay S1 fee. Design a divide-and-conquer algorithm that will return a pair (i,j) such that buying the stock on day i and selling it on day j will maximize your gain The complexity of the algorithm has to be O
You are given an array A[1..n] of positive numbers where Ai] is the stock price on day i. You are allowed to buy the stock once and sell it at some point later. For each day you own the stock you pay S1 fee. Design a divide-and-conquer algorithm that will return a pair (i,j) such that buying the stock on day i and selling it on day j will maximize your gain The complexity of the algorithm has to be O(n log n) You are given an array A[1..n] of positive numbers where Ai] is the stock price on day i. You are allowed to buy the stock once and sell it at some point later. For each day you own the stock you pay S1 fee. Design a divide-and-conquer algorithm that will return a pair (i,j) such that buying the stock on day i and selling it on day j will maximize your gain The complexity of the algorithm has to be O(n log n)
Starting from a randomly generated state of the 15-puzzle game , steepest-ascent hill-climbing (the vanilla version of hill-climbing search) gets stuck 76% of the time, i.e., solving only 24% of problem instances. But it works very quickly, i.e., it takes just 6 steps on average when it succeeds and 5 steps when it gets stuck. In contrast, if sideways moves are allowed, this raises the percentage of problem instances solved by hill-climbing from 24% to 81%, with the success at a cost: the algorithm averages roughly 7 steps for each successful instance and 32 steps for each failure. Now suppose that we are implementing random-restart hill climbing (i.e., if a search fails, it keeps to try, and try, until it gets a success) by the following two versions: one uses vanilla steepest-ascent hill climbing, and the other one uses hill climbing with sideways moves. Can you please tell which version of random-restart hill-climbing listed above runs faster on average? Please justify your…
You are given an arrayof colors (reds, whites, and blues), in no particular order. Sort them into the order of redsfollowed by whites followed by blues.a. Devise an efficient algorithm to solve this problem.b. What is your algorithm's time complexity?For example, if red is represented by 2, white represented by 4 and blue is represented by 6,your input and output array could be of following form:Input: [ 4 6 2 4 2 6 4 2 6 4 4 2 4 ]Output: [ 2 2 2 2 4 4 4 4 4 4 6 6 6]
Computer Science There is an n × n grid of squares. Each square is either special, or has a positive integer costassigned to it. No square on the border of the grid is special.A set of squares S is said to be good if it does not contain any special squares and, starting fromany special square, you cannot reach a square on the border of the grid by performing up, down,left and right moves without entering a cell belonging to S. 5 3 4 9 4 X 3 6 1 9 X 4 1 2 3 5 - Design an algorithm which receives an arbitrary n × n grid, runs in time poly-nomial in n and determines a good set of squares with minimum total cost.
Write out the algorithm (pseudocode) to find K in the ordered array by the method that compares K to every fifth entry until K itself or an entry larger than K is found, and then, in the latter case, searches for K among the preceding four. How many comparisons does your algorithm do in the worst case?
A post on facebook is said to be more popular if the number of likes on the post is strictly greater than the number of likes on some other post. In case the number of likes is same, the post having more comments is more popular. Given arrays A and B, each having size N, such that the number of likes and comments on the ith post are Ai and Bi respectively, find out which post is most popular. It is guaranteed that the number of comments on all the posts is distinct. Input Format The first line of input will contain a single integer T, denoting the number of test cases. Each test case consists of multiple lines of input. The first line of each test case contains a single integer N, the number of posts. The second line of each test case contains N space-separated integers A1,A2,…,AN — where Ai is the number of likes on the ith post. The third line of each test case contains N space-separated integers B1,B2,…,BN — where Bi is the number of comments on the ith post. Output…
Computer Science Two players play Chomp starting with a 3 by 3 board. P1 chomps off a 1 by 2 piece at the (3,2) position. Show that the resulting position is an N position by finding a winning strategy for P2.
Given an integer n and an array a of length n, your task is to apply the following mutation to a: Array a mutates into a new array b of length n. For each i from 0 to n - 1, b[i] = a[i - 1] + a[i] + a[i + 1]. If some element in the sum a[i - 1] + a[i] + a[i + 1] does not exist, it should be set to 0. For example, b[0] should be equal to 0 + a[0] + a[1].
Implement an algorithm that returns the X closest items to a value V, for any array of integer elements. V may or may not be present in the array. Its solution must be O(nlogn). (phyton or Java). Note: The proposed solution must use the divide-and-conquer strategy.
In a tournament, there are n participating teams are labelled from 1 to n. Each pair of teams will play against each other exactly once. Thus, a total of [n(n-1)/2] matches will be held, and each team will compete in n − 1 of these matches. There are only two possible outcomes of a match: 1. The match ends in a draw, in which case both teams will get 1 point. 2. One team wins the match, in which case the winning team gets 3 points and the losing team gets 0 points. Design an algorithm which runs in O(n2 ) time and provides a list of results in all [n(n-1)/2] matches which: (a) ensures that all n teams finish with the same points total, and (b) includes the fewest drawn matches among all lists satisfying (a). Do not write the code, give steps and methods. Explain the steps of algorithm, and the logic behind these steps in plain English. PLease give the total time complexity.
In a tournament, there are n participating teams are labelled from 1 to n. Each pair of teams will play against each other exactly once. Thus, a total of [n(n-1)/2] matches will be held, and each team will compete in n − 1 of these matches. There are only two possible outcomes of a match: 1. The match ends in a draw, in which case both teams will get 1 point. 2. One team wins the match, in which case the winning team gets 3 points and the losing team gets 0 points. Design an algorithm which runs in O(n2 ) time and provides a list of results in all [n(n-1)/2] matches which: (a) ensures that all n teams finish with the same points total, and (b) includes the fewest drawn matches among all lists satisfying (a). Do not write the code, give steps and methods. Explain the steps of algorithm, and the logic behind these steps in plain English