Calculate the relative speed of a 64 bit adder using ripple carry only and configurations

Calculate the relative speed of a 64-bit adder using ripple carry only, a ripple carry of 4-bit groups that use carry lookahead, and a ripple carry of 16-bit groups that use carry lookahead. Use the simulator located at the following url: http://www.ecs.umass.edu/ece/koren/arith/simulator/ Also explain, what is relative speed and how is it calculated?

Suppose three values (x, y, and z) are stored in a machine's memory. Describe the sequence of events that lead to the computation of x+y+z

Suppose three values (x, y, and z) are stored in a machine's memory. Describe the sequence of events that lead to the computation of x+y+z, How about (2x)+y?

Suppose a machine has 20 GB of storage space available on a hard disk and receives data over a telephone connection at the rate of 14,400bps. At this rate, how long would it take to fill the available storage space?

I would like to know how to calculate(formula) the following. There are 20 gigabyte of space on a computer's hard disk. I transfer data via a telephone line (connection) at the rate of 14,400 bits per second. At this rate how long will it take to fill the available storage space?

Compute the number of data bits affected by a burst of interference.

I use a communication line to transmit data serially at a rate of 14,400 bits per second. If a burst of interference lasts .01 second, how many data bits would be affected?

Compare and contrast hard and soft links on Unix/Linux.

Give the advantages and disadvantages/limitations of hard and soft linking in Unix/Linux filesystem.