Course module

Paper 2 | Unit 1 | Discrete Structures and OptimizationNTA-UGC-NET Paper - 2

Lessons: 443
Duration: 45 hr 1 min
PYQs: 321
Practice: 1599

11% of this course's PYQ weight is covered in this module.

Syllabus index

Lessons in this module

443 linked lessons

Proposition Questions notesPdf

Gate 1992Drm Video

Introduction to Linear Programming (LP)Drm Video

Slack and Surplus VariablesDrm Video

Solving LP by Simplex method - Part 1Drm Video

Duality in LPPDrm Video

Transportation Problem in LPP - Part 1Drm Video

Introduction to Non Linear ProgrammingDrm Video

Previous-year questions

Explore the course

Lessons in this module

Propositional and Predicate Logic

Introduction to Propositions, Laws of Contradiction and Excluded Middle

Types of Propositions – Atomic and Compound

Logical Operators – Negation, Conjunction, and Disjunction

Implication and Bi-Conditional Operators in Logic

Types of Logical Cases – Tautology, Contradiction, Contingency, Satisfiability, and Validity

Introduction to First Order Predicate Logic

Quantifiers – Universal and Existential

Practice Problems on Quantifiers and Predicate Logic

Functional Completeness

Questions and Practice Problems on Propositions

Multi-Topic Content (Cross-Concept Material)

Set Theory

Sets, Representation of Sets and Hierarchy of numbers

Finite, Infinite, Countable, and Uncountable Sets

Null, Universal, Subsets, Proper Subsets

Power Set and its Cardinality

Set Operations – Union, Intersection, Set Difference, Symmetric Difference, and Complement

Relations

Cartesian Product, Relation, Inverse & Complement

Reflexive Irreflexive Relation – Count, and Properties

Symmetric Anti-Symmetric Asymmetric Relation and Properties

Transitive Relation – Definition, Count, and Properties

Equivalence Relation, Equivalence Classes, Partitions of a Set

Partial Order Relation – Properties, Partially Ordered Set (Poset), and Total Order Relation

Hasse Diagram, Greatest Element, Least Element, Upper Bound, Lower Bound

Lattice – Definition, Formation, and Examples of Join and Meet Operations

Bounded, Unbounded, Distributive, Complemented Lattices and Boolean Algebr

Functions

Definition of a Function – Domain, Co-domain, Range, and Count of Possible Functions

Composition of Functions – Definition, Properties, and Examples

One-to-One (Injective) Function – Definition, Count, and Properties

Onto (Surjective) Function – Definition, Count, and Properties

Bijective Function – Definition, Count, and Properties

Inverse of a Function – Definition, Existence Conditions, and Examples

Permutation and Combination

Basic Concepts & Counting Principles

Permutations (with & without Repetition)

Circular & Grouping Permutations

Combinations (with & without Repetition)

Special Applied Problems

Advanced Counting Theorems

Probability

Basic Concepts and Terminology

Classical Problems (Cards, Dice, Coins, Digits, Number, Objects)

Probability Using Venn Diagrams & Set Theory

Multiple Topics

Graph Theory

Introduction to Graphs – Definitions, Terminology (Loops, Parallel Edges, Adjacent Vertices)

Types of Graphs – Finite, Infinite, Null, Trivial, Complete

Bipartite, Cycle, Regular, and Complement of a Graph

Number of Graphs – Counting of Simple, Undirected, Unlabeled

Degree of Vertex – Isolated and Pendant Vertices, Handshaking Lemma, and Degree Sequence

Minimum and Maximum Degree – Relationships, Degree Constraints, and Havel-Hakimi Theorem

Graph Traversal – Walk, Path, Trail, Circuit, and Connected Graphs

Euler and Hamiltonian Graphs – Definitions, Conditions, and Examples

Planar Graphs – Kuratowski’s Theorems, Homorphism and examples

Euler Formula – Planar Graph Formula, Applications, and Derived Relations

Graph Coloring – Vertex Coloring, Edge Coloring, Chromatic Number, and Coloring Theorems

Trees – Definitions, Properties, Eccentricity, Diameter, Radius, and Center

Spanning Tree and Spanning Forest – Definition, Construction, and Applications

Cut Set and Connectivity – Edge Connectivity, Vertex Connectivity, and Cut Set Concepts

Graph Isomorphism – Definition, Detection, and Problem Solving

Graph Matching – Maximal, Maximum, Perfect Matching, and Related Concepts

Graph Covering – Line and Vertex Covering, Independent Set, and Minimal/Maximal Variants

Group Theory

Closure-Algebraic Structure, Associative-SemiGroup, Identity-Monoid

Inverse Property and Group

Commutative Property and Abelian Groups

Classification of Finite and Infinite Groups

Subgroup Definition, Examples, and Verification Techniques

Determining the Order of Elements within Groups

Digital Systems & Boolean Basics

Digital Fundamentals & Boolean Algebra

Boolean Expression

SOP & POS Canonical Forms

Boolean Function Counts

Functional Completeness

Universal Realization