Welcome to Discrete Structure
Goal:
Introduce fundamental formal concepts in computing to provide training in.
Important things should be known after studying this course:
* Use the techniques of discrete structure, especially the idea of
recurrence, to solve problems in probability theory, counting and number
theory.
* Apply pigeonhole principle.
* Make use of the counting methods.
* Generate functions.
* Recurrence relations and their solution, and the inclusion-exclusion
formula.
* Formulate and model the problems in discrete structure.
* Apply truth table, implications and equivalence, resolution and proof techniques.
* Make use of graph and set theory, relational and functions.
* Identify the characteristic of an algorithm.
* Employ directed and undirected graphs as a relational system, Eulerian paths and cycles,
* Hamiltonian paths and cycles,
Trees and Providing properties of graph using mathematical induction.
* Deal with Sequential circuits and define-state machines, Deterministic
and non- deterministic, finite automata and their relationship.
* Define algebraic
structures; Semigroups, Groups and subgroup, Homomorphism
and iso morphism of groups,
Lagrange’s theorem, Ring and fields.
IT Society blog Team
.png)
Post a Comment