CatalogueBCA — ChhattisgarhDiscrete Mathematics
BCA Mathematics (CG NEP 2020)

Discrete Mathematics

by Dr. H.K. Pathak

₹480

Buy now

Free delivery · Secure online payment via our book store

University: Chhattisgarh State Universities For: BCA Semester I Pages: 640 Binding: Paperback Language: English

Useful for

GATE CS/ITUGC NET Computer Science

About this book

Discrete Mathematics by Dr. H.K. Pathak is written strictly to the NEP 2020 syllabus for BCA Semester I (Certificate, Diploma, Degree and Honours course), covering all four prescribed units across 12 chapters.

At 640 pages it is substantially more comprehensive than competing BCA discrete mathematics books, which typically run 300 to 400 pages. It includes a practical Applications of Group Theory chapter — covering cryptography, error-detecting codes and crystallography — that competing textbooks rarely offer.

The GATE CS Discrete Mathematics section and the UGC NET Computer Science Discrete Structures unit both map closely onto this book's four units, so it doubles as early preparation for those exams. Written for students across India, with particular relevance for Chhattisgarh State Universities: PRSU Raipur, Hemchand Yadav Vishwavidyalaya Durg, Guru Ghasidas Vishwavidyalaya Bilaspur and Sant Gahira Guru Vishwavidyalaya Sarguja. Published by Shree Shiksha Sahitya Prakashan, Meerut.

Syllabus coverage

Unit 1 · Sets, Relations, POSET & Lattices

Sets; Relations; Functions; Partially ordered sets; Hasse diagrams; Semilattices; Distributive and complemented lattices

Unit 2 · Mathematical Logic, Boolean Algebra & Switching Circuits

Propositional logic; Boolean algebra; Disjunctive and conjunctive normal forms; Quine-McCluskey method; Karnaugh maps; Logic gates

Unit 3 · Group Theory

Semigroups; Monoids; Groups; Subgroups; Lagrange's theorem; Rings; Integral domains; Fields; Applications of group theory including cryptography, crystallography and error-detecting codes

Unit 4 · Graphs

Graph theory fundamentals; Eulerian and Hamiltonian circuits; Planar graphs; Graph colouring; Travelling salesman problem; Dijkstra's algorithm

Related tags

Discrete MathematicsLatticesBoolean AlgebraKarnaugh MapsGroup TheoryGraph TheoryCryptographyNEP 2020