I need help on this? 5:08To DoWord Game AnalysisAssignment DetailsTCSS 141 A Wi 24: Programming For AllYou have been contracted to write a program thatevaluates the performance of professional word gameplayers (yes, this is a thing!). To perform this evaluation,you are to analyze the words they play. Write a programthat accepts a number of words to analyze. Each wordshould be accepted individually. When the programcompletes, the longest and shortest words are bothdisplayed alongside their length, along with the averageword length.As there must be at least one word to analyze, validateinput to make sure a number of words greater thanzero is put in.Your output should be formatted very similarly to thefollowing. Also notice that the average length is roundedto two decimal places.Hint: To get the shortest word length, you can set your"length of shortest word" variable to an arbitrarily highnumber before you begin.Enter number of words: 6Enter the next word: programmingEnter the next word: piEnter the next word: kettleEnter the next word: worksEnter the next word: prionEnter the next word: asteriskLongest word: programming, 11Shortest word ni2Dashboard000ISubmit Assignment684Calendar5To DoNotificationsInbox

I have provided PYTHON CODE along with CODE SCREENSHOT and OUTPUT SCREENSHOT....

Answered: You have been contracted to write a…

Engineering

Computer Science

You have been contracted to write a program that

Operations Research : Applications and Algorithms

4th Edition

ISBN:9780534380588

Author:Wayne L. Winston

Publisher:Wayne L. Winston

Chapter19: Probabilistic Dynamic Programming

Section19.4: Further Examples Of Probabilistic Dynamic Programming Formulations

Problem 7P

See similar textbooks

Similar questions

Artificial intelligence (Question - 6) ======================= One variation on the game of nim is described in Luger. The game begins with a single pile of stones. The move by a player consists of dividing a pile into two piles that contain an unequal number of stones. For example, if one pile contains six stones, it could be subdivided into piles of five and one, or four and two, but not three and three. The first player who cannot make a move loses the game.(6.1) Draw the complete game tree for this version of Nim if the start state consists of six stones.(6.2) Perform a minimax evaluation for this game. Let 1 denote a win and 0 a loss.
Correct answer will be upvoted else Multiple Downvoted. Don't submit random answer. Computer science. anglers have recently gotten back from a fishing excursion. The I-th angler has gotten a fish of weight man-made intelligence. Anglers will flaunt the fish they got to one another. To do as such, they initially pick a request where they show their fish (every angler shows his fish precisely once, in this way, officially, the request for showing fish is a stage of integers from 1 to n). Then, at that point, they show the fish they discovered by the picked request. At the point when an angler shows his fish, he may either become glad, become dismal, or stay content. Assume an angler shows a fish of weight x, and the most extreme load of a formerly shown fish is y (y=0 if that angler is quick to show his fish). Then, at that point: in the event that x≥2y, the angler becomes cheerful; in the event that 2x≤y, the angler becomes miserable; in the event that none of these two…
Correct answer will be upvoted else Multiple Downvoted. Computer science. Athenaeus has recently wrapped up making his most recent melodic piece and will introduce it tomorrow to individuals of Athens. Tragically, the tune is somewhat dull and almost certain will not be met with a warm gathering. His tune comprises of n notes, which we will treat as certain integers. The variety of a tune is the number of various notes it contains. As a supporter of music, Euterpe looks after arrangers and guides them all through the method involved with making new tunes. She chose to help Athenaeus by changing his melody to make it more assorted. Being a minor goddess, she can't self-assertively change the tune. All things being equal, for every one of the n notes in the tune, she can either leave it for what it's worth or increment it by 1. Given the tune as an arrangement of integers portraying the notes, discover the maximal, attainable variety. Input The input comprises of numerous…
AI a modern approach 10.3 The monkey-and-bananas problem is faced by a monkey in a laboratory with some bananas hanging out of reach from the ceiling. A box is available that will enable the monkey to reach the bananas if he climbs on it. Initially, the monkey is at A, the bananas at B, and the box at C. The monkey and box have height Low, but if the monkey climbs onto the box he will have height High, the same as the bananas. The actions available to the monkey include Go from one place to another, Push an object from one place to another, ClimbUp onto or ClimbDown from an object, and Grasp or Ungrasp an object. The result of a Grasp is that the monkey holds the object if the monkey and object are in the same place at the same height. a. Write down the initial state description.b. Write the six action schemas.c. Suppose the monkey wants to fool the scientists, who are off to tea, by grabbing the bananas, but leaving the box in its original place. Write this as a general goal (i.e.,…
Problem Description Learn Clojure In this problem, each person in the social network takes a specific time to send the message(time is an integer). A specific newbie in react(let's call him NB) wants to post a question to a ninja(let's call him NJ) on the network. Find out how long a specific message takes to reach NJ from NB. The social network is given as the input as follows. The first line is a number which is the number of people in the social network. The next following lines are the actual members of the social network whose names are written in separate lines. Following that is the number of connections, followed by a new line separated list of connections given as . Then on the next line is the person who wants to send the message(NB's id in our case) and on the next line is the person who is the intended recipient(NJ's id). The output should be a single line consisting of the time it takes to send the message through or -1 if the message can't be sent. INPUT FORMAT total…
Can you help me with this code because i am struggling and I don't know what to do with this part: he Eight Puzzle consists of a 3 x 3 board of sliding tiles with a single empty space. For each configuration, the only possible moves are to swap the empty tile with one of its neighboring tiles. The goal state for the puzzle consists of tiles 1-3 in the top row, tiles 4-6 in the middle row, and tiles 7 and 8 in the bottom row, with the empty space in the lower-right corner. In this section, you will develop two solvers for a generalized version of the Eight Puzzle, in which the board can have any number of rows and columns. We have suggested an approach similar to the one used to create a Lights Out solver in Homework 2, and indeed, you may find that this pattern can be abstracted to cover a wide range of puzzles. If you wish to use the provided GUI for testing, described in more detail at the end of the section, then your implementation must adhere to the recommended interface. However,…
The annual snake festival is upon us and all the snakes of the kingdom have gathered to participate in the parade. The chef was tasked with reporting on the parade, so he decided to watch all the snakes first. When he sees the snake first, it will be his head, so he marks the "H". Snakes are long, and when they see the snake finally scurry away, they mark its tail with a "T". In the interim, when the snake is moving around it, or in the time between one snake and the next snake, it marks a '.'. Since the snakes come in a procession and one by one, a valid message would be something like "..H..T...HTH....T.", or "...", or "HT", while "T ...H..H.T", "H..T..H", "H..H..T..T" would be invalid messages (see explanation below). Formally, a snake is represented by an 'H' followed by some (possibly null) '.' and then 'T'. A valid message is one that begins with the (probably zero-length) string '.' and then some (possibly zero) snakes, with some '.'s in between, and finally some (possibly zero)…
During Eid, it is a tradition for every father to give his children money to spend on entertainment. Chef has N coins; denote the value of the coin i by vi. Since today is Eid, Chef gives one coin to each of his two children. He wants the absolute value of the difference between the values of the coins given to the two children to be as small as possible to be as fair as possible. Help the chef by telling him the minimum possible difference between the values of the coins given to the two children. Of course, the chef cannot give the same coin to both children. Note: Please answer in python only Possible input 1 3 142 Required Output 1
During Eid, it is a tradition for every father to give his children money to spend on entertainment. Chef has N coins; denote the value of the coin i by vi. Since today is Eid, Chef gives one coin to each of his two children. He wants the absolute value of the difference between the values of the coins given to the two children to be as small as possible to be as fair as possible. Help the chef by telling him the minimum possible difference between the values of the coins given to the two children. Of course, the chef cannot give the same coin to both children. Note: Please answer in C++ Programming language. Possible input 1 3 142 Required Output 1
Correct code answer with output screenshot. Else downvoted. William is facilitating a get-together for n of his broker companions. They began a conversation on different monetary forms they exchange, however there's an issue: not all of his dealer companions like each cash. They like a few monetary standards, yet not others. For each William's companion I it is known whether he enjoys money j. There are m monetary standards altogether. It is likewise realized that a merchant dislike more than p monetary forms. Since companions need to have some normal subject for conversations they need to track down the biggest via cardinality (perhaps vacant) subset of monetary standards, with the end goal that there are essentially ⌈n2⌉ companions (gathered together) who like every money in this subset. Input The primary line contains three integers n,m and p (1≤n≤2⋅105,1≤p≤m≤60,1≤p≤15), which is the number of broker companions, the number of monetary forms, the greatest number of…
Correct answer will be upvoted else Multiple Downvoted. Computer science. Berland local ICPC challenge has quite recently finished. There were m members numbered from 1 to m, who contended on a problemset of n issues numbered from 1 to n. Presently the article is going to happen. There are two issue creators, every one of them will tell the instructional exercise to precisely k back to back errands of the problemset. The creators pick the section of k continuous errands for themselves autonomously of one another. The sections can correspond, meet or not cross by any means. The I-th member is keen on paying attention to the instructional exercise of all continuous errands from li to ri. Every member consistently decides to pay attention to just the issue creator that tells the instructional exercises to the most extreme number of assignments he is keen on. Leave this greatest number alone artificial intelligence. No member can pay attention to both of the creators, regardless of…
Python Knapsack Problem: imagine you are carrying a knapsack with capacity to hold a total of weight C. You are selecting among n items with values A={a_1, a_2, ... , a_n} and associated weights W={w_1, w_2, ... , w_n}. Here the weights and values are all positive. You wish to maximize the total value of the items you select not exceeding the given weight capacity, example, maximize sum_{a in A} such that sum_{w in W} <= C. Note that you can only select your items once. Reformulate this as a bottom-up dynamic programming problem as follows. Define K_{i,j} as the highest possible value sum considering items 1 through i and total weight capacity j (j <= C). What is the base case i.e. K_{0,j} for all j and K_{i,0} for all i. What is the loop statement?