The Wayback Machine - https://web.archive.org/web/20240926092151/https://www.geeksforgeeks.org/engineering-mathematics-tutorials/
Open In App

Engineering Mathematics Tutorials

Last Updated : 29 Jul, 2024
Summarize
Comments
Improve
Suggest changes
Like Article
Like
Save
Share
Report
News Follow

Engineering mathematics is a vital component of the engineering discipline, offering the analytical tools and techniques necessary for solving complex problems across various fields. Whether you’re designing a bridge, optimizing a manufacturing process, or developing algorithms for computer systems, a solid understanding of mathematical principles is crucial.

Check: Recent Articles on Engineering Mathematics

Table of Content

Discrete Mathematics

Propositional and First Order Logic :

  1. Introduction to Propositional Logic
  2. Introduction to Propositional Logic | Set 2
  3. Propositional Equivalences
  4. Predicates and Quantifiers
  5. Predicates and Quantifiers | Set 2
  6. Some theorems on Nested Quantifiers
  7. Rules of Inference
  8. PDNF and PCNF in Discrete Mathematics

Set Theory :

  1. Introduction
  2. Set Operations
  3. Inclusion-Exclusion and its various Applications
  4. Power Set and its Properties
  5. Partial Orders and Lattices
  6. Groups
  7. Introduction and types of Relations
  8. Discrete Mathematics | Representing Relations
  9. Relations | Representations in Matrices and Graphs
  10. Closure of Relations and Equivalence Relations
  11. Number of possible Equivalence Relations on a finite set
  12. Classes (Injective, surjective, Bijective) of Functions
  13. Total number of possible functions
  14. Generating Functions | Introduction and Prerequisites
  15. Generating Functions – Set 2
  16. Sequence, Series and Summations
  17. Independent Sets, Covering and Matching
  18. Introduction to Proofs
  19. Hasse Diagrams
  20. Introduction to Mojette transform
  21. Rings, Integral domains and Fields

>> Quiz on Set Theory and Algebra

Combinatorics :

  1. Pigeon Hole Principle
  2. Combinatorics Basics
  3. PnC and Binomial Coefficients
  4. Generalized PnC Set 1
  5. Generalized PnC Set 2
  6. Corollaries of Binomial Theorem
  7. Number of triangles in a plane if no more than two points are collinear
  8. Sum of squares of even and odd natural numbers
  9. Finding nth term of any Polynomial Sequence
  10. Discrete Mathematics | Types of Recurrence Relations – Set 2

>> Combination and Permutation Practice Questions | Set 1
>> Problem on permutations and combinations | Set 2

Probability :

  1. Mathematics | Probability
  2. Conditional Probability
  3. Bayes’s Formula for Conditional probability
  4. Prosecutor’s Fallacy
  5. Random Variables

Graph Theory :

  1. Graph Theory Basics – Set 1
  2. Graph Theory Basics – Set 2
  3. Graph Types and Applications
  4. Euler and Hamiltonian Paths
  5. Planar Graphs and Graph Coloring
  6. Graph Isomorphisms and Connectivity
  7. Matching (graph theory)
  8. Betweenness Centrality (Centrality Measure)
  9. Mathematics | Walks, Trails, Paths, Cycles and Circuits in Graph
  10. Graph measurements: length, distance, diameter, eccentricity, radius, center
  11. Relationship between number of nodes and height of binary tree

>> Graph theory practice questions

Engineering Mathematics

Linear Algebra :

  1. Matrix Introduction
  2. Different Operations on Matrices
  3. Representations of Matrices and Graphs in Relations
  4. Eigen Values and Eigen Vectors
  5. System of Linear Equations
  6. LU Decomposition of a System of Linear Equations
  7. Doolittle Algorithm : LU Decomposition

>> Quiz on Linear Algebra

Calculus :

  1. Limits, Continuity and Differentiability
  2. Cauchy’s Mean Value Theorem
  3. Lagrange’s Mean Value Theorem
  4. Rolle’s Mean Value Theorem
  5. Unimodal functions and Bimodal functions
  6. Surface Area and Volume of Hexagonal Prism
  7. Inverse functions and composition of functions
  8. Indefinite Integrals

Statistics and Numerical Methods :

  1. Mean, Variance and Standard Deviation
  2. Newton’s Divided Difference Interpolation Formula
  3. Law of total probability
  4. Probability Distributions Set 1 (Uniform Distribution)
  5. Probability Distributions Set 2 (Exponential Distribution)
  6. Probability Distributions Set 3 (Normal Distribution)
  7. Probability Distributions Set 4 (Binomial Distribution)
  8. Probability Distributions Set 5 (Poisson Distribution)
  9. Homogeneous Poisson Process
  10. Nonhomogeneous Poisson Processes
  11. Renewal processes in probability
  12. Mathematics | Covariance and Correlation
  13. Scales of Measurement
  14. Univariate, Bivariate and Multivariate data and its analysis
  15. Hypergeometric Distribution model

Quick Links :



R
rahulsharmagfg1
News
Improve
Next Article
Matrices

Similar Reads

Engineering Mathematics - GATE CSE Previous Year Questions
Solving GATE Previous Year's Questions (PYQs) not only clears the concepts but also helps to gain flexibility, speed, accuracy, and understanding of the level of questions generally asked in the GATE exam, and that eventually helps you to gain good marks in the examination. Previous Year Questions help a candidate practice and revise for GATE, whic
4 min read
Graph Isomorphisms and Connectivity | Engineering Mathematics
Graph theory is a fundamental area in mathematics and computer science, which studies the properties of graphs and their applications. Two essential concepts in graph theory are graph isomorphisms and connectivity. Graph isomorphisms help determine if two graphs are structurally identical, while connectivity measures the degree to which the vertice
3 min read
Application of Partial Derivatives in Engineering Mathematics
Application of Partial Derivatives: Partial derivatives can be used to find the maximum and minimum value (if they exist) of a two-variable function. We try to locate a stationary point with zero slope and then trace maximum and minimum values near it. The practical application of maxima/minima is to maximize profit for a given curve or minimize lo
9 min read
Mathematics | Probability Distributions Set 2 (Exponential Distribution)
The previous article covered the basics of Probability Distributions and talked about the Uniform Probability Distribution. This article covers the Exponential Probability Distribution which is also a Continuous distribution just like Uniform Distribution. Introduction - Suppose we are posed with the question- How much time do we need to wait befor
5 min read
Discrete Mathematics | Types of Recurrence Relations - Set 2
Prerequisite - Solving Recurrences, Different types of recurrence relations and their solutions, Practice Set for Recurrence Relations The sequence which is defined by indicating a relation connecting its general term an with an-1, an-2, etc is called a recurrence relation for the sequence. Types of recurrence relations First order Recurrence relat
4 min read
Mathematics | Indefinite Integrals
Antiderivative - Definition :A function ∅(x) is called the antiderivative (or an integral) of a function f(x) of ∅(x)' = f(x). Example : x4/4 is an antiderivative of x3 because (x4/4)' = x3. In general, if ∅(x) is antiderivative of a function f(x) and C is a constant.Then, {∅(x)+C}' = ∅(x) = f(x). Indefinite Integrals
4 min read
Mathematics | Generating Functions - Set 2
Prerequisite - Generating Functions-Introduction and Prerequisites In Set 1 we came to know basics about Generating Functions. Now we will discuss more details on Generating Functions and its applications. Exponential Generating Functions - Let [Tex]h_0, h_1, h_2, ........., h_n, ...... [/Tex]e a sequence. Then its exponential generating function,
3 min read
Mathematics | Problems On Permutations | Set 2
Prerequisite - Permutation and Combination, Permutations | Set 1 Formula's Used : P(n, r) = n! / (n-r)! Example-1 : How many words can be formed from the letters of the word WONDER, such that these begin with W and end with R? Explanation : If we fix W in the beginning and R at the end, then the remaining 4 letters can be arranged in 4P4 ways. Thus
3 min read
Discrete Mathematics - GATE CSE Previous Year Questions
Solving GATE Previous Year's Questions (PYQs) not only clears the concepts but also helps to gain flexibility, speed, accuracy, and understanding of the level of questions generally asked in the GATE exam, and that eventually helps you to gain good marks in the examination. Previous Year Questions help a candidate practice and revise for GATE, whic
4 min read
Mathematics | Graph Theory Basics - Set 1
A graph is a data structure that is defined by two components : A node or a vertex.An edge E or ordered pair is a connection between two nodes u,v that is identified by unique pair(u,v). The pair (u,v) is ordered because (u,v) is not same as (v,u) in case of directed graph.The edge may have a weight or is set to one in case of unweighted graph.Cons
4 min read
Mathematics | Generalized PnC Set 1
Prerequisite - PnC and Binomial Coefficients So far every problem discussed in previous articles has had sets of distinct elements, but sometimes problems may involve repeated use of elements. This article covers such problems, where elements of the set are indistinguishable (or identical or not distinct). Permutations with repetition -Counting per
6 min read
Mathematics | Generalized PnC Set 2
Prerequisite - Generalized PnC Set 1 Combinatorial problems can be rephrased in several different ways, the most common of which is in terms of distributing balls into boxes. So we must become familiar with the terminology to be able to solve problems. The balls and boxes can be either distinguishable or indistinguishable and the distribution can t
5 min read
Mathematics | Graph theory practice questions
Problem 1 - There are 25 telephones in Geeksland. Is it possible to connect them with wires so that each telephone is connected with exactly 7 others. Solution - Let us suppose that such an arrangement is possible. This can be viewed as a graph in which telephones are represented using vertices and wires using the edges. Now we have 25 vertices in
4 min read
Mathematics | Hypergeometric Distribution model
Hypergeometric Distribution Model is used for estimating the number of faults initially resident in a program at the beginning of the test or debugging process based on the hypergeometric distribution. Let [Tex]$C_i-1$[/Tex] be the cumulative number of errors already detected so far by [Tex]$t_1, t_2, ...., t_i-1$[/Tex], and let [Tex]$N_i[/Tex] be
2 min read
Mathematics | Probability Distributions Set 5 (Poisson Distribution)
The previous article covered the Binomial Distribution. This article talks about another Discrete Probability Distribution, the Poisson Distribution. Introduction -Suppose an event can occur several times within a given unit of time. When the total number of occurrences of the event is unknown, we can think of it as a random variable. This random v
4 min read
Discrete Mathematics | Representing Relations
Prerequisite - Introduction and types of Relations Relations are represented using ordered pairs, matrix and digraphs: Ordered Pairs - In this set of ordered pairs of x and y are used to represent relation. In this corresponding values of x and y are represented using parenthesis. Example: {(1, 1), (2, 4), (3, 9), (4, 16), (5, 25)}This represent sq
2 min read
Mathematics | Problems On Permutations | Set 1
Permutations are a fundamental concept in combinatorics, dealing with the arrangement of objects in a specific order. In mathematical terms, a permutation is an arrangement of a set of elements in a particular sequence or order. Understanding permutations is crucial not only in mathematics but also in various fields of engineering where precise arr
6 min read
Types of Sets in Discrete Mathematics
A set in discrete mathematics is a collection of distinct objects, considered as an object in its own right. Sets are fundamental objects in mathematics, used to define various concepts and structures. In this article, we will discuss Types of Sets in Discrete Structure or Discrete Mathematics. Also, we will cover the examples. Let's discuss one by
13 min read
Mathematics | Combinatorics Basics
Combinatorics is the branch of Mathematics dealing with the study of finite or countable discrete structures. It includes the enumeration or counting of objects having certain properties. Counting helps us solve several types of problems such as counting the number of available IPv4 or IPv6 addresses.  It plays a crucial role in various fields such
10 min read
Mathematics | Euler and Hamiltonian Paths
Euler and Hamiltonian paths are fundamental concepts in graph theory, a branch of mathematics that studies the properties and applications of graphs. An Euler path visits every edge of a graph exactly once, while a Hamiltonian path visits every vertex exactly once. These paths have significant applications in various fields, including computer scie
9 min read
Types of Proofs - Predicate Logic | Discrete Mathematics
The most basic form of logic is propositional logic. Propositions, which have no variables, are the only assertions that are considered. Because there are no variables in propositions, they are either always true or always false.Example - P: 2 + 4 = 5. (Always False) is a proposition.Q: y * 0 = 0. (Always true) is a proposition.The majority of math
14 min read
Mathematics | Probability Distributions Set 1 (Uniform Distribution)
Prerequisite - Random Variable In probability theory and statistics, a probability distribution is a mathematical function that can be thought of as providing the probabilities of occurrence of different possible outcomes in an experiment. For instance, if the random variable X is used to denote the outcome of a coin toss ("the experiment"), then t
4 min read
Mathematics | Probability Distributions Set 3 (Normal Distribution)
The previous two articles introduced two Continuous Distributions: Uniform and Exponential. This article covers the Normal Probability Distribution, also a Continuous distribution, which is by far the most widely used model for continuous measurement. Introduction - Whenever a random experiment is replicated, the Random Variable that equals the ave
5 min read
PDNF and PCNF in Discrete Mathematics
PDNF (Principal Disjunctive Normal Form)It stands for Principal Disjunctive Normal Form. It refers to the Sum of Products, i.e., SOP. For eg. : If P, Q, and R are the variables then (P. Q'. R) + (P' . Q . R) + (P . Q . R') is an example of an expression in PDNF. Here '+' i.e. sum is the main operator. You might be confused about whether there exist
4 min read
Mathematics | Independent Sets, Covering and Matching
Mathematics | Independent Sets, Covering and Matching1. Independent SetsA set of vertices I is called an independent set if no two vertices in set I are adjacent to each other in other words the set of non-adjacent vertices is called an independent set.It is also called a stable set.The parameter α0(G) = max { |I|: I is an independent set in G } is
5 min read
Discrete Mathematics | Hasse Diagrams
Hasse Diagram A Hasse diagram is a graphical representation of the relation of elements of a partially ordered set (poset) with an implied upward orientation. A point is drawn for each element of the partially ordered set (poset) and joined with the line segment according to the following rules:   If p<q in the poset, then the point correspondin
10 min read
Mathematics | Power Set and its Properties
For a given set S, Power set P(S) or 2^S represents the set containing all possible subsets of S as its elements. For example, S = {1, 2, 3} P(S) = {ɸ, {1}, {2}, {3} {1,2}, {1,3}, {2,3}, {1,2,3}} Number of Elements in Power SetFor a given set S with n elements, number of elements in P(S) is 2^n. As each element has two possibilities (present or abs
6 min read
Mathematics | Ring Homomorphisms
Ring Homomorphisms are a concept from abstract algebra that plays a crucial role in various applications, such as cryptography, coding theory, and systems theory. Understanding ring homomorphisms helps in the study and application of algebraic structures and their properties. Ring Homomorphism DefinitionA ring homomorphism is a function between two
7 min read
Mathematics | Total number of Possible Functions
In this article, we are discussing how to find a number of functions from one set to another. For understanding the basics of functions, you can refer to this: Classes (Injective, surjective, Bijective) of Functions. Number of functions from one set to another: Let X and Y be two sets having m and n elements respectively. In a function from X to Y,
5 min read
Mathematics | Probability Distributions Set 4 (Binomial Distribution)
The previous articles talked about some of the Continuous Probability Distributions. This article covers one of the distributions which are not continuous but discrete, namely the Binomial Distribution. Introduction - To understand the Binomial distribution, we must first understand what a Bernoulli Trial is. A Bernoulli trial is a random experimen
5 min read
Article Tags :
We use cookies to ensure you have the best browsing experience on our website. By using our site, you acknowledge that you have read and understood our Cookie Policy & Privacy Policy
Lightbox