This paper is an introduction to few problems and results in matrix completion problems. The topics which are considered here include questions on norm completions, rank completions, positive definite completions, numerical range completion properties and rank decomposability. The author shows that the existence of completions of the required type often depends on the chordal properties of graphs associated with the pattern.