For the given decision algorithm, find how many options result. Alternative 1: Step 1: 1 choice Step 2: 5 choices   Alternative 2: Step 1: 3 choices Step 2: 4 choices Step 3: 1 choice  options

As you review the recipe for chocolate chip cookies, you realize that the recipe is a(n) representative heuristic algorithm artificial rule availability heuristic

1 Algorithm 1: What is the control structure used in the algorithm below? O (5 Points) Step 1: Input first number as A Step 2: Input second number as B Step 3: SET TEMP = A Step 4: SET A = B Step 5: SETB = TEMP Step 6: PRINT A, B Step 7: END %3D Sequence Decision Repetition None of the choices

please use google collab and screenshot

Create an algorithm for the given case: A store owner wants to give a 10% discount to the purchases of customers who are at least 65 years old.

It is the best algorithm design method when the solution to a problem can be viewed as the result of a sequence of decisions. a   Dynamic Programming b   Greedy method c   Divide and Conquer d   Incremental

Four in a row is a game in which players take turns adding tokens to the columns on the game board.   Tokens fall to the lowest position in the chosen column that does not already have a token in it. Once one of the players has placed four of their tokens in a straight line (either vertically, horizontally, or diagonally), they win the game If the board is full and no player has won, then the game ends in a draw.   TASK Using the following class descriptions, create a UML diagram and a version of Four in a row game   The game must allow for a minimum of two and maximum of four players The game must allow each player to enter their name(duplicate names should not be accepted) The game should give the players the ability to choose how many rows (between four and ten), and how many columns (between four and ten) the game board should have. The code uses several classes, including "Player", "Board","Game" and exceptions for handling errors such as invalid moves and full columns.…

A step-by-step procedure used to solve a problem is called  Algorithm explain?

Index (RSI) Algorithm Building on the momentum from the Moving Average algorithm, you’ll now try to develop a more sophisticated algorithm to outdo it! With this algorithm you will make trading decisions with Relative Strength Index, or RSI. How does this algorithm compare to your moving average algorithm? Algorithm Description The relative strength index (RSI) is defined as a momentum indicator that measures the magnitude of recent price changes to evaluate overbought or oversold conditions in the price of a stock. The index is calculated by the average gain and average loss over a rolling time window. ???????????=?????????/????????AverageGain=TotalGain/Lookback ?????Gains: When there was a price increase compared to the previous day, the gain is equal to that price gain value, otherwise set to zero. ?????????TotalGain: The sum of the gains over the lookback period. ????????Lookback: The number of days of previous data to look back.…

Description: There are 5 philosophers sitting around a table and try to eat from the center of the table. 5 chopsticks also lay on the table. Let us call the 5 philosophers in clockwise P1, P2, ...P5. There also 5 chopsticks clockwise S1, S2, ..., S5 on the table. There are only one chopstick between every two philosophers. Every right hand chopstick will have the same index as the philosopher. For example, on the right hand side of P1, the chopstick is called S1. And every left hand side chopstick number is 1+number of the philosopher.  A philosopher spend random time to think, then he feel hungry and try to eat. The middle dish can provide enough food for everyone at the same time. But a philosopher only can start to eat when he picked up two chopsticks from left hand side and right hand side to form a pair of chopsticks. If a philosopher take one chopsticks, he will try to fight with neighbours to get another one, and never back off to put down the one in his hand. Once the…