Discrete Structures [CS-261]

Discrete Structures:-

Introduces the foundations of discrete mathematics as they apply to Computer Science, focusing on providing a solid theoretical foundation for further work. Further, this course aims to develop understanding and appreciation of the finite nature inherent in most Computer Science problems and structures through study of combinatorial reasoning, abstract algebra, iterative procedures, predicate calculus, tree and graph structures. In this course more emphasis shall be given to statistical and probabilistic formulation with respect to computing aspects.
One can apply the rules of Discrete Mathematics to Computer Science.
Introduction to logic and proofs: Direct proofs; proof by contradiction, Sets, Combinations, Sequences, Formal logic, Prepositional and predicate calculus, Methods of Proof, Mathematical Induction and Recursion, loop invariants, Relations and functions, Pigeonhole principle, Trees and Graphs, Elementary number theory, Optimization and matching. Fundamental structures: Functions; relations (more specifically recursions); pigeonhole principle; cardinality and countability, probabilistic methods.

Text Book :-

            Kenneth H, Discrete Mathematics and Its Applications, 7TH edition.

👉 Download 👌

Recommenced Books:-

1. Richard Johnson Baugh, Discrete Mathematics, 7TH edition, 2008, Prentice Hall Publishers.
2. Kolman, Busby & Ross, Discrete Mathematical Structures, 4th edition, 2000, Prentice-Hall Publishers.
3. Ralph P. Grimaldi, Discrete and Combinatorial Mathematics: An Applied Introduction, Addison-Wesley Pub. Co., 1985.