Answered: Consider a series of numbers given…

Consider a series of numbers given below.Calculate sum values for the below series. 7.7 7.4 7.1 6.8 6.5 6.2 5.9 a. Sum= 45.6 b. Sum = 46.7 c. Sum= 46.5 d. Sum = 47.6

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

Given a positive integer, N, the ’3N+1’ sequence starting from N is defined as follows:If N is an even number, then divide N by two to get a new value for NIf N is an odd number, then multiply N by 3 and add 1 to get a new value for N.Continue to generate numbers in this way until N becomes equal to 1For example, starting from N = 3 the complete ’3N+1’ sequence would be:3, 10, 5, 16, 8, 4, 2, 1Write code to ask the user to enter a positive integer (N) in the main() function. Write a function sequence()that receives the integer value N and display the ‘3N+1’ sequence starting from the integer value that wasreceived (entered by the user). The function must also count and return the numbers that the sequenceconsists of. The returned value must be displayed from the main() function.
If you cube each integer in turn from 10 to one million, you will see that 11 of them produce a result that is a palindrome (the same forwards as backwards). For example, 11×11×11=133111×11×11=1331. Write a single line of code to produce those 11 numbers and their cubes in a list of tuples.
Q1.nq. 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. .
python: how to count number of "number" like "23", "5, and "1" of "xxx"? { "create": "2022-01-01T01:01:01", "xxx": [ "23", "5", "1" ] }
2022-02-14 20:52:35 Write the primitive counting results for your 40 sheep: 40= For example, the answer for "14" would be (1,1,1,0), meaning that the first division of sheep had none left over, but every other division of sheep had a leftover sheep. Include the commas and the parentheses in your answer.
What is the median of the following list of numbers? [11, 20, 8, 2, 7, 3, 19, 16, 13, 17]
1.Given a positive integer, N, the ’3N+1’ sequence starting from N is defined as follows:If N is an even number, then divide N by two to get a new value for NIf N is an odd number, then multiply N by 3 and add 1 to get a new value for N.Continue to generate numbers in this way until N becomes equal to 1For example, starting from N = 3 the complete ’3N+1’ sequence would be:3, 10, 5, 16, 8, 4, 2, 1Write c++ code to ask the user to enter a positive integer (N) in the main() function. Write a function sequence()that receives the integer value N and display the ‘3N+1’ sequence starting from the integer value that wasreceived (entered by the user). The function must also count and return the numbers that the sequenceconsists of. The returned value must be displayed from the main() function.
Choose the correct answer from the number of the set S={x | x is the square of an integer x<100} is:a) {0,2,4,5,958,49,56,99,12}b) {0,1,4,9,16,25,36,49,64,81}c) {0,1,4,9,16,25,36,49,64,121}
Start with any positive number n. If n is even divide it by 2, if n is odd multiply by 3 and add 1. Repeat until n becomes 1. The sequence that is generated is called a bumpy sequence. For example, the bumpy sequence that starts at n = 10 is: 10, 5, 16, 8, 4, 2, 1and the one that starts at 11 is11, 34, 17, 52, 26, 13, 40, 20, 10, 5, 16, 8, 4, 2, 1 Write a function named lengthBumpy that returns the length of the bumpy sequence generated by its integer argument. The signature of the function is int lengthBumpy(int n) Examples:lengthBumpy(10) returns 7, and lengthBumpy(11) returns 15. You may assume that the argument n is positive and that the sequence converges to 1 without arithmetic overflow.
add a green leaf on the right side of flower my code n = 800; A = 1.995653; B = 1.27689; C = 8; r=linspace(0,1,n); theta=linspace(-2,20*pi,n); [R,THETA]=ndgrid(r,theta); % define the number of petals we want per cycle. Roses have 3 and a bit. petalNum=3.6; x = 1 - (1/2)*((5/4)*(1 - mod(petalNum*THETA, 2*pi)/pi).^2 - 1/4).^2; phi = (pi/2)*exp(-THETA/(C*pi)); y = A*(R.^2).*(B*R - 1).^2.*sin(phi); R2 = x.*(R.*sin(phi) + y.*cos(phi)); X=R2.*sin(THETA); Y=R2.*cos(THETA); Z=x.*(R.*cos(phi)-y.*sin(phi)); % % define a red map for our rose colouring red_map=linspace(1,0.25,10)'; red_map(:,2)=0; red_map(:,3)=0; clf surf(X,Y,Z,'LineStyle','none') view([-40.50 42.00]) colormap(red_map)
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.
I want to add one green leaf on the right side of the flower how can I do this?? What should I add to my code for this? Thanks for help My code n=800;r=linspace(0,1,n);theta=linspace(0,2*pi,n);[R,THETA]=ndgrid(r,theta);% define the number of petals we want per cycle. Violets have 5!petalNum=5;x = 1 - (1/2)*((5/4)*(1 - mod(petalNum*THETA, 2*pi)/pi).^2 - 1/4).^2;% update the formula for phi to stop the spiralling effectphi = (pi/2)*exp(-2*pi/(8*pi));y = 1.95653*(R.^2).*(1.27689*R - 1).^2.*sin(phi);R2 = x.*(R.*sin(phi) + y.*cos(phi));X=R2.*sin(THETA);Y=R2.*cos(THETA);Z=x.*(R.*cos(phi)-y.*sin(phi));% color code for blueviolet RGB 138,43,226% Indigo rgb value (75,0,130)mapSize=20;blue_map=linspace(138,75,mapSize)';blue_map(:,2)=linspace(43,0,mapSize)';blue_map(:,3)=linspace(226,130,mapSize)';% and a pretty bit in the middlegold_map=[255 215 0; 250 210 0];% combine to form a full flower mapviolet_map=[gold_map; blue_map];% Now lets plot it and try and pick an attractive…