All categories

3 years ago

What does the term hardware refer to?

Computers and Technology

1 answer:

Jobisdone [24]3 years ago

6 0

Answer:

The physical components that a computer is made of

Explanation:

as u can see these components and u can repaire these components if they got damaged

You might be interested in

To edit the text in a smartart graphic, what must be done first ?

ICE Princess25 [194]

C Hope this helps :D

8 0

3 years ago

Read 2 more answers

Given class triangle (in files triangle.h and triangle.cpp), complete main() to read and set the base and height of triangle1 an

kow [346]

The C++ program that would complete the main () and set the base and height of triangle1 and of triangle2 is:

main.cpp

#include <iostream>

#include "Triangle.h"

using namespace std;

int main()

{

Triangle Tri1;

Triangle Tri2;

double base1, height1, base2, height2;

cout << "Enter a base for your Triangle1: ";

cin >> base1;

cout << "Enter a height for your Triangle1: ";

cin >> height1;

cout << endl;

cout << "Enter a base for your Triangle2: ";

cin >> base2;

cout << "Enter a height for your Triangle2: ";

cin >> height2;

cout << endl;

cout << "################################" << endl;

cout << "Triangle with larger area:" << endl;

if ((0.5)*base1*height1 > (0.5)*base2*height2){

Tri1.setValues(base1, height1);

Tri1.getValues();

cout << "Area: " << Tri1.getArea() << endl << endl;

}

else{

Tri2.setValues(base2, height2);

Tri2.getValues();

cout << "Area: " << Tri2.getArea() << endl;

}

return 0;

}

Read more about C++ programs here:

brainly.com/question/20339175

#SPJ1

3 0

2 years ago

How do you know when a spreadsheet object is active in a powerpoint presentation?

Ira Lisetskai [31]

It should be under lined, when you press it it should have a different colour

4 0

4 years ago

what is the largest possible number of internal nodes in a redblack tree with black height k? what is the smallest possiblenumbe

Elina [12.6K]

Answer:

A Red Black Tree is a type of self-balancing(BST) in this tree ,each node is red or black colored. The red black tree meets all the properties of the binary search tree, but some additional properties have been added to a Red Black Tree.

A Red-Black tree's height is O(Logn) where (n is the tree's amount of nodes).

In a red-black tree with black height k

The maximum number of internal nodes is $2^{2k}$ $-1$ .

The smallest possible number is $2^{k}$ $-1$ .

7 0

3 years ago

HELP ME ASAP

ruslelena [56]

it is title page and give me a ❤

3 0

3 years ago