FREE
AKTU Discrete Structures & Theory of Logic (BCS303) Syllabus PDF – B.Tech 2nd Year
Discrete Structures & Theory of Logic BCS303
All syllabus, notes, question bank & PYQ for this subject
Free
Download now
- English
- Semester 3
- 0 downloads
- 0 views
Official AKTU syllabus of Discrete Structures & Theory of Logic (BCS303) for B.Tech 2nd Year – 3 credits, L-T-P 2-1-0. Read the unit-wise course content, course outcomes, evaluation pattern and recommended books online, or download the PDF.
- Electronic and Computer Engineering › 2nd Year
- Computer Science and Engineering › 2nd Year
- Computer Science › 2nd Year
- Computer Engineering › 2nd Year
- Information Technology › 2nd Year
- Computer Science and Information Technology › 2nd Year
- Computer Science and Design › 2nd Year
- Computer Science and Engineering (Artificial Intelligence) › 2nd Year
- Computer Science and Engineering (Artificial Intelligence & Machine Learning) › 2nd Year
- Artificial Intelligence and Machine Learning › 2nd Year
- Artificial Intelligence (AI) and Data Science › 2nd Year
- Computer Science and Engineering (Data Science) › 2nd Year
- Computer Science & Engineering (Cyber Security) › 2nd Year
- Computer Science and Engineering (Internet of Things) › 2nd Year
- Computer Science and Business Systems › 2nd Year
Syllabus — Discrete Structures & Theory of Logic
Download PDFBCS303 · 3 credits · L-T-P 2-1-0
Course Outcomes
At the end of course , the student will be able to understand
| CO 1 | Acquire Knowledge of sets and relations for solving the problems of POSET and lattices. | K K 3, 4 |
| CO 2 | Apply fundamental concepts of functions and Boolean algebra for solving the problems of logical abilities. | K K 1, 2 |
| CO 3 | Employ the rules of propositions and predicate logic to solve the complex and logical problems. | K 3 |
| CO 4 | Explore the concepts of group theory and their applications for solving the advance technological problems. | K K 1, 4 |
| CO 5 | Illustrate the principles and concepts of graph theory for solving problems related to computer science. | K K 2, 6 |
Course Content
L-T-P: 3-1-0
| Unit | Topic | Proposed Lecture |
|---|---|---|
| I | Set Theory& Relations: Introduction, Combination of sets. Relations: Definition, Operations on relations, Properties of relations, Composite Relations, Equality of relations, Recursive definition of relation, Order of relations. POSET & Lattices: Hasse Diagram, POSET, Definition & Properties of lattices – Bounded, Complemented, Distributed, Modular and Complete lattice. | 08 |
| II | Functions: Definition, Classification of functions, Operations on functions. Growth of Functions. Boolean Algebra: Introduction, Axioms and Theorems of Boolean algebra, Algebraic manipulation of Boolean expressions. Simplification of Boolean Functions, Karnaugh maps. | 08 |
| III | Theory of Logics: Proposition, Truth tables, Tautology, Satisfiability, Contradiction, Algebra of proposition, Theory of Inference. Predicate Logic: First order predicate, well-formed formula of predicate, quantifiers, Inference theory of predicate logic. | 08 |
| IV | Algebraic Structures: Definition, Groups, Subgroups and order, Cyclic Groups, Cosets, Lagrange's theorem, Normal Subgroups, Permutation and Symmetric groups, Group Homomorphisms, Definition and elementary properties of Rings and Fields. | 08 |
| V | Graphs: Definition and terminology, Representation of graphs, Multigraphs, Bipartite graphs, Planar graphs, Isomorphism and Homeomorphism of graphs, Euler and Hamiltonian paths, Graph coloring. Combinatorics: Introduction, Counting Techniques, Pigeonhole Principle | 08 |
Text Books
1.Koshy, Discrete Structures, Elsevier Pub. 2008 Kenneth H. Rosen, Discrete Mathematics and Its Applications, 6/e, McGraw-Hill, 2006.
- 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.
- Krishnamurthy, V., “Combinatorics Theory & Application”, East-West Press Pvt. Ltd., New Delhi
Ratings & Reviews
No reviews yet — share your experience with this item.