Scribd
Upload
11 views30 pages

Discrete Maths

Uploaded by

Padmapriya
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
11 views30 pages

Discrete Maths

Uploaded by

Padmapriya
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 30

NTA NET ASPIRANT ACADEMY

Expect Question:
1. Fundamental of logic
2. Relation
3. Graph Property – Complete Graph, Hamiltonian Graph, Bipartite
Graph.
4. Probability, Permutation, Combination.
5. Linear Programming Problem – Graphical Method, Transportation
Method, Assignment Method.
NTA NET ASPIRANT ACADEMY
Proposition: A proposition is a collection of declarative statements that has either a truth
value "true” or a truth value "false".

Ex: There will be snow in January. (Proposition)

You must study Discrete Mathematics. (No Proposition)

Conjunction: P.Q Implication: P -> Q

Disjunction: P + Q Biconditional P <-> Q


NTA NET ASPIRANT ACADEMY
Conjunction: A conjunction is a compound statement formed by joining two statements
with the connector AND.
NTA NET ASPIRANT ACADEMY
Disjunction: A disjunction is a compound statement formed by joining two statements
with the connector OR.
NTA NET ASPIRANT ACADEMY
Implication: An implication is the compound statement of the form “if p, then q.” It is
denoted p ⇒ q, which is read as “ p implies q.”
NTA NET ASPIRANT ACADEMY
Bi conditional: The equivalence P ↔ Q is true if both P and Q are true OR both P
and Q are false.
NTA NET ASPIRANT ACADEMY
Negation: If “P” is a statement, then the negation of statement P is represented by ~P. The
symbols used to represent the negation of a statement are “~” or “¬”.
NTA NET ASPIRANT ACADEMY
NTA NET ASPIRANT ACADEMY
Reflexive Relation:

A = { a,b,c}
R= { (a,b), (a,a), (b,b), (b,c), (c,a), (c,c)}

Irreflexive Relation:
A = { a,b,c}
R= { (a,b), (b,c), (c,a)}

Symmetric Relation:
A = { a,b,c}
R= { (a,a), (b,b), (a,b), (b,c), (b,a), (c,b)}
NTA NET ASPIRANT ACADEMY
Anti Symmetric Relation:
A = { a,b,c}
R= { ((a,b), (b,c), (c,a), (c,c)}

Equivalence Relation: Reflexive + Symmetric + Transitive

Partial Order: Reflexive + Anti-Symmetric + Transitive


NTA NET ASPIRANT ACADEMY
Any Tree is 2 – Colorable. (True)

A graph G has no cycles of ODD length, if it is bipartite. (True)

A graph G is 2 – Colorable, if it is bipartite. (True)

A graph G can be colored with d+1 colors, if d is the maximum degree of any
vertex in the graph G. (True)
NTA NET ASPIRANT ACADEMY
A n-ary tree in which every internal node has exactly n children. The number
of Leaf node is (L) with I internal node will be

L = (n-1) * I + 1
A minimum spanning tree has (v-1) edges, where v is the number of vertices.
NTA NET ASPIRANT ACADEMY
Some of my friends are not perfect.
NTA NET ASPIRANT ACADEMY
A coin S = { H, T} n(S) = 2

Two Coin S = {HH, HT,TH,TT} n(S)=4

Three Coin S={HHH, HHT, HTH, THH, TTT, TTH, THT, HTT} n(S)=8

Four Coin S={HHHH, HHHT, HHTH, HTHH, THHH, HHTT, HTHT, THHT, HTTH,
THTH, TTHH, TTTT, TTTH, TTHT, THTT, HTTT} n(S) =16
NTA NET ASPIRANT ACADEMY
Relation:
NTA NET ASPIRANT ACADEMY
Relation:
NTA NET ASPIRANT ACADEMY
By Handshaking Theorem

Sum & Product of vertices and degree = 2E


E = N -1

Cyclomatic Complexity (Region) = E – V + 2

Bounded Face ( Predicate Node) = Region – 1


NTA NET ASPIRANT ACADEMY
Time Complexity
NTA NET ASPIRANT ACADEMY
Complete Graph: A graph on which exactly one edge is present between every pair of
vertices is called as a complete graph.
NTA NET ASPIRANT ACADEMY
Bipartite Graph: A bipartite graph is a graph where
• Vertices can be divided into two sets x and y.
• The vertices of set X only join with the vertices of set Y.
NTA NET ASPIRANT ACADEMY
Hamiltonian Graph: If there exist a closed walk in the connected graph that visits every
vertex of the graph exactly once without repeating the edges.
NTA NET ASPIRANT ACADEMY
Hamiltonian Graph: If there exist a closed walk in the connected graph that visits every
vertex of the graph exactly once without repeating the edges.
NTA NET ASPIRANT ACADEMY
Kruskal’s Algorithm: - Kruskal’s algorithm to find the minimum cost spanning tree uses
Greedy approach.

A minimum spanning tree has (V-1) edges, where V is the number of vertices in the
given graph.

Dijkstra’s Algorithm – Single Source Shortest Path Problem with non – negative edge
weight.

Bellman – Ford Algorithm – Single Source Shortest Path Problem with negative edge
weight.
NTA NET ASPIRANT ACADEMY
Prim’s Algorithm – Greedy Approach – Finds a minimum spanning tree for a weighted
undirected graph.

Floyd – Warshall algorithm: Finding shortest path in a weighted graph with positive or
negative edge weights. All pairs shortest path problem.

Divide & Conquer Paradigm:


Quick Sort
Merge Sort
Finding the closet pair of points
Syntatic Analysis
NTA NET ASPIRANT ACADEMY
Dynamic Programming:
- Travelling Salesman Problem
- Bellman – Ford algorithm for finding the shortest distance in a graph.
- Backward induction
- Floyd’s All – Pairs Shortest Path Algorithm.
- Optimal Polygon Triangulation.
Greedy Algorithm:
- Huffman Coding
- Dijkstra’s Algorithm
- Decision tree learning
- Kruskal’s Algorithm
- Prim’s Algorithm
NTA NET ASPIRANT ACADEMY
Backtracking Paradigm:
- Eight Queen Problem
- Constraint satisfaction Problem
- Combinatorial Optimization Problems
- Subset sum problem.
Planar Graph: In a graph theory, a planar graph is a graph.
- No Edges cross each other.
- Edges intersect at only at their endpoints.
- A connected graph can be draw without any edges crossing.
NTA NET ASPIRANT ACADEMY
G is Bipartite Graph.

G is 2 – colorable.

G has no cycles of odd length.

Depth – first search is used to traverse a rooted tree.

Preorder, Post order, In order used to list the vertices of an ordered rooted tree.

Huffman Algorithm is used to find an Optimal binary tree with given weights.

Topological Sorting Provides a labelling such that the parents have larger labels than their children.
NTA NET ASPIRANT ACADEMY
Complete Graph: Kn

5 vertices 9 Edges – Planar 5 vertices 10 Edges – Non planar.


6 vertices 12 Edges – Planar 6 vertices 13,14,15 edges – Non planar.
4 Vertices 6 Edges – Planar.

Bipartite Graph:

- Always Planar Graph. - 9 edges – Non planar

- 6,7,8 edges Planar Graph.


NTA NET ASPIRANT ACADEMY
Balanced Transportation Problem:

Total Number of Supply = Total Number of Demand


NTA NET ASPIRANT ACADEMY
To Check Non Degeneracy Problem:

Number of independent allocation = m+n-1


M – Number of Rows
N – Number of Columns

Degeneracy Problem: Number of independent allocation is less than m+n-1.

You might also like