1. Given a matrix filled with 0 1 and 2. All 0 are blank cells. A person is standing at 1. All 2 are cells on fire. You can move 4-directionally in a cell in 1 second. Every second the fire also moves 4-directionally. You have to come out of the maze by reaching any edge. Calculate min steps to come out of matrix. 2. Discussions of databases, RDBMS vs NoSQL. Advantages and disadvantages, Indexing.