VE901 APPLIED MATHEMATICS FOR VLSI SYSTEMS

UNIT I
(9)
Vector Spaces: Vectors, Subspaces, Linear independence, Basis and Dimension, Row space,
Column space, Rank, Rank-Nullity Theorem. Lattices as partially ordered sets, properties of
Lattices. Lattices as Algebraic Systems, Sublattices, Direct Product, and Homomorphism.
UNIT II
(9)
Boolean Algebra: definition and examples, Subalgebra, Direct Product and Homomorphism.
Boolean Functions, Representation and Minimization of Boolean Functions, Design examples
using Boolean Algebra.
UNIT III
(9)
Basics of Graph Theory: Graphs Data structures for graphs Subgraphs Operations on
Graphs Connectivity Networks and the maximum flow Minimum cut theorem - Trees
Spanning trees Rooted trees Matrix representation of graphs.
UNIT IV
(9)
Graph Algorithm: Computer Representation of graphs Basic graph algorithms Minimal
spanning tree algorithm Kruskal and Prims algorithm - Shortest path algorithms Dijsktras
algorithm DFS and BFS algorithms.
UNIT V
(9)
Optimization Techniques: Linear Programming Graphical methods Simplex method
- Transportation and Assignment problems.
TOTAL - 45 hours
REFERENCES
1. Tremblley. J.P and Manohar. R , Discrete Mathematics Structures with Application to

Computer Science, Mc Graw Hill Book Company, 1997.

2. Narsingh Deo, Graph Theory: With Application to Engineering and Computer Science,

PHI, 2003.
3. Haffmann and Kunze , Linear Algebra, PHI, 1994.
4. Kanti Swarup, Man Mohan, P.K. Gupta, Operations Research, Sultan Chand & Sons,

2000.
5. Rao S.S, Engineering Optimization: Theory and Practice, New Age International Pvt.

Ltd., 3rd Edition 1998.