All categories

3 years ago

6.5 code practice edhesive questions 1-4

Computers and Technology

1 answer:

Anuta_ua [19.1K]3 years ago

7 0

Answer:

//We need to sum various numbers using a python program, and then store the numbers in a text file.

def sumnum():

file2 = open("numbers2.txt","w")

i=5

while i != 0:

number=input("Enter the no.")

file2.write(number)

file2.write("\n")

i = i -1

file2.close()

file=open("numbers2.txt", "r+")

number = 0

sum2 = 0

for number in file:

sum2 =sum2 + int(number)

print(sum2)

file2.close()

sumnum()

Explanation:

Please check the answer section.

You might be interested in

What are examples of templates the Input Mask Wizard offers? Check all that apply.

Vesna [10]

The answer is A B AND D mark me brainliest?

5 0

3 years ago

Read 2 more answers

Write a program in c++ to displaypascal’s triangle?

Harman [31]

C++ Program to Print Pascal's Triangle

#include<iostream> //header file

using namespace std;

//driver function

int main()

{

int r;/*declaring r for Number of rows*/

cout << "Enter the number of rows : ";

cin >> r;

cout << endl;

for (int a = 0; a < r; a++)

{

int value = 1;

for (int b = 1; b < (r - a); b++) /*Printing the indentation space*/

{

cout << " ";

}

for (int c = 0; c <= a; c++) /*Finding value of binomial coefficient*/

{

cout << " " << value;

value = value * (a - c) / (c + 1);

}

cout << endl << endl;

}

cout << endl;

return 0;

}

Output

Enter the number of rows : 5

1 1

1 2 1

1 3 3 1

1 4 6 4 1

7 0

3 years ago

Electronically, or on paper draw a Binary Search Tree using the values below. Note: Insert each value into the tree in order fro

maria [59]

Answer:

A.) in order traversal - 9 32 35 14 27 25 2 7 29

B.) pre-order traversal - 25 14 32 9 35 27 7 2 29

C.) post-order traversal - 9 35 32 27 14 2 29 25

Explanation:

Given - 25, 14, 7, 32, 27, 2, 29,9,35

To find - On a separate electronic page or sheet of paper:

1. List the values using in order traversal

2. List the values using pre-order traversal

3. List the values using post-order traversal

Proof -

Given values are -

25, 14, 7, 32, 27, 2, 29,9,35

1.)

In order is -

9 32 35 14 27 25 2 7 29

2.)

Pre-order is - (Root left right)

List nodes of first time visit

25 14 32 9 35 27 7 2 29

3.)

Post-order is - (Left Right Root)

List nodes of third time visit

9 35 32 27 14 2 29 25

5 0

3 years ago

What are the different types of topology? in details

wlad13 [49]

Answer:

<h2> NETWORK TOPOLOGY .</h2>

This tefers to how nodes are connected to the network.

Types of topology.

Physical topology.
Logical topology.

In physical topology,nodes are connected physically using wires(cables).

Types of physical topology include:

Bus topology
Tree topology
Hybrid topology
Star topology
Ring topology.

Hope it helps you,any question so far...comment !!!

3 0

2 years ago

Read 2 more answers

Here is the list of problems to choose from:

olya-2409 [2.1K]

Answer:

There's a parking lot that is 600m² big. The lot must be able to hold at least 3 buses and 10 cars.

Each car takes up 6m² and each bus takes up 30m².

However, there can only be 60 vehicles in the lot at any given time.

The cost to park in the lot is $2.50 per day for cars and $7.50 per day for buses. The lot must make at least $75 each day to break even.

What is a possible car to bus ratio that would allow the lot to make profit?

3 0

3 years ago