Discrete Mathematics 3140708 Syllabus Download With Weightage
Discrete Mathematics 3140708 Syllabus is a term that refers to Information Technology Department covers this subject This year, this Subject is covered in the 4th Semester.
Basic Concepts of Set Theory: Definitions, Inclusion, Equality of Sets,
Introduction & definition, Co-domain, range, image, value of a function;
The Basics of Counting, The Pigeonhole Principle, Permutations and
Definition, Statements & Notation, Truth Values, Connectives,
Definition of Predicates; Statement functions, Variables,
Definition, Binary Relation, Representation, Domain, Range, Universal
Definition, Examples, Simple or Linear Ordering, Totally Ordered Set (Chain), Frequently Used Partially Ordered Relations, Representation of Partially Ordered Sets, Hesse Diagrams, Least & Greatest Members, Minimal & Maximal Members, Least Upper Bound (Supremum), Greatest Lower Bound (infimum), Well- ordered Partially Ordered Sets (Posets). Lattice as Posets, complete, distributive modular and complemented lattices Boolean and pseudo Boolean lattices. (Definitions and simple examples only)
Introduction, Recursion, Recurrence Relation, Solving,
Algebraic structures with one binary operation- Semigroup, Monoid, Group, Subgroup, normal subgroup, group Permutations, Coset, homomorphic subgroups, Lagrange’s theorem, Congruence relation and quotient structures. Algebraic structures (Definitions and simple examples only) with two binary operation- Ring, Integral domain and field.
Introduction, definition, examples; Nodes, edges, adjacent nodes, directed and undirected edge, Directed graph, undirected graph, examples; Initiating and terminating nodes, Loop (sling), Distinct edges, Parallel edges, Multi-graph, simple graph, weighted graphs, examples, Isolated nodes, Null graph; Isomorphic graphs, examples; Degree, Indegree, out-degree, total degree of a node, examples; Subgraphs: definition, examples; Converse (reversal or directional dual) of a digraph, examples;
Definition, Paths of a given graph, length of path, examples; Simple path (edgesimple), elementary path (node simple), examples; Cycle (circuit), elementary cycle, examples;
Definition, geodesic, distance, examples; Properties of reachability, the triangle inequality; Reachable set of a given node, examples, Node base, examples;
Definition, weakly connected, strongly connected,
Definition, branch nodes, leaf (terminal) nodes, root, examples; Different representations of a tree, examples; Binary tree, m-ary tree, Full (or complete) binary
Thank you for taking the time to come see us.
You have visited MordenTimeTech.com to get GTU B.E. Information Technology Department SEM 4th Syllabus of Discrete Mathematics 3140708
Along with the GTU B.E. Information Technology department SEM 4th Syllabus, we provide a variety of other resources on MordenTimeTech.com. We provide GTU papers for all branches, as well as subject-specific GTU Papers, MCQs, and notes.