Mathematical Foundations of Computer ScienceMathematical Foundations of Computer Science explains the fundamental concepts in mathematics. It can be used by the students in computer science as an introduction to the underlying ideas of mathematics for computer science. It explains topics like mathematical logic, predicates, relations, functions, combinatorics, algebraic structures and graph theory. It would be useful for the students of B.Tech, BCA, & MCA. Key Features:

What people are saying  Write a review
User Review  Flag as inappropriate
super book
User Review  Flag as inappropriate
All 7 reviews »for MCA
Contents
Mathematical Logic  1 
2  20 
Predicate Logic  30 
Set Theory  61 
1  80 
3  108 
4  125 
5  144 
Elementary Combinatorics  215 
Recurrence Relations  256 
Graph Theory  294 
Application of Graph Theory  383 
4  417 
Solved Examples  428 
434  
Algebraic Structures  156 
Common terms and phrases
abelian group adjacency matrix binary operation binary tree chromatic number chromatic polynomial coefficient connected graph Consider contains cyclic group defined deg(vi degree sequence disjoint disjunctive normal form edges in G edges of G Euler Euler path F H G Find the number G and G G is called given Graph Definition graph G graph shown Hamiltonian cycle Hamiltonian path Hasse diagram Hence homomorphism Î G inverse isomorphic lattice least Let G multiplication natural numbers nonempty set number of edges number of vertices objects oneone ordered pairs p a q partially ordered set partition path in G permutation planar graph Poset positive integer Proof Prove real numbers recurrence relation reflexive selected semigroup Show shown in Fig simple graph spanning tree subgroup of G subgraph subset symbol symmetric tautology Theorem traversal truth table truth values Ú q variables vertex vertices of G