Ask question

Ask question

All categories

3 years ago

5

Jeff’s father is installing a do-it-yourself security system at his house. He needs to get a device from his workshop that conve

rts electric energy to sound energy. Which device is Jeff’s father looking for?

Computers and Technology

1 answer:

Alenkasestr [34]3 years ago

3 0

Answer:

Beeper

Explanation:

A buzzer pr beeper, as security device, converts electrical energy to sound energy.

You might be interested in

Write a method that takes two circles, and returns the sum of the areas of the circles.

11111nata11111 [884]

Answer:

public static double areaSum(Circle c1, Circle c2){

double c1Radius = c1.getRadius();

double c2Radius = c2.getRadius();

return Math.PI * (Math.pow(c1Radius, 2) + Math.pow(c2Radius, 2));

public static void main(String[] args){

Circle c1 = new Circle(6.0);

Circle c2 = new Circle(8.0);

areaSum(c1,c2);

}

Explanation:

7 0

2 years ago

Suppose we have two String objects and treat the characters in each string from beginning to end in the following way: With one

Simora [160]

Answer:

If all the character pairs match after processing both strings, one string in stack and the other in queue, then this means one string is the reverse of the other.

Explanation:

Lets take an example of two strings abc and cba which are reverse of each other.

string1 = abc

string2 = cba

Now push the characters of string1 in stack. Stack is a LIFO (last in first out) data structure which means the character pushed in the last in stack is popped first.

Push abc each character on a stack in the following order.

c

b

a

Now add each character of string2 in queue. Queue is a FIFO (first in first out) data structure which means the character inserted first is removed first.

Insert cba each character on a stack in the following order.

a b c

First c is added to queue then b and then a.

Now lets pop one character from the stack and remove one character from queue and compare each pair of characters of both the strings to each other.

First from stack c is popped as per LIFO and c is removed from queue as per FIFO. Then these two characters are compared. They both match

c=c. Next b is popped from stack and b is removed from queue and these characters match too. At the end a is popped from the stack and a is removed from queue and they both are compared. They too match which shows that string1 and string2 which are reverse of each other are matched.

6 0

3 years ago

As a compositional mode for electronic? media, __________ help people find their way through an unfamiliar system or? subject; t

maks197457 [2]

The answer that fills in the blank is orientation. It is because orientation does not provide all the details of what they are doing but a guideline of what they must do, in order for them to be guided on the things that they need to learn as they start. They require proper guidance which is the orientation before performing before hand. Especially when they are not familiar on what they need to do.

3 0

3 years ago

Which are examples of copyrighted online materials? Check all that apply.

Stella [2.4K]

The answers are 1, 3, and 5.

7 0

3 years ago

Read 2 more answers

Write a program that can be used to assign seats for a commercial airplane. The airplane has 13 rows, with six seats in each row

d1i1m1o1n [39]

Answer:

See explaination

Explanation:

#include <iostream>

#include <string>

#include <stdio.h>

#include <cst dlib>

using namespace st d;

int main(int argc, char *argv[])

{

int airplane[13][6];

char airchar[13][6];

string ticket;

int row[2];

char seat;

//--------------------------------------------

for(int i = 0; i < 13; i++)

{

for(int j = 0; j < 6; j++)

{

airchar[i][j] = '*';

airplane[i][j] = 0;

}

}

//--------------------------------------------

for(;;)

{

cout<<"Rows 1 and 2 are first class (F C)"<<endl;

cout<<"Rows 3 through 7 are business class (B C)"<<endl;

cout<<"Rows 8 through 13 are economy class (E C)"<<endl;

cout<<endl;

cout<<"* - Available"<<endl;

cout<<"X - Occupied"<<endl;

cout<<endl;

cout<<" \t A\t B\t C\t D\t E\t F"<<endl;

cout<<"Row 1\t"<<airchar[0][0]<<"\t"<<airchar[0][1]<<"\t"

<<airchar[0][2]<<"\t"<<airchar[0][3]<<"\t"<<airchar[0][4]<<"\t"

<<airchar[0][5]<<endl;

cout<<"Row 2\t"<<airchar[1][0]<<"\t"<<airchar[1][1]<<"\t"

<<airchar[1][2]<<"\t"<<airchar[1][3]<<"\t"<<airchar[1][4]<<"\t"

<<airchar[1][5]<<endl;

cout<<"Row 3\t"<<airchar[2][0]<<"\t"<<airchar[2][1]<<"\t"

<<airchar[2][2]<<"\t"<<airchar[2][3]<<"\t"<<airchar[2][4]<<"\t"

<<airchar[2][5]<<endl;

cout<<"Row 4\t"<<airchar[3][0]<<"\t"<<airchar[3][1]<<"\t"

<<airchar[3][2]<<"\t"<<airchar[3][3]<<"\t"<<airchar[3][4]<<"\t"

<<airchar[3][5]<<endl;

cout<<"Row 5\t"<<airchar[4][0]<<"\t"<<airchar[4][1]<<"\t"

<<airchar[4][2]<<"\t"<<airchar[4][3]<<"\t"<<airchar[4][4]<<"\t"

<<airchar[4][5]<<endl;

cout<<"Row 6\t"<<airchar[5][0]<<"\t"<<airchar[5][1]<<"\t"

<<airchar[5][2]<<"\t"<<airchar[5][3]<<"\t"<<airchar[5][4]<<"\t"

<<airchar[5][5]<<endl;

cout<<"Row 7\t"<<airchar[6][0]<<"\t"<<airchar[6][1]<<"\t"

<<airchar[6][2]<<"\t"<<airchar[6][3]<<"\t"<<airchar[6][4]<<"\t"

<<airchar[6][5]<<endl;

cout<<"Row 8\t"<<airchar[7][0]<<"\t"<<airchar[7][1]<<"\t"

<<airchar[7][2]<<"\t"<<airchar[7][3]<<"\t"<<airchar[7][4]<<"\t"

<<airchar[7][5]<<endl;

cout<<"Row 9\t"<<airchar[8][0]<<"\t"<<airchar[8][1]<<"\t"

<<airchar[8][2]<<"\t"<<airchar[8][3]<<"\t"<<airchar[8][4]<<"\t"

<<airchar[8][5]<<endl;

cout<<"Row 10\t"<<airchar[9][0]<<"\t"<<airchar[9][1]<<"\t"

<<airchar[9][2]<<"\t"<<airchar[9][3]<<"\t"<<airchar[9][4]<<"\t"

<<airchar[9][5]<<endl;

cout<<"Row 11\t"<<airchar[10][0]<<"\t"<<airchar[10][1]<<"\t"

<<airchar[10][2]<<"\t"<<airchar[10][3]<<"\t"<<airchar[10][4]<<"\t"

<<airchar[10][5]<<endl;

cout<<"Row 12\t"<<airchar[11][0]<<"\t"<<airchar[11][1]<<"\t"

<<airchar[11][2]<<"\t"<<airchar[11][3]<<"\t"<<airchar[11][4]<<"\t"

<<airchar[11][5]<<endl;

cout<<"Row 13\t"<<airchar[12][0]<<"\t"<<airchar[12][1]<<"\t"

<<airchar[12][2]<<"\t"<<airchar[12][3]<<"\t"<<airchar[12][4]<<"\t"

<<airchar[12][5]<<endl;

cout<<endl;

cout<<"Enter Ticket type (F C, B C, or E C): ";

cin>>ticket;

cout<<"Desired Row: ";

cin>>row[0];

cout<<"Desired seat (A,B,C,D,E or F): ";

cin>>seat;

switch(seat)

{

case 'A':

case 'a':

row[0] = row[0] - 1;

row[1] = 1;

row[1] = row[1] - 1;

break;

case 'B':

case 'b':

row[0] = row[0] - 1;

row[1] = 2;

row[1] = row[1] - 1;

break;

case 'C':

case 'c':

row[0] = row[0] - 1;

row[1] = 3;

row[1] = row[1] - 1;

break;

case 'D':

case 'd':

row[0] = row[0] - 1;

row[1] = 4;

row[1] = row[1] - 1;

break;

case 'E':

case 'e':

row[0] = row[0] - 1;

row[1] = 5;

row[1] = row[1] - 1;

break;

case 'F':

case 'f':

row[0] = row[0] - 1;

row[1] = 6;

row[1] = row[1] - 1;

break;

}

if(ticket == "F C")

{

if(row[0]+1 == 1 || row[0]+1 == 2)

{

if(airplane[row[0]][row[1]] == 0)

{

airplane[row[0]][row[1]] = 1;

airchar[row[0]][row[1]] = 'X';

}

else if(airplane[row[0]][row[1]] == 1)

{

cout<<"Message: Seat "<<row[0] + 1<<seat<<" is already occupied"<<endl;

system("Pause");

}

}

else

{

cout<<"Wrong Class"<<endl;

system("Pause");

system("cls");

continue;

}

}

else if(ticket == "B C")

{

if(row[0]+1 == 3 || row[0]+1 == 4 || row[0]+1 == 5

|| row[0]+1 == 6|| row[0]+1 == 7)

{

if(airplane[row[0]][row[1]] == 0)

{

airplane[row[0]][row[1]] = 1;

airchar[row[0]][row[1]] = 'X';

}

else if(airplane[row[0]][row[1]] == 1)

{

cout<<"Message: Seat "<<row[0] + 1<<seat<<" is already occupied"<<endl;

system("Pause");

}

}

else

{

cout<<"Wrong Class"<<endl;

system("Pause");

system("cls");

continue;

}

}

else if(ticket == "E C")

{

if(row[0]+1 == 8 || row[0]+1 == 9 || row[0]+1 == 10

|| row[0]+1 == 11|| row[0]+1 == 12|| row[0]+1 == 13)

{

if(airplane[row[0]][row[1]] == 0)

{

airplane[row[0]][row[1]] = 1;

airchar[row[0]][row[1]] = 'X';

}

else if(airplane[row[0]][row[1]] == 1)

{

cout<<"Message: Seat "<<row[0] + 1<<seat<<" is already occupied"<<endl;

system("Pause");

}

}

else

{

cout<<"Wrong Class"<<endl;

system("Pause");

system("cls");

continue;

}

}

row[0] = 0;

row[1] = 0;

system("cls");

}

return 0;

}

6 0

3 years ago