Write the code in Python. There’s 2 examples I attached the pictures. Ask for a horizontal multiplier, a vertical multiplier, and a constantfrom the user (as floats, or real numbers).For every cell in a 10x8 grid:Move the turtle to position (25 x horiz cell, -25 x vert cell).Draw a circle with radius(horiz mult x horiz cell + vert mult × vert cell + constant)• Program successfully runs -• Program creates a correct map given the input -• Readable and well-formatted program code -Example output for values (-1, 0.5, 5):Example output for values (1, -2, –5):O OKO O0O OOO OOO O O OO O

Answer:- from turtle import * def main(): hor = float(input("horizontal multiplier:"))…

Answered: n the user (as floats, or real…

n the user (as floats, or real numbers). every cell in a 10x8 grid: Move the turtle to position (25 x horiz cell, –25 x v Draw a circle with radius riz mult x horiz cell + vert mult x vert cell +

C++ Programming: From Problem Analysis to Program Design

8th Edition

ISBN:9781337102087

Author:D. S. Malik

Publisher:D. S. Malik

Chapter8: Arrays And Strings

Section: Chapter Questions

Problem 24PE

See similar textbooks

Similar questions

Q. Given a 2d grid map of '1's (land) and '0's (water),count the number of islands.An island is surrounded by water and is formed byconnecting adjacent lands horizontally or vertically.You may assume all four edges of the grid are all surrounded by water. Example 1: 11110110101100000000Answer: 1 Example 2: 11000110000010000011Answer: 3""" def num_islands(grid): count = 0 for i in range(len(grid)): for j, col in enumerate(grid[i]): if col == 1: dfs(grid, i, j) count += 1 Please code it. .
A popular word game involves finding words from a grid of randomly generatedletters. Words must be at least three letters long and formed from adjoining letters.Letters may not be reused and it is valid to move across diagonals. As an example,consider the following 4 * 4 grid of letters: A B C DE F G HI J K LM N O P The word “FAB” is valid (letters in the upper left corner) and the word “KNIFE”is valid. The word “BABE” is not valid because the “B” may not be reused. Theword “MINE” is not valid because the “E” is not adjacent to the “N”. Write a program that uses a 4 * 4 two-dimensional array to represent the gameboard. The program should randomly select letters for the board. You may wishto select vowels with a higher probability than consonants. You may also wish toalways place a “U” next to a “Q” or to treat “QU” as a single letter. The programshould read the words from the text file words.txt (included on the website withthis book) and then use a recursive algorithm to…
A grid needs a system for numbering the tiles in order to allow random-access lookup.For instance, the rows and columns of a square grid provide a natural numbering for the tiles. Create plans for hexagonal and triangular grids. Create a rule for identifying the neighbourhood (i.e., nearby tiles) of a certain tile in the grid using the numbering scheme. For instance, the neighbourhood of tile I j in a four-connected square grid with indices of I for rows and j for columns may be described as neighbourhood(i, j) = I 1, j, I j 1.
Given the following function, what happens if a[] contains just one element that doesn't match val? int binarySearch(int a[], int first, int last, int val){ if (first > last) return -1; int middle = (first + last) / 2; if (a[middle] == val) return middle; if (a[middle] < val) return binarySearch(a, middle+1, last, val); else return binarySearch(a, first, middle-1, val);} Group of answer choices binarySearch never calls itself again and terminates (recursion never happens) binarySearch calls itself once then terminates (recursion happens once) binarySearch calls itself twice then terminates (recursion happens twice) binarySearch calls itself 3 times then terminates (recursion happens 3 times)
Execute the following using Array Implementation. Use diagrams in showing your final answer A ENQUEUE(A) ENQUEUE(B) ENQUEUE(C) DEQUEUE() ENQUEUE(A) ENQUEUE(B) ENQUEUE(C) DEQUEUE() DEQUEUE() ENQUEUE(A) DEQUEUE() ENQUEUE(B) ENQUEUE(C) B PUSH (x, S) PUSH (y, S) PUSH (z, S) POP (S) PUSH (x, S) PUSH (y, S) POP (S) POP (S) C INSERT(Alice, 1, ) INSERT(Bob, 2, L) INSERT(Karen, 3, L) INSERT(Ram, 4, L) DELETE( 2, L) What will happen to your array?
A magic square is a square array of non-negative integers where the sums of the numbers on each row,each column, and both main diagonals are the same. An N × N occult square is a magic square with Nrows and N columns with additional constraints:• The integers in the square are between 0 and N, inclusive.• For all 1 ≤ i ≤ N, the number i appears at most i times in the square.• There are at least two distinct positive integers in the square.For example, the following is a 5 × 5 occult square, where the sums of the numbers on each row, eachcolumn, and both main diagonals are 7:0 0 0 3 42 4 0 0 10 0 3 4 05 0 0 0 20 3 4 0 0For a given prime number P, you are asked to construct a P × P occult square, or determine whether nosuch occult square exists.InputInput contains a prime number: P (2 ≤ P ≤ 1000) representing the number of rows and columns in theoccult square.OutputIf there is no P × P occult square, simply output -1 in a line. Otherwise, output P lines, each contains Pintegers…
Computer Science There is an n × n grid of squares. Each square is either special, or has a positive integer costassigned to it. No square on the border of the grid is special.A set of squares S is said to be good if it does not contain any special squares and, starting fromany special square, you cannot reach a square on the border of the grid by performing up, down,left and right moves without entering a cell belonging to S. 5 3 4 9 4 X 3 6 1 9 X 4 1 2 3 5 - Design an algorithm which receives an arbitrary n × n grid, runs in time poly-nomial in n and determines a good set of squares with minimum total cost.
You are given a 2 by n grid, where the cell on row i column j contains a non-negative number ai,j . You can start at either cell in the lefttmost column, and your goal is to reach either cell in the rightmost column by a sequence of moves. You can move to an adjacent cell (if it exists) in each of the 4 cardinal directions (up,down, left and right). A path achieves a score equal to the sum of values in its cells. Note that a cell which is used twice in a path only counts its value once to the score of that path.Design an algorithm which runs in O(n) time and finds a path of minimum score from the leftmost column to the rightmost column.
Write a program that asks user to enter number of vertices in an undirected graph and then the adjacency matrix representing the undirected graph. The program, then, must display whether the given graph is connected or not. Sample 1Enter number of vertices: 3Enter adjacency matrix:0 1 11 0 01 0 0The graph is connected.
Find out the vowels in a word and print out how many words have the exact same type of vowels. Number of vowels matters and the case does not matter cat is the same as CAt Words are delimited by space only a.bhcj is a single word. Vowels should be in alphabetical order. If there are words with no vowels, nothing is printed before the colon. :1 eo:2 eoo:1 We want a map-reduce program in python
Write a python program to: Find all rows with a title of "Limitless" Find all rows with a director of "Robert Rodrigues" and a type of "Movie" Find all rows with either a date_added of "2019-07-31" or director of "Robert Altman" Find all rows with a director of "Orson Welles","Aditya Kripalani" or "Sam Raimi". Find all rows that have a date_added value between May 1, 2019 and June 1,2019 Drop all rows with a NaN value in the director column. Identify all days when only one movie was added to Netflix catalog. Note: the question come with a csv file that contains all the necessary data. the csv file looks like this
CThere is a road, the starting coordinate is 0, and the coordinatesof the line are given to draw a black line, for example, five linesegments for drawing black lines, (5, 6), (1, 2), (4, 8), (7 , 9)and (5, 8), as shown belowOutput:Length of the black line on the road: 6Maximum number of overlaps: 3Maximum number of overlaps Length of black line: 2 The first row is a positive integer N, there are N line segments for drawing black lines.Then there are the integer values of the start point coordinates and the end point coordinates of the line segment of the black line. Sample 15160 180150 200280 300290 330190 210Output:Length of the black line on the road: 110Maximum number of overlaps: 2Maximum number of overlaps Length of black line: 40 Sample 21120 120Output:Length of the black line on the road: 0Maximum number of overlaps: 0Maximum number of overlaps Length of black line: 0