4. A newly opened college ground is rectangular in shape and the Management decides to build a fence around the ground. In order to help the construction workers to build a fence, they planned to place a thick rope around the ground. They also wanted to cover the entire ground with a thick carpet during rainy season. They wanted to buy only the exact quantity of carpet and rope that is needed. They requested your help. Please help them by writing an algorithm and 'C' program to find the exact length of the rope and the exact quantity of carper that is required. Length and width should be a positive number.

4. A newly opened college ground is rectangular in shape and the Management decides to build a fence around the ground. In order to help the construction workers to build a fence, they planned to place a thick rope around the ground. They also wanted to cover the entire ground with a thick carpet during rainy season. They wanted to buy only the exact quantity of carpet and rope that is needed. They requested your help. Please help them by writing an algorithm and 'C' program to find the exact length of the rope and the exact quantity of carper that is required. Length and width should be a positive number.

Name: C++ 4. A newly opened college ground is rectangular in shape andthe Ma
Uploaded: 2024-03-20T06:51:23.000Z
Channel: Bartleby
Description: C++ 4. A newly opened college ground is rectangular in shape andthe Management decides to build a fence around the ground. Inorder to help the construction workers to build a fence, theyplanned to place a thick rope around the ground. They alsowanted

C++ Programming: From Problem Analysis to Program Design

8th Edition

ISBN:9781337102087

Author:D. S. Malik

Publisher:D. S. Malik

Chapter10: Classes And Data Abstraction

Section: Chapter Questions

Problem 19PE

See similar textbooks

Similar questions

Suppose we have a nice young couple who borrow $700000 from the bank, at an annual interest rate of3.124%. The mortgage is a 30 year loan, so they need to pay it off within 360 months total. Our happycouple decide to set their monthly mortgage payment at $2000 per month. Will they pay off the loan intime or not?Note that the monthly balance will be calculated asbalance = (im × previous balance) - monthly paymentwhere the convert annual interest to a monthly multiplier im is calculated as im = (1 +i)1/12 and i = annualinterest rate.Write a loop for track the total payment in 360 months so that we can evaluate if the couple can pay off theloan. Write in R Please and thank you.
Three prisoners have been sentenced to long terms in prison, but due to over crowed conditions, one prisoner must be released. The warden devises a scheme to determine which prisoner is to be released. He tells the prisoners that he will blindfold them and then paint a red dot or blue dot on each forehead. After he paints the dots, he will remove the blindfolds, and a prisoner should raise his hand if he sees at least one red dot on the other two prisoners. The first prisoner to identify the color of the dot on his own forehead will be release. Of course, the prisoners agree to this. (What do they have to lose?) The warden blindfolds the prisoners, as promised, and then paints a red dot on the foreheads of all three prisoners. He removes the blindfolds and, since each prisoner sees a red dot (in fact two red dots), each prisoner raises his hand. Some time passes when one of the prisoners exclaims, "I know what color my dot is! It's red!" This prisoner is then released. Your problem…
You are the TA for the FCP course in environment engineering. You are given the midsem and endsem marks for the N Students in the course. A student P is said to dominate a student Q, if the midsem and endsem marks of P are both greater than the respective midsem and endsem marks of Q. Design an efficient algorithm for finding all the students that are not dominated by any other student in the class. Analyse the time complexity as well
Implement an algorithmic solution, indicating which states are valid and which are not, and model the space of the following problem: An interest group from a small town decided to sue a company for commercial abuse. For this, the people have organized themselves and decided to send 3 representatives, who will have to travel in a Van to the city where the lawsuit will be filed. The company to be sued, upon learning of these actions, has decided to send 3 lawyers to persuade the representatives, who will also travel in the same Van for that purpose. The community must file the class action suit under these conditions: - The three applicants must reach the destination city; - Only two people can travel per trip in the Van (small town - city, city - small town); - There can never be more lawyers than plaintiffs in any one place (either in the small town or city) because the lawyers can persuade the plaintiffs and as a consequence, the lawsuit would not be made; - The Van cannot be…
The world queen in the new post-apocalyptic world is extremely worried about the birth rate. She therefore orders that every family must have at least one daughter or else pay hefty fines. What will the gender ratio of the next generation be if all families adhere to this policy, which requires them to keep having children until they have one girl, at which point they immediately stop? (Presume that all pregnancies have an equal chance of producing a boy or a girl.) Write a computer simulation of this problem when you have logically resolved it.
The world monarch in the new post-apocalyptic world is extremely worried about the birth rate. She therefore orders that every family must have at least one female or else pay hefty fines. What will the gender ratio of the next generation be if all families adhere to this policy, which requires them to keep having children until they have one girl, at which time they immediately stop? (Presume that all pregnancies have an equal chance of producing a male or a girl.) Write a computer simulation of this problem after you have rationally resolved it.
A safe is locked by a combination of of four binary digits (that is, 0 or 1), but theowner has forgotten the combination. The safe is designed in such a way that nomatter how many digits have been pressed, if the correct combination of three digitsis pressed at any point, then the safe automatically opens (there is no ”enter” key).Our goal is to find the minimum number of digits that one needs to key in in order toguarantee that the safe opens. In other words, we wish to find the smallest possiblelength of a binary sequence containing every four-digit sequence in it.(a) Create a digraph whose vertex set consists of three-digit binary sequences. Fromeach vertex labelled xyz, there is one outgoing edge (labelled 0) leading to vertexyz0, and another outgoing edge (labelled 1) leading to vertex yz1.(b) Explain why every edge represents a four digit sequence and why an Euleriantour of this graph represents the desired sequence of keystrokes.(c) Find the minimum number of digits that one…
Derive rules of thumb that apply when the new input size is the square root of the original input size for each scenario below. Be sure to show the mathematical result and give an English sentence for the rule of thumb, in the usual style e.g. “If the new size is the square root of the original size then the runtime is divided by the original size.” (Don't use variables like "n" in your sentence, say "the original size" or "the new size".) a. T(n) = kn b. T(n) = klogn c. T(n) = kn2 d. T(n) = knlogn
Suppose we have a group of proposed talks with preset start and end times. Students of CSE340 were asked to design an algorithm to schedule as many of these talks as possible in a lecture hall, under the assumptions that once a talk starts, it continues until it ends, no two talks can proceed at the same time, and a talk can begin at the same time another one ends. Assume that talk j begins at time sj (where s stands for start) and ends at time ej (where e stands for end). One student proposed the algorithm shown in Algorithm 1 on the next page, which simply adds talks in order of earliest start time (smallest sj ). (a) Prove, using a counter example, that the proposed algorithm does not always produce an optimal schedule (i.e., a schedule with most possible talks). (b) Another student proposed adding talks in order of shortest duration (ej - sj ). Prove, using a counter example, that even with this new criteria, the algorithm does not always produce an optimal schedule.
Imagine you have a strip of highway connecting n towns in a line. Each town is being evaluated as a possible location for building a cellular phone tower. Each cell tower will provide coverage to the town it’s built in, but no other towns. However, due to the way that cell towers interfere with one another, it’s not possible to build cell phone towers in two adjacent towns.Describe an algorithm that, given the populations of each of the towns, reports the maximum number of people you can provide cell phone coverage to, subject to the restriction that no two adjacent towns can each have cell towers in them. Use dynamic programming to dramatically speed up your solution over a na ̈ıve recursive algorithm.
1. Solve the Eight Tiled Puzzle Problem Using Hill-climbing algorithm with the help ofC++ programming language. Initial state and goal state are given below. 4 7 2 5 8 1 3 6 Initial State 1 2 3 4 5 7 8 6 Goal State Expected Outcome.a. The number of steps required to solve the puzzle.b. Print the best state after each iteration of hill-climbing requirements:no pre-defined functionsquee and algorithm library not allowedIostream only no other
Answer the following: This problem exercises the basic concepts of game playing, using tic-tac-toe (noughts and crosses) as an example. We define Xn as the number of rows, columns, or diagonals with exactly n X’s and no O’s. Similarly, On is the number of rows, columns, or diagonals with just n O’s. The utility function assigns +1 to any position with X3=1 and −1 to any position with O3=1. All other terminal positions have utility 0. For nonterminal positions, we use a linear evaluation function defined as Eval(s)=3X2(s)+X1(s)−(3O2(s)+O1(s)). a. Show the whole game tree starting from an empty board down to depth 2 (i.e., one X and one O on the board), taking symmetry into account. b. Mark on your tree the evaluations of all the positions at depth 2. c .Using the minimax algorithm, mark on your tree the backed-up values for the positions at depths 1 and 0, and use those values to choose the best starting move. Provide original solutions including original diagram for part a!