INPUT ORDER OF SQUARES -10 -4 -2 1 5 6 8 9 0 → 1² (-2)² (-4)² 5² 6² 8² 9² (-10)² OUTPUT 14 16 25 36 64 81 100

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
Given a zero-terminated sequence of non-zero integers in order from smallest to largest,
output the square of each number in order from smallest to largest.
Examples :
(NOTE, ORDER OF SQUARES listed below only to help you understand the computation, your
program needs to print the OUTPUT)
INPUT
ORDER OF SQUARES
-10 -4 -2 1 5 6 8 9 0 → 1² (-2)² (-4)² 5² 6² 8² 9? (-10)²
OUTPUT
1 4 16 25 36 64 81 100
INPUT
ORDER OF SQUARES
-12 -7 -1 3 20 0
(-1)² (3)² (-7)° (-12)² 20²
OUTPUT
19 49
144
400
Restrictions: The only list operations you are allowed to use on this exam
are as follows:
: len(list)
: list[k]
Create empty list : list = []
: list.append(k)
Length of a list
List accessor
List append
Hint : First, store the inputted sequence of data (without terminator) into a list. Next, note that
the largest square will either come from the first or last data item of the sequence (the 0 is a
terminator only) and the smallest square will come from the number that is closest to zero.
Transcribed Image Text:Given a zero-terminated sequence of non-zero integers in order from smallest to largest, output the square of each number in order from smallest to largest. Examples : (NOTE, ORDER OF SQUARES listed below only to help you understand the computation, your program needs to print the OUTPUT) INPUT ORDER OF SQUARES -10 -4 -2 1 5 6 8 9 0 → 1² (-2)² (-4)² 5² 6² 8² 9? (-10)² OUTPUT 1 4 16 25 36 64 81 100 INPUT ORDER OF SQUARES -12 -7 -1 3 20 0 (-1)² (3)² (-7)° (-12)² 20² OUTPUT 19 49 144 400 Restrictions: The only list operations you are allowed to use on this exam are as follows: : len(list) : list[k] Create empty list : list = [] : list.append(k) Length of a list List accessor List append Hint : First, store the inputted sequence of data (without terminator) into a list. Next, note that the largest square will either come from the first or last data item of the sequence (the 0 is a terminator only) and the smallest square will come from the number that is closest to zero.
Expert Solution
trending now

Trending now

This is a popular solution!

steps

Step by step

Solved in 2 steps with 1 images

Blurred answer
Knowledge Booster
Binary numbers
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