**Syllabus**

*Matrices*: Linear dependence of vectors, solution of linear equations, bases of vector spaces. orthogonality, complementary orthogonal spaces and solution spaces of linear equations.*Graphs*:*Algorithms and data structures*: Efficient representation of graphs; elementary graph algorithms involving BFS and DFS trees, such as finding connected and 2-connected components of a graph, the minimum spanning tree, shortest path between a pair of vertices in a graph.

**Pre-requisites:**** Nil**

__Text/References :__**
**

**K. Hoffman and R. E. Kunze, Linear Algebra, Prentice Hall (India), 1986****N. Balabanian and T. A. Bickart, Linear Network Theory; Analysis, Properties, Design and Synthesis, Matrix Publishers, Inc., 1981****T. Cormen, C. Leiserson and R. A. Rivest Algorithms, MIT press and McGraw Hill, 1990**

**Announcement: Test on 23rd Sep '02 9PM-11PM
Room A104**