Disconnecting a complete graph by removing edges randomly
For your first question, an empty graph becomes connected roughly when $n\log n$ random edges are inserted into it, in a way quantified in Erdős and Rényi's fundamental paper On the evolution of random graphs, and recounted in textbooks on random graphs.

Your second question is not stated precisely and so is difficult to answer.