In this paper, we are going to provide major results for two sorts of Matrix Completion problems. One involves the recovery of a low rank matrix and the other involves the recovery of an approximately low rank matrix based on a small number of observed entries. In the end of the paper, we are going to demonstrate the feasibility of the recovery methods discussed on randomly generated low rank and approximately low rank matrices.Computer Science