A pyramid of size n is formed as follows: First, the base of the pyramid consists of n numbers, given as a list: [x_1, x 2, , x_n] The next layer contains n-1 numbers, obtained from adding each pair of adjacent numbers in the lower layer: [x 1 + x_2, x_2 + x_3, , x_(n-1) + x_n] The next layer contains n-2 numbers, obtained from adding each pair of adjacent numbers in the lower layer: [x_1 + 2x 2 + x_3, x_2 + 2x 3 +x 4, , x_(n-2) + 2x_(n-1) + x_n] This process is repeated until the top layer which has only 1 number. Create a function that takes in a list of numbers in the bottom layer and returns the only number at the top layer. For example, we can form a pyramid having a base of [2, e, 2, 1]:

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
icon
Related questions
Question
100%
A pyramid of size n is formed as follows:
First, the base of the pyramid consists of n numbers, given as a list: [x_1, x_2, ., x_n]
The next layer contains n-1 numbers, obtained from adding each pair of adjacent numbers in the lower layer: [x_1 + x_2, x_2 + x_3,
x_(n-1) + x_n]
The next layer contains n-2 numbers, obtained from adding each pair of adjacent numbers in the lower layer: [x_1 + 2x_2 + x_3, x_2 + 2x_3 + x_4, , x_(n-2) + 2x (n-1) + x_n]
This process is repeated until the top layer which has only 1 number.
Create a function that takes in a list of numbers in the bottom layer and returns the only number at the top layer. For example, we can form a pyramid having a base of [2, 0, 2, 1]:
9
4
5
2
3
2
1
>>> pyramid ( [1, 2])
3
>>> pyramid ([3, 2, 1])
8
>>> pyramid ([2, e, 2, 1])
Write the function pyramid (base) to return the number
the top of a pyramid with a given base.
Transcribed Image Text:A pyramid of size n is formed as follows: First, the base of the pyramid consists of n numbers, given as a list: [x_1, x_2, ., x_n] The next layer contains n-1 numbers, obtained from adding each pair of adjacent numbers in the lower layer: [x_1 + x_2, x_2 + x_3, x_(n-1) + x_n] The next layer contains n-2 numbers, obtained from adding each pair of adjacent numbers in the lower layer: [x_1 + 2x_2 + x_3, x_2 + 2x_3 + x_4, , x_(n-2) + 2x (n-1) + x_n] This process is repeated until the top layer which has only 1 number. Create a function that takes in a list of numbers in the bottom layer and returns the only number at the top layer. For example, we can form a pyramid having a base of [2, 0, 2, 1]: 9 4 5 2 3 2 1 >>> pyramid ( [1, 2]) 3 >>> pyramid ([3, 2, 1]) 8 >>> pyramid ([2, e, 2, 1]) Write the function pyramid (base) to return the number the top of a pyramid with a given base.
Expert Solution
steps

Step by step

Solved in 4 steps with 3 images

Blurred answer
Knowledge Booster
Hash Table
Learn more about
Need a deep-dive on the concept behind this application? Look no further. Learn more about this topic, computer-science and related others by exploring similar questions and additional content below.
Recommended textbooks for you
Database System Concepts
Database System Concepts
Computer Science
ISBN:
9780078022159
Author:
Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:
McGraw-Hill Education
Starting Out with Python (4th Edition)
Starting Out with Python (4th Edition)
Computer Science
ISBN:
9780134444321
Author:
Tony Gaddis
Publisher:
PEARSON
Digital Fundamentals (11th Edition)
Digital Fundamentals (11th Edition)
Computer Science
ISBN:
9780132737968
Author:
Thomas L. Floyd
Publisher:
PEARSON
C How to Program (8th Edition)
C How to Program (8th Edition)
Computer Science
ISBN:
9780133976892
Author:
Paul J. Deitel, Harvey Deitel
Publisher:
PEARSON
Database Systems: Design, Implementation, & Manag…
Database Systems: Design, Implementation, & Manag…
Computer Science
ISBN:
9781337627900
Author:
Carlos Coronel, Steven Morris
Publisher:
Cengage Learning
Programmable Logic Controllers
Programmable Logic Controllers
Computer Science
ISBN:
9780073373843
Author:
Frank D. Petruzella
Publisher:
McGraw-Hill Education