KCS303: Discrete Structures and Theory of Logic CSML 3rd Sem Syllabus for AKTU B.Tech 2021-22 Scheme

Discrete Structures and Theory of Logic detail syllabus for Computer Science & Machine Learning (CSML), 2021-22 scheme is taken from AKTUs official website and presented for the AKTU B.Tech students. For the course code (KCS303), exam duration, teaching hr/week, practical hr/week, total marks, internal marks, theory marks, duration, credits, and other details do visit complete semester subjects post given below.

For all other csml 3rd sem syllabus for aktu b.tech 2021-22 scheme you can visit CSML 3rd Sem Syllabus for 2021-22 regulation. The detail syllabus for discrete structures and theory of logic is as follows.

Course Outcomes:

For the complete syllabus, results, class timetable and more kindly download iStudy. It’s a lightweight, easy to use, no images, no pdfs platform to make student’s life easier.

Unit I

Set Theory: Introduction, Combination of sets, Multisets, Ordered pairs. Proofs of some general identities on sets. Relations: Definition, Operations on relations, Properties of relations, Composite Relations, Equality of relations, Recursive definition of relation, Order of relations. Functions: Definition, Classification of functions, Operations on functions, Recursively defined functions. Growth of Functions. Natural Numbers: Introduction, Mathematical Induction, Variants of Induction, Induction with Nonzero Base cases. Proof Methods, Proof by counter – example, Proof by contradiction.

Unit II

For the complete syllabus, results, class timetable and more kindly download iStudy. It’s a lightweight, easy to use, no images, no pdfs platform to make student’s life easier.

Unit III

Lattices: Definition, Properties of lattices – Bounded, Complemented, Modular and Complete lattice. Boolean Algebra: Introduction, Axioms and Theorems of Boolean algebra, Algebraic manipulation of Boolean expressions. Simplification of Boolean Functions, Karnaugh maps, Logic gates, Digital circuits and Boolean algebra.

Unit IV

For the complete syllabus, results, class timetable and more kindly download iStudy. It’s a lightweight, easy to use, no images, no pdfs platform to make student’s life easier.

Unit V

Trees: Definition, Binary tree, Binary tree traversal, Binary search tree. Graphs: Definition and terminology, Representation of graphs, Multigraphs, Bipartite graphs, Planar graphs, Isomorphism and Homeomorphism of graphs, Euler and Hamiltonian paths, Graph coloring, Recurrence Relation & Generating function: Recursive definition of functions, Recursive algorithms, Method of solving recurrences. Combinatorics: Introduction, Counting Techniques, Pigeonhole Principle

Text Books:

1. Koshy, Discrete Structures, Elsevier Pub. 2008 Kenneth H. Rosen, Discrete Mathematics and Its Applications, 6/e, McGraw-Hill, 2006.
2. B. Kolman, R.C. Busby, and S.C. Ross, Discrete Mathematical Structures, 5/e, Prentice Hall, 2004.
3. E.R. Scheinerman, Mathematics: A Discrete Introduction, Brooks/Cole, 2000.
4. R.P. Grimaldi, Discrete and Combinatorial Mathematics, 5/e, Addison Wesley, 2004
5. Liptschutz, Seymour, ‘ Discrete Mathematics’, McGraw Hill.
6. Trembley, J.P & R. Manohar, ‘Discrete Mathematical Structure with Application to Computer Science’, McGraw Hill. 4. Deo, 7.Narsingh, ‘Graph Theory With application to Engineering and Computer.Science.’, PHI.
7. Krishnamurthy, V., ‘Combinatorics Theory & Application’, East-West Press Pvt. Ltd., New Delhi

For detail syllabus of all other subjects of B.Tech CSML, 2021-22 scheme do visit CSML 3rd Sem syllabus for 2021-22 scheme.

For the complete syllabus, results, class timetable, and many other features kindly download the iStudy App
It is a lightweight, easy to use, no images, and no pdfs platform to make students’s lives easier.