I have a very good example of the program you need written on Python. You can use this (sorry for bad tabulation):
import math
import math
def main():
function = input("Enter a function f(x):\n")
x = 0
y = 0
for rows in range(10,-11,-1):
for col in range(-10,11,1):
x=col
roundfx = round(eval(function))
if roundfx == rows:
print("o", end="")
if rows==0 and col==0 and not rows == roundfx:
print("+", end="")
if col == 0 and not rows == 0 and not rows == roundfx:
print("|", end="")
if rows==0 and not col==0 and not rows == roundfx:
print("-", end="")
else:
if not rows == 0:
if not col == 0:
if not rows == roundfx:
print(" ", end="")
print()
main()
Answer:
The correct answer to the following question will be "A spreadsheet".
Explanation:
- A spreadsheet is a software device used to access and stores data from such a database. The interaction between separate entities (in separate tables) is controlled by their specific columns.
- It's a programming program for arranging, evaluating and storing data in tabular format.
- The spreadsheets have been developed as computer-controlled analogs to paper reporting worksheets. The system runs on data decided to enter in table cells.
Therefore, a Spreadsheet is the right answer.
1-Input unit
2-output unit
3-storage
4-central processing unit
5-arithmetic and logic unit
Answer:
Altitude of the town(h1) = 1,196.8 m
Explanation:
Given:
Height of barometer(h) = 65 cm Hg = 0.65
Standard atmospheric pressure = 76 cm Hg = 0.76
Density of mercury(Pm) = 13,600 kg/m³
Density of air (Pa) = 1.25 kg/m³
Find:
Altitude of the town(h1)
Computation:
Pressure due column = Δp mercury column
(Pa)(h1) = (Pm)(h)
(1.25)(h1) = (13,600)(0.76-0.65)
(1.25)(h1) = 1,496
Altitude of the town(h1) = 1,196.8 m
Explanation:
The statement which says that a graph is complete means an undirected graph whose every pair of vertices is connected by an particular edge or unique edge.
An undirected graph is a graph whose edges soea not contain any direction means to which vertex they are directed.
A complete graph has an edge between every pair of vertices that exist in that graph.
