processor
characters of information are held on a magnetic tape in batches of characters each, the batch processing time being seconds where and are constants. The optimal value of for fast processing is .
This section requires Javascript.
You are seeing this because something didn't load right. We suggest you, (a) try
refreshing the page, (b) enabling javascript if it is disabled on your browser and,
finally, (c)
loading the
non-javascript version of this page
. We're sorry about the hassle.
Suppose that there are n batches. So the total number of characters to be processed N = n x
n = x N
Total time taken to process N characters:
t = n ( A + B x 2 )
t = x N ( A + B x 2 )
On differentiating wrt x and equating it to 0:
x = B A