Ask question

Ask question

All categories

2 years ago

15

Implement a function with signature transfer(S, T) that transfers all elements from stack S onto stack T, so that the element th

at starts at the top
of S is the first to be inserted onto T, and the element at the bottom of S
ends up at the top of T.

1 answer:

dmitriy555 [2]2 years ago

8 0

I’ve took engineering but never learnt this lol

You might be interested in

If you measure 0.7 V across a diode, the diode is probably made of

tatuchka [14]

Answer:

Made of Silicon.

Explanation:

A diode is a semiconductor device use in mostly electronic appliances. It is two terminals device consisting of a P-N junction formed either in Germanium or silicon crystal.

Diode can be forward biased or reverse biased.

When a diode is forward biased and the applied voltage is increased from zero, hardly any current flows through the device in the beginning.

It is so because the external voltage is being opposed by the internal barrier voltage whose value is 0.7v for silicon and 0.3v for germanium.

If you measure 0.7 V across a diode, the diode is probably therefore made of Silicon.

6 0

2 years ago

What is the definition of a duty cycle?

ira [324]

Answer:

$D=\frac{PW}{T}*100$

Explanation:

In electrical terms, is the ratio of time in which a load or circuit is ON compared to the time in which the load or circuit is OFF.

The duty cycle or power cycle, is expressed as a percentage of the activation time. For example, a 70% duty cycle is a signal that 70% of the time is activated and the other 30% disabled. Its equation can be expressed as:

$D=\frac{PW}{T}*100$

Where:

$D=Duty\hspace{3}Cycle$

$PW=Pulse\hspace{3}Active\hspace{3}Time$

$T=Period\hspace{3}of\hspace{3}the\hspace{3}Signal$

Here is a picture that will help you understand these concepts.

5 0

3 years ago

The way most recursive functions are written, they seem to be circular at first glance, defining the solution of a problem in te

EastWind [94]

Question Continuation

int factorial(int n) {

if(n == 0)

return 1;

else

return n * factorial(n - 1);

}

Provide a brief explanation why this recursive function works.

Show all steps involved in calculating factorial(3) using the function deﬁned.

Answer:

1. Brief explanation why this recursive function works.

First, the recursive method factorial is defined.

This is the means through with the machine identifies the method.

The method is defined as integer, the machine will regard it as integer.

When the factorial is called from anywhere that has access to it, which in this case is within the factorial class itself. This means you can call it from the main method, or you can call it from the factorial method itself. It's just a function call that, well, happens to call itself.

2. Steps to calculate factorial(3)

1 First, 3 is assigned to n.

2. At line 2, the machine checks if n equals 0

3. If yes, the machine prints 1

4. Else; it does the following from bottom to top

factorial(3):

return 3*factorial(2);

return 2*factorial(1):

return 1;

Which gives 3 * 2 * 1 = 6

5. Then it prints 6, which is the result of 3!

6 0

3 years ago

Describe the Optical Fiber Network( i need 2 paragraphs, but give me about 5 sentences or like 3)

frez [133]

Answer: Fiber Optic Network Fiber-optic networks have been used for decades to transmit large volumes of traffic across the country. The economics of fiber networks have only recently allowed for connecting the fiber directly to the home, creating a fiber-to-the-home (FTTH) network.

Explanation:

6 0

3 years ago

Read 2 more answers

leonid [27]

Answer=

low-frequency EMFs pose little danger to human health. ... Exposure to large levels of high-frequency EMFs is known to damage human DNA and cells

Explanation:

8 0

2 years ago