All Materials regarding to B.tech R-20 in Computer Science in AI & ML Engineering 1st Year 2nd Semester with unit wise for Every Subjects are available.
👇👇Scroll Down for Important Questions and Topics Unit Wise 👇👇
| CSM 2-1 MFCS | ||
|---|---|---|
| Chapters / Units | Download Link | |
| 1 | Unit 1 | Download |
| 2 | Unit 2 | Download |
| 3 | Unit 3 | Download |
| 4 | Unit 4 | Download |
| 5 | Unit 5 | Download |
CSM 2-1 MFCS important Topics and Questions
UNIT I
Mathematical Logic: Propositional Calculus: Statements and Notations, Connectives, Well Formed
Formulas, Truth Tables, Tautologies, Equivalence of Formulas, Duality Law, Tautological Implications,
Normal Forms, Theory of Inference for Statement Calculus, Consistency of Premises, Indirect Method of
Proof, Predicate Calculus:Predicates, Predicative Logic, Statement Functions, Variables and Quantifiers,
Free and Bound Variables, Inference Theory for Predicate Calculus.
UNIT II
Set Theory: Sets: Operations on Sets, Principle of Inclusion-Exclusion, Relations: Properties, Operations,
Partition and Covering, Transitive Closure, Equivalence, Compatibility and Partial Ordering, Hassie
Diagrams, Functions: Bijective, Composition, Inverse, Permutation, and Recursive Functions, Lattice and its
Properties, Algebraic Structures: Algebraic Systems, Properties, Semi Groups and Monoids, Group,
Subgroup and Abelian Group, Homomorphism, Isomorphism.
UNIT III
Combinatorics: Basis of Counting, Permutations, Permutations with Repetitions, Circular and Restricted
Permutations, Combinations, Restricted Combinations, Binomial and Multinomial Coefficients and
Theorems, Number Theory: Properties of Integers, Division Theorem, Greatest Common Divisor, Euclidean
Algorithm, Least Common Multiple, Testing for Prime Numbers, The Fundamental Theorem of Arithmetic,
Modular Arithmetic, Fermat’s and Euler’s Theorems
UNIT IV
Recurrence Relations: Generating Functions, Function of Sequences, Partial Fractions, Calculating
Coefficient of Generating Functions, Recurrence Relations, Formulation as Recurrence Relations, Solving
Recurrence Relations by Substitution and Generating Functions, Method of Characteristic Roots, Solving
Inhomogeneous Recurrence Relations
UNIT V
Graph Theory: Basic Concepts, Graph Theory and its Applications, Sub graphs, Graph Representations:
Adjacency and Incidence Matrices, Isomorphic Graphs, Paths and Circuits, Eulerian and Hamiltonian
Graphs, Multigraphs, Bipartite and Planar Graphs, Euler’s Theorem, Graph Colouring and Covering,
Chromatic Number, Spanning Trees, Prim’s and Kruskal’s Algorithms, BFS and DFS Spanning Trees.
Disclaimer :
We are not responsible for any loss of data /or any other information by visiting this website. We just providing previous papers to help the students who need previous papers to prepare themselves. This downloaded from internet source just to education purpose only.
Thank you.
Feel free to contact us, if you want any other courses or Tutorials or any other information .
We'll always try to helps you better learn something