Discrete Mathematics for UGC NET Computer Science: Part 1

Learn Discrete Mathematics in Hindi for UGC NET, SLET Computer Science and Other Competitive Exams

Ratings 4.91 / 5.00
Discrete Mathematics for UGC NET Computer Science: Part 1

What You Will Learn!

  • Proposition Logic and Predicate Logic
  • Propositional Equivalence
  • Normal Form
  • Predicates and Quantifiers
  • Nested Quantifiers
  • Rules of Inference
  • Set Operations
  • Representation and properties of Relations
  • Equivalence Relations
  • Partially ordering
  • Basics of Counting
  • Pigeonhole Principle
  • Permutation and Combinations
  • Inclusion-Exclusion Principle
  • Mathematical Induction
  • Probability
  • Bayes' Theorem
  • Groups
  • Subgroups
  • Semi Groups
  • Product and Quotients of Algebraic Structures
  • Isomorphism
  • Homomorphism
  • Automorphism
  • Rings
  • Integral Domains
  • Fields
  • Applications of Group Theory
  • Simple Graph
  • Multigraph
  • Weighted Graph
  • Paths and circuits
  • Shortest Path in Weighted Graph
  • Eulerian Paths and Circuits
  • Hamiltonian Paths and Circuits
  • Planner Graphs
  • Bipartite Graphs
  • Tree and Rooted Tree
  • Prefix Codes
  • Tree Traversal
  • Spanning Tree and Cut-sets
  • Boolean Function and its Represents
  • Simplifications of Boolean Functions
  • Linear Programming
  • Graphical solution
  • Simplex and Dual Simplex Method
  • Sensitive Analysis
  • Integer Programming
  • Transportation and Assignment Model
  • PERT-CPM - Diagram Representation
  • Critical Path Calculations
  • Resource Levelling

Description

Discrete mathematics refers to a branch of mathematics that deals with non-continuous (i.e., discontinuous or discrete) data. Discrete mathematics is a fundamental course in computer science as it is extremely vital for understanding how computers process information. Discrete mathematics has many applications in computer science and engineering. In fact, it is the foundation for much of the technology we use every day.

This course offers you an in-depth introduction to discrete mathematics covering various concepts and kinds of questions asked in discrete mathematics topics in UGC NET, SLET and other competitive examinations. More specifically, this course will cover the following topics:

  • Proposition Logic and Predicate Logic

  • Proposiotion Equivalence

  • Normal Form

  • Predicates and Quantifiers

  • Nested Quantifiers

  • Rules of Inference

  • Set Operations

  • Representation and properties of Relations

  • Equivalennce Relations

  • Partially ordering

  • Basics of Counting

  • Pigeonhole Principle

  • Permutation and Combinations

  • Inclusion-Exclusion Principle

  • Mathematical Induction

  • Probability

  • Bayes' Theorem

  • Groups

  • Subgroups

  • Semi Groups

  • Product and Quotients of Algebraic Structures

  • Isomorphism

  • Homomorphism

  • Automorphism

  • Rings

  • Integral Domains

  • Fields

  • Applications of Group Theory

  • Simple Graph

  • Multigraph

  • Weighted Graph

  • Paths and circuits

  • Shortest Path in Weighted Graph

  • Eulerian Paths and Circuits

  • Hamiltonian Paths and Circuits

  • Planner Graphs

  • Graph Coloring

  • Bipartite Graphs

  • Tree and Rooted Tree

  • Prefix Codes

  • Tree Traversal

  • Spanning Tree and Cut-sets

  • Boolean Function and its Represents

  • Simplifications of Boolean Functions

  • Linear Programming

  • Graphical solution

  • Simplex and Dual Simplex Method

  • Sensitive Analysis

  • Integer Programming

  • Transportation and Assignment Model

  • PERT-CPM - Diagram Representation

  • Critical Path Calculations

  • Resource Levelling

We have built this course to help you sail through all major concepts of discrete mathematics. Comprehensive coverage offered in this course would be of immense value for you in approaching the topic of Discrete Mathematics for your UGC NET, SLET, and other competitive exams with confidence.

So, Click on the Sign Up button and start learning Discrete Mathematics today.

Who Should Attend!

  • Students of Computer Science who wish to understand discrete mathematics
  • Students of Computer Science who wish to clear UGC NET Exam in Computer Science

TAKE THIS COURSE

Tags

  • Computer Science
  • Discrete Math
  • Logic

Subscribers

18

Lectures

17

TAKE THIS COURSE



Related Courses