Create a program named yourID_random.py student ID). Add the following functionality to your program. ● Use python's random module to pick two random integers between the range [10,100] (inclusive). Suppose, the minimum and the maximum of these two integers are start and stop, respectively. Print the values of start and stop, in this order, to the screen. Hint: use built-in functions max() and min(). . Write a precondition, event-controlled loop (i.e., a while loop), (replace your/D with your Carleton ● that prints all numbers returned by range(start, stop, 3) to the terminal. Ask the user repeatedly for a positive integer x, (input validation is not necessary), until the user enters "quit". If x falls outside this range [start, stop] (inclusive), print all those numbers that are in [start, stop], and that divide x. That is, if x gets divided by those numbers, there will be no remainder. Upload yourID_random.py file using the option available at the end of this question. You do not need to zip this file. Comments are not necessary. A sample output is available here (the user input is colored).

Create a program named yourID_random.py student ID). Add the following functionality to your program. ● Use python's random module to pick two random integers between the range [10,100] (inclusive). Suppose, the minimum and the maximum of these two integers are start and stop, respectively. Print the values of start and stop, in this order, to the screen. Hint: use built-in functions max() and min(). . Write a precondition, event-controlled loop (i.e., a while loop), (replace your/D with your Carleton ● that prints all numbers returned by range(start, stop, 3) to the terminal. Ask the user repeatedly for a positive integer x, (input validation is not necessary), until the user enters "quit". If x falls outside this range [start, stop] (inclusive), print all those numbers that are in [start, stop], and that divide x. That is, if x gets divided by those numbers, there will be no remainder. Upload yourID_random.py file using the option available at the end of this question. You do not need to zip this file. Comments are not necessary. A sample output is available here (the user input is colored).

Programming Logic & Design Comprehensive

9th Edition

ISBN:9781337669405

Author:FARRELL

Publisher:FARRELL

Chapter11: More Object-oriented Programming Concepts

Section: Chapter Questions

Problem 2GZ

See similar textbooks

Similar questions

In python. Include docstring. Please follow requirements as listed below. Thanks. You are given a puzzle consisting of a row of squares that contain nonnegative integers, with a zero in the rightmost square. Keep in mind that it's possible for other squares to contain a zero. You have a token that starts on the leftmost square. On each turn, the token can shift left or right a number of squares exactly equal to the value in its current square, but is not allowed to move off either end. For example, if the row of squares contains these values: [2, 4, 5, 3, 1, 3, 1, 4, 0], then on the first turn the only legal move is to shift right two squares, because the starting square contains a 2, and the token can't move off the left end. The goal is to get the token to the rightmost square (that contains zero). This row has a solution (more than one), but not all rows do. If we start with the row [1, 3, 2, 1, 3, 4, 0], then there is no way for the token to reach the rightmost square. Write a…
Python - question down below This is my code for a horse racing betting game Code : import randomdef Readysetgo(horses):shuffled = random.sample(horses,len(horses))return shuffled horses = [1,2,3,4]ch=1balance = 200while(ch!=0):print("Please select from the following options 1-6")print("1. Place an exact bet")print("2. Place an exactabox bet")print("3. Place a trifectabet")print("4. Please a trifectabox bet")print("5. See your USD balance")print("6. Exit")ch = int(input())if ch==1:balance -= 10shuffled = Readysetgo(horses)print("Guess the exact winning order of the top two horses.")x,y = input().split()x = int(x)y = int(y)if x==shuffled[0] and y==shuffled[1]:balance += 100elif ch==2:balance -= 5shuffled = Readysetgo(horses)print("Guess the top two horses in any order.")x,y = input().split()x = int(x)y = int(y)if (x==shuffled[0] and y==shuffled[1]) or (x==shuffled[1] and y==shuffled[0]):balance += 50elif ch==3:balance -= 25shuffled = Readysetgo(horses)print("Guess the exact winning…
Please help!! I don't understand most of the code. Please leave comments as explanations on every line of the code. def repeatChar(numRepeats, outputChar):'''output the outputChar numRepeats times'''for colNo in range(numRepeats):print(outputChar, end='')def Parrallelogram(side, char):for i in range(side):repeatChar(i+1, char)print()for i in range(side):repeatChar(i+1, ' ')repeatChar(side-i-1, char)print()def outlineParallelogram(side, char):for i in range(side):if (i < 1):repeatChar(1, char)elif(i == 1):repeatChar(2, char)else:repeatChar(1, char)repeatChar(i-1, ' ')repeatChar(1, char)print()for i in range(side-1):if (i == side-2):repeatChar(side-1, ' ')repeatChar(1, char)else:repeatChar(i+1, ' ')repeatChar(1, char)repeatChar(side-i-3, ' ')repeatChar(1, char)print()print('This program will show a parallelogram and its outline')number = int(input('How long do you want each side to be? '))character = input('Enter the character: ')Parrallelogram(number,…
Create an application that generates a histogram so you can examine the frequency distribution of a collection of values visually. A random number of integers between 1 and 100 inclusive should be entered into the programme. After that, it should generate a chart like the one below, showing how many input values went between 1 and 10, 11 to 20, and so on.For each number entered, print one asterisk. 1 - 10 | ***** 11 - 20 | ** 21 - 30 | ******************* 31 - 40 | 41 - 50 | *** 51 - 60 | ******** 61 - 70 | ** 71 - 80 | ***** 81 - 90 | ******* 91 – 100 | ********
please please Here's the python script for the lab. Can you answer only 11.a,b,c,d,e? PLease from scipy import randomimport numpy as npimport matplotlib.pyplot as plt i = 1 # set a value for current in Amperes (A)B = 2 # set a value for magnetic field in Tesla (T)R = 1 # set length of wire in meters (m)a1 = -R # set left end point of straight wireb1 = R # set right end point of straight wirea2 = 0 # set left end point of curved wireb2 = np.pi # set end point of curved wireN = 1000 # set number of intervals N def f(x):return 1 def g(x):return np.sin(x) # generate an array of all zeroesarray1 = np.zeros(N)array2 = np.zeros(N) # change each entry in array to a random number between a and bfor i in range(N):array1[i] = random.uniform(a1,b1)array2[i] = random.uniform(a2,b2) # compute summation over all random numbers in arrayintegral_straight = 0.0integral_semicirc = 0.0 for i in array1:integral_straight += f(i) for i in array2:integral_semicirc += g(i) # compute the average value for…
Write an application that determines whether a phrase entered by the user is a palindrome. A palindrome is a phrase that reads the same backward and forward without regarding capitalization, spaces or punctuation. And it will allow the user to enter as many phrases as he likes after each iteration.
Create a program which will read a phrase from the user and create a framed version of it for printing. For example, the phrase "hello world"would result in: ********* * hello * * world * ********* Whereas the phrase "the sky is falling"might be: *********** * the * * sky * * is * * falling * *********** Or: *********** * the * * sky * * is * * falling * *********** Or even: *********** * the * * sky * * is * * falling * *********** Depending on whether or not the user asked for left, centered, or right justification — respectively — of the phrase's words within the frame. Note how the frame exactly fits the phrase based on the longest word within. Neat, eh? The phrase "O | -+- | /-\"when centered would become: ******* * O * * | * * -+- * * | * * /-\ * ******* (Okay, so it's a sad excuse for a stick figure, but hey! I've never claimed to be a great good decent artist, now…
Create and construct an application that receives a string from the user, counts the number of each lowercase vowel (a, e, i, o, and u) that appear in the entire string, and outputs the results. Give each vowel its own counter. Count and publish the amount of characters that aren't vowels as well.
The files provided in the code editor to the right contain syntax and/or logic errors. In each case, determine and fix the problem, remove all syntax and coding errors, and run the program to ensure it works properly. // Application looks up home price // for different floor plans // allows upper or lowercase data entry import java.util.*; public class DebugEight3 { publicstaticvoidmain(String[] args) { Scanner input =newScanner(System.in); String entry; char[] floorPlans = {'A','B','C','a','b','c'} int[] pricesInThousands = {145,190,235}; char plan; int x, fp =99; String prompt ="Please select a floor plan\n"+ "Our floorPlanss are:\n"+"A - Augusta, a ranch\n"+ "B - Brittany, a split level\n"+ "C - Colonial, a two-story\n"+ "Enter floorPlans letter"; System.out.println(prompt); entry = input.next(); plan = entry.charAt(1); for(x =0; x < floorPlans.length; ++x) if(plan == floorPlans[x]) x = fp; if(fp =99) System.out.println("Invalid floor plan code entered")); else { if(fp…
Please code in python In an alternate reality, chemistry Professors Hodge and Sibia have teamed up to design a chemical compound X such that when X is added to Dan’s favorite food (saltine crackers), it’ll make him despise it. For this, they are working with 6 kinds of extracts: Singleton Extracts: berries (B), green veggies (G), dairy (D) Combination Extracts: icecream (I), salad (S), and cheese sauce (C). Like regular food, mixing two extracts of the same kind will result in an extract of the same kind (eg. mixing berries B with berries B will result in berries B). Mixing two singleton extracts will result in a combination extract, using these rules: Berries (B) + Green Veggies (G) = Salad (S) Berries (B) + Dairy (D) = Icecream (I) Green Veggies (G) + Dairy (D)= Cheese Sauce (C) Mixing two combination extracts will result in a singleton extract closest to them. For example, Icecream (I) + Salad (S) is closest to Berries (B) since both Icecream and Salad extracts require using…
Give DETAILED EXPLANATION about how this code works. Also, show output of the program while pointing out what it does. (IF CAN MAKE THE PROGRAM BETTER, I WILL RATE IT ASAP.) Thanks in advance. #include "tchar.h" #include <stdio.h> #include <conio.h> #include <string.h> #include <stdlib.h> #include <iostream> using namespace std; struct allocList { char* startAlloc; char* endAlloc; int fk_pid; allocList* nxt; }; struct procList { int pid; int jobStatus; char* startProc; char* endProc; procList* nxt; }; bool initProc(procList*&, int*, int); bool initAlloc(allocList*&, int*, int); void doFirstFit(int arrMemory[], int arrJobs[], int m, int n); void cmptFragmentation(procList*, allocList*); int search(procList*, int); int _tmain(int argc, _TCHAR* argv[]) { int arrMemory[] = { 100, 500, 200, 300, 600 }; int arrJobs[] = { 212, 17, 112, 426, 500 }; int m = (sizeof(arrMemory) / sizeof(arrMemory[0])); int n = (sizeof(arrJobs) / sizeof(arrJobs[0]));…
Write a script that lets the user enter a string and displays the character that appears most frequently in the string. The following below must be used Use count, alphabet_string = 'abcd….z', lower(), find(), and len(). This is what I have so far. It doesn't yet work correctly but I need help incorporating the other required commands into my module. def main(): string =input('Enter a string:') string =string.lower() result =0 count =0 for integer in range(len(string)): total = string[integer] result = total count = string.count(total) print('Most frequent character is',result) print(count)main()