Write an algorithm and draw the flowchart of finding the area and perimeter of a circle. The radius (float) need to be entered by the user and if the user enters negative radius or zero radius,
the algorithm will ask the user to be entered again. (The algorithm will ask the user to enter the
radius until it is entered as positive.) At the end, the algorithm will find and print area and
perimeter of the circle as output.

An isolated conducting spherical shell carries a positive charge. part a which statement (or statements) about the electric field and the electric potential inside and outside the spherical shell is correct? which statement (or statements) about the electric field and the electric potential inside and outside the spherical shell is correct? electric potential inside the shell is constant and outside the shell is changing as 1/r2 both the electric potential and the electric field does change with r inside and outside the spherical shell electric potential inside and outside the shell is constant, but not zero electric potential inside the shell is constant and outside the shell is equal to zero electric field inside and outside the shell is constant (does not change with the position r), but is not equal to zero electric field inside and outside the shell is changing as 1/r (where r is the distance from the center of the sphere) electric field inside is equal to zero and outside the shell is constant, but not zero electric potential inside the shell is constant and outside the shell is changing as 1/r electric field inside and outside the shell is changing as 1/r2 electric field inside is equal to zero and outside the shell is changing as 1/r2 electric field inside and outside the shell is zero electric field inside is constant and outside the shell is changing as 1/r

You can watch static electricity in action by rubbing an inflated balloon against your hair. your hair will actually stand on its end! it does this because each hair becomes charged, and they all repel one another.

Consider a file currently consisting of 200 blocks. assume that the file control block (and the index block in the case of indexed allocation) is already in memory. calculate how many disk i/o operations are required for contiguous, linked, and indexed (single-level) allocation strategies, for each of the conditions listed below. in the contiguous-allocation case, assume that there is not room to grow at the beginning but there is room to grow at the end. also assume that the block information to be added is stored in memory.