All categories

3 years ago

[20 points] 3.3 Code Practice: Question 2

Computers and Technology

1 answer:

igor_vitrenko [27]3 years ago

3 0

Answer:

See explanation

Explanation:

The attachment show that you've attempted the question already.

I'll assist in making corrections to your source code.

First, edit line 5 to

if(r<= 255 and g<=255 and b <=255):

Then edit line 8 to:

if(r>= 255):

Then edit line 11 to:

if(g>= 255):

Lastly, edit line 14 to:

if(b>= 255):

<em>Other part of the attachment is correct</em>

You might be interested in

Write a recursive function that takes a non-negative integer as an argument and displays the same number in reverse order (i.e.

avanturin [10]

Answer:

Following are the program in C++ language

#include<iostream> // header file

using namespace std; // namespace std

int reverse(int n1); // function prototype

int main() // main function()

{

int num; // Variable declaration

cout << "Enter the number" << endl;

cin >> num; // Read the number bu the user

cout<<"After Reverse the digit:\n";

int res= reverse(num); // calling function reverse

cout<<res; // display

}

int reverse(int n1) // function definition of reverse

{

if (n1<10) // checking the base condition

{

return n1;

}

else

{

cout << n1 % 10; // Printed the last digit

return reverse(n1/10); // calling itsself

}

Output:

Enter the number:

76538

After Reverse the digit:

83567

Explanation:

Following are the description of the program

In the main function read the number by user in the "num" variable of int type.

Calling the reverse and pass that "num" variable into it.

After calling the control moves to the body of the reverse function.In this function we check the two condition

1 base condition

if (n1<10) // checking the base condition

{

return n1;

}

2 General condition

else

{

cout << n1 % 10; // Printed the last digit

return reverse(n1/10); // calling itsself

}

Finally return the reverse number and display them into the main function.

5 0

4 years ago

Define Based Assessment

Oduvanchick [21]

Explanation:

In an educational setting, standards-based assessment is assessment that relies on the evaluation of student understanding with respect to agreed-upon standards, also known as "outcomes". The standards set the criteria for the successful demonstration of the understanding of a concept or skill -WIKIPEDIA

8 0

3 years ago

On the CallCenterReport worksheet, add formulas that will summarize the issues for the department entered in cell B3. In cell B6

grin007 [14]

Answer:

In cell B6, formula =INDEX(INDIRECT($B$3),A6)

CallCenter Worksheet Details:

The image of the CallCenter Report worksheet for reference to the question asked is attached below.

Explanation:

Firtsly, an absolute reference in Excel refers to a reference that is "locked" so that rows and columns won't change when copied. To do this,we put a $ dollar sign ( =A$1,) before the row coordinate to lock only the row.

A relative reference in Excel is a cell address without the $ sign in the row and column coordinates example A1.

Having known what absolute and relative reference are, we wlil write the below formula in cell B6 that will later be copied to cell B9:

: =INDEX(INDIRECT($B$3),A6)

5 0

3 years ago

Why was the microchip essential to improving computers?

-BARSIC- [3]

Because it downsized the scale of the computer itself.

5 0

3 years ago

A degree-constrained minimum spanning tree is a minimum spanning tree (MST) where the maximum vertex degree is limited to a cert

Bingel [31]

Answer:

A spanning tree is a subset of Graph G, which has all the vertices covered with minimum possible number of edges. Hence, a spanning tree does not have cycles and it cannot be disconnected..

By this definition, we can draw a conclusion that every connected and undirected Graph G has at least one spanning tree. A disconnected graph does not have any spanning tree, as it cannot be spanned to all its vertices.

Spanning Trees

We found three spanning trees off one complete graph. A complete undirected graph can have maximum nn-2 number of spanning trees, where n is the number of nodes. In the above addressed example, n is 3, hence 33−2 = 3 spanning trees are possible.

General Properties of Spanning Tree

We now understand that one graph can have more than one spanning tree. Following are a few properties of the spanning tree connected to graph G −

A connected graph G can have more than one spanning tree.

All possible spanning trees of graph G, have the same number of edges and vertices.

The spanning tree does not have any cycle (loops).

Removing one edge from the spanning tree will make the graph disconnected, i.e. the spanning tree is minimally connected.

Adding one edge to the spanning tree will create a circuit or loop, i.e. the spanning tree is maximally acyclic.

Explanation:

8 0

3 years ago