MCS-033: Advanced Discrete Mathematics

New Revised Syllabus of MCS-033: Advanced Discrete Mathematics From IGNOU

MCS-033: Advanced Discrete Mathematics :: 2 Credits

Recurrence relations, Three Recurrent Problems, More Recurrences, Divide and Conquer, Generating Functions, Exponential Generating Functions, Applications, Combinatorial Identities, Linear Equations, Partitions, Recurrence Relations, Solving recurrencies, Linear Homogeneous Recurrences, Linear Non-homogenous Recurrences, Method of Telescoping sums, Method of Iteration, Method of Substitution, Graphs, Regular Graphs, Subgraphs, Connected Graphs, Paths, Circuits And Cycles, Components, Connectivity, Bipartite Graphs, Trees, Eulerian Graphs, Fleury�s Algorithm, Hamiltonian Graphs, Travelling Salesperson Problem, Graphs Coloring and Planar graphs, Vertex Colourings, Definition And Examples, Bounds For Chromatic numbers, Planar Graphs, Map Colouring Problem, Edge Colouring, Automata, grammars and languages, Sequential Circuits and Finite-State Machine, Finite-State automata, Languages and Grammars, No-deterministic Finite-State Automata, Relationships Between Languages and Automata.

Comment for MCS-033: Advanced Discrete Mathematics
advance discrete mathematics

Home > MCA Revised New Syllabus > MCS-033: Advanced Discrete Mathematics
Comments are closed.