Suppose, you have been given a non-negative integer which is the height of a 'house of cards'. To build such a house you at-least require 8 cards. To increase the level (or height) of that house, you would require four sides and a base for each level. Therefore, for the top level, you would require 8 cards and for each of the rest of the levels below you would require 5 extra cards. If you were asked to build level one only, you would require just 8 cards. Of course, the input can be zero; in that case, you do not build a house at all. Complete the recursive method below to calculate the number of cards required to build a 'house of cards' of specific height given by the parameter. Height 1 Height 2 Height 3 def hocBuilder (height): #TO DO

Suppose, you have been given a non-negative integer which is the height of a 'house of cards'. To build such a house you at-least require 8 cards. To increase the level (or height) of that house, you would require four sides and a base for each level. Therefore, for the top level, you would require 8 cards and for each of the rest of the levels below you would require 5 extra cards. If you were asked to build level one only, you would require just 8 cards. Of course, the input can be zero; in that case, you do not build a house at all. Complete the recursive method below to calculate the number of cards required to build a 'house of cards' of specific height given by the parameter. Height 1 Height 2 Height 3 def hocBuilder (height): #TO DO

Operations Research : Applications and Algorithms

4th Edition

ISBN:9780534380588

Author:Wayne L. Winston

Publisher:Wayne L. Winston

Chapter17: Markov Chains

Section: Chapter Questions

Problem 12RP

See similar textbooks

Similar questions

Suppose, you have been given a non-negative integer which is the height of a 'house of cards'. To build such a house you at-least require 8 cards. To increase the level (or height) of that house, you would require four sides and a base for each level. Therefore, for the top level, you would require 8 cards and for each of the rest of the levels below you would require 5 extra cards. If you were asked to build level one only, you would require just 8 cards. Of course, the input can be zero; in that case, you do not build a house at all. Complete the recursive method below to calculate the number of cards required to build a 'house of cards' of specific height given by the parameter. def hocBuilder(height): #TO DO E Height 1 Height 2 Height 3
Suppose, you have been given a non-negative integer which is the height of a ‘house of cards’. To build such a house you at-least require 8 cards. To increase the level (or height) of that house, you would require four sides and a base for each level. Therefore, for the top level, you would require 8 cards and for each of the rest of the levels below you would require 5 extra cards. If you were asked to build level one only, you would require just 8 cards. Of course, the input can be zero; in that case, you do not build a house at all. Complete the recursive method below to calculate the number of cards required to build a ‘house of cards’ of specific height given by the parameter. there is a picture given in that section. public int hocBuilder (int height){ // TO DO } OR def hocBuilder(height): #TO DO
Suppose, you have been given a non-negative integer which is the height of a ‘house ofcards’. To build such a house you at-least require 8 cards. To increase the level (or height)of that house, you would require four sides and a base for each level. Therefore, for the toplevel, you would require 8 cards and for each of the rest of the levels below you wouldrequire 5 extra cards. If you were asked to build level one only, you would require just 8cards. Of course, the input can be zero; in that case, you do not build a house at all.Complete the recursive method below to calculate the number of cards required to builda ‘house of cards’ of specific height given by the parameter.
Suppose, you have been given a non-negative integer which is the height of a 'house of cards'. To build such a house you at-least require 8 cards. To increase the level (or height) of that house, you would require four sides and a base for each level. Therefore, for the top level, you would require 8 cards and for each of the rest of the levels below you would require 5 extra cards. If you were asked to build level one only, you would require just 8 cards. Of course, the input can be zero; in that case, you do not build a house at all. Complete the recursive method below to calculate the number of cards required to build a 'house of cards' of specific height given by the parameter. Height 1 Height 2 Height 3 public int hocBuilder (int height) { // TO DO } OR def hocBuilder (height): #то DO
You are playing a card game. In this game, your opponent places n monster cards onto the board, the i th of which has hi health points. You in turn have m ≥ n hero cards in your hand, the j th of which deals dj damage per turn. To begin the game, you will choose n heroes from your hand and assign each of them to a different enemy monster. Each turn, your heroes will deal damage equal to their damage power to the opposing enemy. If at any point an opponent’s monster reaches 0 health or less, then it is destroyed. You are given a limited number of turns k to destroy all enemy monsters. Design an algorithm which runs in O(m + n log n) time and determines whether it is possible to assign your heroes in such a way as to destroy all enemy monsters in k turns or fewer First develop a Θ(m log m) time algorithm, then improve it to Θ(m + n log n) Do not write the code, give steps and methods. Explain the steps of algorithm, and the logic behind these steps in plain English input is The number of…
You are given an n ×n square matrix. Each cell contains a number (positive,negative, or zero); you may assume they are integers if that helps. Now you are thrown into one of the square cells. Your task is to escape the board and at the same time collect as much value as you can. Every time you reach a cell, you gain/lose by the amount stored in that cell. From a cell, you can traverse to a cell below or to the right. You can escape the board fromthe the right boundary or from the bottom. Note that you cannot go back to a cell that you have already visited; otherwise, you can just keeping visiting two consecutive positive cells and obtain infinite value, yet never escaping – you are filthy rich but alone forever!Give an algorithm to escape as rich as you can be. State the complexity. Your explanation/pseudo-code (if you choose to write one) should be clear; remember that I can only grade based on what you write, not what you thought. You should also provide substantial reasoning as to…
You have a fence post located at the point (x,y) where a goat is tethered by a rope. You also have a house, which is a rectangle with diagonally opposite corners at the points bottom-left: (x1,y1) and top-right: (x2,y2). You want to pick a length of rope that guarantees the goat cannot reach the house. Determine the minimum distance from the fence post to the house, so that you can make sure to use a shorter rope. Recall that the distance formula is: sqrt( (x2−x1)^2+(y2−y1)^2 ) The input consists of a single line containing six space-separated integer values: x, y, x1, y1, x2, and y2. You are guaranteed that x1<x2 and y1<y2, and that (x,y) is strictly outside the axis-aligned rectangle with corners at (x1,y1) and (x2,y2). Return the minimum distance from the goat’s post to the house as a floating-point value from main(). Learning Objectives Be able to create a program with a lesser template. Be able to calculate the min/max of integers. Be able to write a mathematical…
You are playing the popular card game “Inscribings”. In this game, your opponent places n monster cards onto the board, the ith of which has hi health points. You in turn have m ≥ n hero cards in your hand, the jth of which deals dj damage per turn. To begin the game, you will choose n heroes from your hand and assign each of them to a different enemy monster. Each turn, your heroes will deal damage equal to their damage power to the opposing enemy. If at any point an opponent’s monster reaches 0 health or less, then it is destroyed. You are given a limited number of turns k to destroy all enemy monsters. Design an algorithm which runs in O(m + n log n) time and determines whether it is possible to assign your heroes in such a way as to destroy all enemy monsters in k turns or fewer. If it is possible, your algorithm must also return any such assignment. Need an algorithm which runs in Θ(m log m) time.
Pedro has a collection of 100 rocks. At the beginning of each day, he collects all the rocks into a single collection. Then he then divides the rocks into two smaller collections, one with a rocks and one with b rocks (so a+b= 100), and he writes down ab (the product of their sizes) on a card. Then he goes to one of the his two collections and divides it into two smaller collections, one with c rocks and one with d rocks, and writes down the product cd of their sizes on the card. So now Pedro has three collections. He now goes to one of the collections and divides it into two smaller collections of sizes e and ƒ and writes ef on the card. He continues in this way until he is forced to stop because he has 100 collections with 1 rock each. At this point he has written down 99 numbers on his card. He adds up the numbers and calls this number the score for the day. Pedro repeats this experiment each day, but can make different decisions about how to divide collec- tions. For example, maybe…
Bomberman lives in a rectangular grid. Each cell in the grid either contains a bomb or nothing at all. Each bomb can be planted in any cell of the grid but once planted, it will detonate after exactly 3 seconds. Once a bomb detonates, it's destroyed — along with anything in its four neighboring cells. This means that if a bomb detonates in cell , any valid cells and are cleared. If there is a bomb in a neighboring cell, the neighboring bomb is destroyed without detonating, so there's no chain reaction. Bomberman is immune to bombs, so he can move freely throughout the grid. Here's what he does: Initially, Bomberman arbitrarily plants bombs in some of the cells, the initial state. After one second, Bomberman does nothing. After one more second, Bomberman plants bombs in all cells without bombs, thus filling the whole grid with bombs. No bombs detonate at this point. After one more second, any bombs planted exactly three seconds ago will detonate. Here, Bomberman stands back and…
Bomberman lives in a rectangular grid. Each cell in the grid either contains a bomb or nothing at all. Each bomb can be planted in any cell of the grid but once planted, it will detonate after exactly 3 seconds. Once a bomb detonates, it's destroyed — along with anything in its four neighboring cells. This means that if a bomb detonates in cell , any valid cells and are cleared. If there is a bomb in a neighboring cell, the neighboring bomb is destroyed without detonating, so there's no chain reaction. Bomberman is immune to bombs, so he can move freely throughout the grid. Here's what he does: Initially, Bomberman arbitrarily plants bombs in some of the cells, the initial state. After one second, Bomberman does nothing. After one more second, Bomberman plants bombs in all cells without bombs, thus filling the whole grid with bombs. No bombs detonate at this point. After one more second, any bombs planted exactly three seconds ago will detonate. Here, Bomberman stands back and…
Suppose you have been hired to develop a musical chair game. In this game there will be 7participants and all of them will be moving clockwise around a set of 7 chairs organized in a circular manner while a music will be played in the background. You will control the music using random numbers between 0-3.If the generated random number is 1, you will stop the music and if the number of participants who are still in the game is n, theparticipant at position (n/2) will be eliminated. Each time a participant is eliminated, a chair will be removed and you have to print the player names who are still in the game. The game will end when there will be only one participant left. At the end of the game, display the name of the winner.[Hint: You will need to invoke a method to generate a random number between 0(inclusive) to 3 (inclusive)]write code in java or python