The book Mathematical Foundation of Computer Science has been written in a simple, lucid and easy to understandable style. Each chapter has been planed as independent unit so that various topics connected which can also be read separately. Hints and answers are give for the problems in the exercise to keep the students for self learning.
Salient Features:
Simple and concise presentation of fundamentals has been given in each chapter.
Each topic is presented in a systematic and simple manner.
Easy to understand methodology.
More than 450 problems are solved with step by step.
Read More
Specifications
Book Details
Imprint
BSP
Publication Year
2016
Edition Type
First Edition
Table of Contents
1: Propositional Calculus, 2: Predicate Calculus, 3: Number Theory, 4: Mathematical Induction, 5: Set Theory, 6: Functions, 7: Graph Theory ‐ I, 8: Graph Theory ‐ II, 9: Graph Theory ‐ III, 10: Graph Theory ‐ IV, 11: Algebraic Structures, 12: Algebraic Structures (Groups and Rings), 13: Permutations and Combinations, 14: Binomial Theorem, 15: Recurrence Relations, 16: Some Methods of Solving Recurrence Relations.
Contributors
Author Info
Dr. Bhavanari Satyanarayana is a Professor of Mathematics in the Department of Mathematics, Acharya Nagarjuna University, Andhra Pradesh, India., Dr. Tumurukota Venkata Pradeep Kumar is presently working as Assistant Professor in Mathematics in University Engineering College, Acharya Nagarjuna University, Nagarjuna Nagar, A.P. India., Dr. Shaik Mohiddin Shaw is presently working as Assistant Professor in Mathematics in Narasaraopet Engineering College, Narasaraopet, A.P. India
University Books Details
Specialization
Computer Science and Engineering
Be the first to ask about this product
Safe and Secure Payments.Easy returns.100% Authentic products.