Growing Triangles, cont. 1 2 3 The first figure is made up of three line segments of equal length. You can think of the second figure as made up of nine segments of that same length, and so on. 5. Find the number of segments of the given length that would be needed for the tenth figure in this sequence. 6. Explain how you would find the number of segments of the given length that would be needed for the 100th figure in this sequence. 7. Write a rule for determining the number of segments of the given length for any figure in this sequence. Explain why your rule works.

Growing Triangles, cont. 1 2 3 The first figure is made up of three line segments of equal length. You can think of the second figure as made up of nine segments of that same length, and so on. 5. Find the number of segments of the given length that would be needed for the tenth figure in this sequence. 6. Explain how you would find the number of segments of the given length that would be needed for the 100th figure in this sequence. 7. Write a rule for determining the number of segments of the given length for any figure in this sequence. Explain why your rule works.

Database System Concepts

7th Edition

ISBN:9780078022159

Author:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Publisher:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Chapter1: Introduction

Section: Chapter Questions

Problem 1PE

See similar textbooks

Similar questions

Q1. 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.
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. .
Please help computer graphics question Let Z be the set of real integers and R the set of real numbers. The sampling process may be viewed as partitioning the x-y plane into a grid, with the central coordinates of each grid being from the Cartesian product Z2, that is a set of all ordered pairs (zi, zj), with zi and zj being integers from Z. Then, f(x, y) is a digital image if (x, y) are integers from Z2 and f is a function that assigns a gray-level value (that is, a real number from the set R) to each distinct coordinate pair (x, y). What happens to the digital image if the gray levels also are integers? a) The Digital image then becomes a 2-D function whose coordinates and amplitude values are integers b) The Digital image then becomes a 1-D function whose coordinates and amplitude values are integers c) The gray level can never be integer d) None of the mentioned
The Problem A Zeckendorf number is defined for all positive integers as the number of Fibonacci numbers which must be added to equal a given number k. So, the positive integer 28 is the sum of three Fibonacci numbers (21, 5, and 2), so the Zeckendorf number for k = 28 is three. Wikipedia is a satisfactory reference for our purposes for more details of the Zeckendorf and Fibonacci numbers. In both cases, you do not need to read the entire Wikipedia entry. Your assignment is to write two ARM assembly language functions which calculate Zeckendorf and Fibonacci numbers. Zeck function The first function, which should be named zeck, receives an integer parameter in register zero. This will be the variable k we discussed above. Your code should return the Zeckendorf number for k in register zero when complete. If the parameter k is zero, return zero. If the parameter k is negative, return minus 1. If the parameter k is too large to calculate, return minus 1. Fib function The other function,…
For n=5 , In base there are more than 5 stars, however it should be equal to 5 like I shared picture in Question. For 10, In base there are more than 10 stars, however it should be equal to 10 like I shared picture in Question. Please solve.
T=4, n=12 and A=(3,5,8,8,9,16,29,41,50,63,64,67). Draw the corresponding walkthrough as shown in P.146.
Dissecting a Fibonacci rectangle Given a rectangle whose sides are two consecutive Fibonacci numbers, design an algorithm to dissect it into squares with no more than two of the squares be of the same size. What is the time e!ciency class of your algorithm?
Information is present in the screenshot and below. Based on that need help in solving the code for this problem in python. The time complexity has to be as less as possible. Output Format For each query, output one line containing the length of the last movie Richie watches, without the credits, given the strategy described in the problem statement. If Richie can't watch any movie, output -1. Sample Input 0 8 148 116 157 100 169 15 188 98 91 68 165 70 145 2 11 6 3 2 6 52 12 2 6 13 7 0 4 2 3 Sample Output 0 90 154 -1 The actual code n = int(input())movies = []for i in range(n): r,c = list(map(int,input().rstrip().split(" "))) movies.append([r,c]) q = int(input())for cc in range(q): s,e,a,k = list(map(int,input().rstrip().split(" "))) # solve for answer here
I need help figuring out the following HW question
Consider a line with the endpoints below. Calculate and list the intermediate points required to draw the lines using the Bresenham algorithm: i) (4,2) and (12,9) ii) (15,7) and (23,17) iii) (5,7) and (14,14),
Imagine you have a square matrix, where each cell (pixel) is either black or white. Design an algorithm to find the maximum subsquare such that all four borders are filled with black pixels.
Correct answer will be upvoted else downvoted. table can be addressed as a square shape with stature h and width w, isolated into h×w cells. Let (i,j) signify the cell in the I-th line and the j-th segment of the square shape (1≤i≤h; 1≤j≤w). Into every cell of the table you can either put a plate or keep it unfilled. As every visitor must be situated close to their plate, you can just put plates on the edge of the table — into the first or the last line of the square shape, or into the first or the last segment. Officially, for every cell (i,j) you put a plate into, no less than one of the accompanying conditions should be fulfilled: i=1, i=h, j=1, j=w. To make the visitors agreeable, no two plates should be placed into cells that have a typical side or corner. All in all, if cell (i,j) contains a plate, you can't place plates into cells (i−1,j), (i,j−1), (i+1,j), (i,j+1), (i−1,j−1), (i−1,j+1), (i+1,j−1), (i+1,j+1). Put whatever number plates on the table as could be…