Department Events
Mathematical Foundation for Computer Applications
- To understand the concepts and operations of matrix algebra needed for computing graphics modeling.
- To understand and apply the class of functions which transform a finite set into another finite set which relates to input output functions in computer science.
- To impart discrete knowledge in computer engineering through finite automata and Context free grammars.
Matrices, Rank of Matrix, Solving System of Equations, Eigen Values and Eigen Vectors, Inverse of a Matrix, Cayley Hamilton Theorem.
Principle of inclusion and exclusion, partitions, Permutation and Combination, Relations, Properties of relations, Matrices of relations, Closure operations on relations, Functions- injective, subjective and objective functions.
Truth table, Propositions generated by a set, Equivalence and implication, Basic laws, Functionally complete set of connectives, Normal forms, Proofs in Propositional calculus, Predicate calculus.
Phrase Structure Grammar-Classification of Grammars, Pumping Lemma For Regular Languages, Context Free Languages.
Deterministic Finite State Automata(DFA), Non Deterministic Finite State Automata (NFA), Equivalence of DFA and NFA, Equivalence of NFA and Regular Languages.
- Kenneth H.Rosen, “Discrete Mathematics and Its Applications”, Tata McGraw Hill, Seventh Edition, 2011.
- Hopcroft John E. ET. AL., “Introduction to Automata Theory, Languages and Computation”, Pearson Education; 3rd edition, 2008.
- A.Tamilarasi & A.M.Natarajan, “Theory of Automata and Formal Languages”, New Age International Pvt Ltd Publishers, 2008.
- Juraj Hromkovic, “Theoretical Computer Science”, Springer Indian Reprint, 2010.
- David Makinson, “Sets, Logic and Maths for Computing”, Springer Indian Reprint, 2011.
