Skip to content
geeksforgeeks
  • Tutorials
    • Python
    • Java
    • Data Structures & Algorithms
    • ML & Data Science
    • Interview Corner
    • Programming Languages
    • Web Development
    • CS Subjects
    • DevOps And Linux
    • School Learning
    • Practice Coding Problems
  • Courses
    • DSA to Development
    • Get IBM Certification
    • Newly Launched!
      • Master Django Framework
      • Become AWS Certified
    • For Working Professionals
      • Interview 101: DSA & System Design
      • Data Science Training Program
      • JAVA Backend Development (Live)
      • DevOps Engineering (LIVE)
      • Data Structures & Algorithms in Python
    • For Students
      • Placement Preparation Course
      • Data Science (Live)
      • Data Structure & Algorithm-Self Paced (C++/JAVA)
      • Master Competitive Programming (Live)
      • Full Stack Development with React & Node JS (Live)
    • Full Stack Development
    • Data Science Program
    • All Courses
  • Number System
  • Algebra
  • Set Theory
  • Geometry
  • Linear Algebra
  • Trigonometry
  • Logarithms
  • Statistics
  • Probability
  • Calculus
  • Discrete Mathematics
  • Engineering Math Practice Problems
Open In App
Next Article:
Propositional Logic
Next article icon

Discrete Mathematics Tutorial

Last Updated : 08 Apr, 2025
Comments
Improve
Suggest changes
Like Article
Like
Report

Discrete Mathematics is a branch of mathematics that is concerned with "discrete" mathematical structures instead of "continuous". Discrete mathematical structures include objects with distinct values like graphs, integers, logic-based statements, etc. In this tutorial, we have covered all the topics of Discrete Mathematics for computer science like set theory, recurrence relations, group theory, and graph theory.

Discrete-Mathematics-Tutorial

 

Recent Articles on Discrete Mathematics!

Mathematical Logic

Learn propositional and predicate logic, equivalences, proofs, and rules of inference for logical reasoning.

  • Introduction to Propositional Logic
  • Applications of Propositional Logic
  • Propositional and Predicate Logic
  • Propositional Equivalences
  • Normal and Principle Forms
  • Predicates and Quantifiers
  • Nested Quantifiers Theorem
  • Rules of Inference
  • Introduction to Proofs

Sets and Relations

Understand set theory, operations, relations, functions, and equivalence relations with real-world applications.

  • Set Theory
  • Types of Sets
  • Set Operations
  • Rough Set Theory
  • Functions
  • Sequence and Summations
  • Representations of Matrices and Graphs in Relations
  • Types of Relation
  • Closure of Relation and Equivalence Relations

Mathematical Induction

Explore counting techniques, permutations, combinations, generating functions, and probability concepts.

  • Mathematical Induction
  • Basics of Counting
  • Pascal's Identity
  • Pigeonhole Principle
  • Permutations and Combinations
  • Generalized Permutations and Combinations
  • Generating Functions
  • Inclusion-Exclusion Principle
  • Discrete Probability Theory

Boolean Algebra

Study Boolean functions, algebraic theorems, properties, and methods for minimizing Boolean expressions.

  • Boolean Functions
  • Boolean Algebraic Theorem
  • Properties of Boolean Algebra
  • Number of Boolean Functions
  • Minimization of Boolean Functions

Optimization

Learn linear programming, simplex algorithm, and PERT for solving optimization problems.

  • Linear Programming 
  • Graphical Solution For Linear Programming
  • Simplex Algorithm
  • PERT 

Ordered Sets & Lattices

Understand partially ordered sets, Hasse diagrams, and lattice theory in mathematical structures.

  • Partially Ordered Sets
  • Elements of POSET
  • Hasse Diagrams
  • Lattices

Probability Theory

Dive into probability axioms, conditional probability, and common distributions like Poisson, normal, and exponential.

  • Basic Concepts of Probability
  • Probability Axioms
  • Properties of Probability
  • Conditional Probability
  • Bayes' Theorem
  • Uniform Distribution
  • Exponential Distribution
  • Normal Distribution
  • Poisson Distribution

Graph Theory

Explore graph types, algorithms (like Dijkstra’s and DFS), and applications in problem-solving and optimization.

  • Introduction to Graph
  • Basic Terminology of a Graph
  • Types of a Graph
  • Walks, Trails, Paths, and Circuits
  • Graph Distance components
  • Cut-Vertices and Cut-Edges
  • Bridge in Graph
  • Independent sets
  • Shortest Path Algorithms [Dijkstra's Algorithm]
  • Application of Graph Theory
  • Graph Traversals[DFS]
  • Graph Traversals[BFS]
  • Characterizations of Trees
  • Prim's Minimum Spanning Tree 
  • Kruskal's Minimum Spanning Tree
  • Huffman Codes 
  • Tree Traversals
  • Traveling Salesman Problem

Special Graph

Study Eulerian and Hamiltonian graphs, including algorithms and problems like the Traveling Salesman Problem.

  • Bipartite Graphs 
  • Independent Sets and Covering
  • Eulerian graphs
  • Eulerian graphs- Fleury’s algorithm
  • Eulerian graphs- Chinese-Postman-Problem Hamilton

Matching

Learn about matching in graphs, approximation algorithms, and optimization techniques.

  • Matching- Basics, Perfect, Bipartite
  • Approximation Algorithms

Vertex Colorings

Explore graph colorings, chromatic numbers, and algorithms like Greedy Coloring for graph theory.

  • Chromatic Numbers, Greedy Coloring Algorithm
  • Edge Coloring
  • Vizing Theorem
  • Planar Graph- Basics, Planarity Testing
  • Directed Graphs- Degree Centrality
  • Directed Graphs- Weak Connectivity
  • Directed Graphs- Strong Components 
  • Directed Graphs- Eulerian, Hamilton Directed Graphs
  • Directed Graphs- Tarjans' Algorithm To Find Strongly Connected Component
  • Handshaking in Graph Theorem

Group Theory

Understand the basics of groups, subgroups, isomorphisms, and structures like rings and fields.

  • Groups, Subgroups, Semi Groups
  • Isomorphism, Homomorphism
  • Automorphism
  • Rings, Integral domains, Fields

Quick Links

Access last-minute notes and quizzes to reinforce your learning in discrete mathematics.

  • Last-Minute Notes (LMNs)
  • Quizzes on Discrete Mathematics

Conclusion

This Discrete Mathematics Tutorial and taken a giant leap towards mastering the fundamental concepts that will propel you to greatness in the world of software engineering and beyond. By applying the concepts learned in this tutorial to practice problems and real-world examples.


Next Article
Propositional Logic

A
abhishek1
Improve
Article Tags :
  • Computer Subject
  • Engineering Mathematics
  • Discrete Mathematics

Similar Reads

    Discrete Mathematics Tutorial
    Discrete Mathematics is a branch of mathematics that is concerned with "discrete" mathematical structures instead of "continuous". Discrete mathematical structures include objects with distinct values like graphs, integers, logic-based statements, etc. In this tutorial, we have covered all the topic
    3 min read

    Mathematical Logic

    Propositional Logic
    Logic is the basis of all mathematical reasoning and all automated reasoning. The rules of logic specify the meaning of mathematical statements. These rules help us understand and reason with statements such as -\exists~x~such~that~x~\neq~a^2~+~b^2,~where~\:x,~a,~b\in~ZWhich in Simple English means
    10 min read
    Discrete Mathematics - Applications of Propositional Logic
    A proposition is an assertion, statement, or declarative sentence that can either be true or false but not both. For example, the sentence "Ram went to school." can either be true or false, but the case of both happening is not possible. So we can say, the sentence "Ram went to school." is a proposi
    11 min read
    Propositional Equivalences
    Propositional equivalences are fundamental concepts in logic that allow us to simplify and manipulate logical statements. Understanding these equivalences is crucial in computer science, engineering, and mathematics, as they are used to design circuits, optimize algorithms, and prove theorems. This
    7 min read
    Predicates and Quantifiers
    Predicates and Quantifiers are fundamental concepts in mathematical logic, essential for expressing statements and reasoning about the properties of objects within a domain. These concepts are widely used in computer science, engineering, and mathematics to formulate precise and logical statements.
    6 min read
    Mathematics | Some Theorems on Nested Quantifiers
    Quantifiers are expressions that indicate the scope of the term to which they are attached, they are predicates. A predicate is a property the subject of the statement can have. For example, in the statement "the sum of x and y is greater than 5", the predicate 'Q' is- sum is greater than 5, and the
    6 min read
    Rules of Inference
    Rules of Inference: Rules of inference are logical tools used to derive conclusions from premises. They form the foundation of logical reasoning, allowing us to build arguments, prove theorems, and solve problems in mathematics, computer science, and philosophy. Understanding these rules is crucial
    9 min read
    Mathematics | Introduction to Proofs
    Mathematical proof is an argument we give logically to validate a mathematical statement. To validate a statement, we consider two things: A statement and Logical operators. A statement is either true or false but not both. Logical operators are AND, OR, NOT, If then, and If and only if. Coupled wit
    7 min read

    Sets and Relations

    Set Theory
    Set theory is a branch of mathematics that deals with collections of objects, called sets. A set is simply a collection of distinct elements, such as numbers, letters, or even everyday objects, that share a common property or rule.Example of SetsSome examples of sets include:A set of fruits: {apple,
    3 min read
    Types Of Sets
    In mathematics, a set is defined as a well-defined collection of distinct elements that share a common property. These elements— like numbers, letters, or even other sets are listed in curly brackets "{ }" and represented by capital letters. For example, a set can include days of the week. The diffe
    13 min read
    Irreflexive Relation on a Set
    A relation is a subset of the cartesian product of a set with another set. A relation contains ordered pairs of elements of the set it is defined on. To learn more about relations refer to the article on "Relation and their types". What is Irreflexive Relation? A relation R on a set A is called irre
    6 min read
    Check Reflexive Relation on Set
    A relation is a subset of the cartesian product of a set with another set. A relation contains ordered pairs of elements of the set it is defined on. To learn more about relations refer to the article on "Relation and their types".What is a Reflexive Relation?A relation R on a set A is called reflex
    7 min read
    Check Transitive Relation on a Set
    A relation is a subset of the cartesian product of a set with another set. A relation contains ordered pairs of elements of the set it is defined on. To learn more about relations refer to the article on "Relation and their types".What is a Transitive Relation?A relation R on a set A is called trans
    9 min read
    Set Operations
    A set is simply a collection of distinct objects. These objects can be numbers, letters, or even people—anything! We denote a set using curly brackets.For example: A = {1, 2, 3}Set Operations can be defined as the operations performed on two or more sets to obtain a single set containing a combinati
    10 min read
    Types of Functions
    Functions are defined as the relations which give a particular output for a particular input value. A function has a domain and codomain (range). f(x) usually denotes a function where x is the input of the function. In general, a function is written as y = f(x).A function is a relation between two s
    15 min read
    Mathematics | Sequence, Series and Summations
    Sequences, series, and summations are fundamental concepts of mathematical analysis and it has practical applications in science, engineering, and finance.Table of ContentWhat is Sequence?Theorems on SequencesProperties of SequencesWhat is Series?Properties of SeriesTheorems on SeriesSummation Defin
    8 min read
    Representation of Relation in Graphs and Matrices
    Understanding how to represent relations in graphs and matrices is fundamental in engineering mathematics. These representations are not only crucial for theoretical understanding but also have significant practical applications in various fields of engineering, computer science, and data analysis.
    8 min read
    Relations in Mathematics
    Relation in Mathematics is defined as the relationship between two sets. If we are given two sets set A and set B and set A has a relation with set B then each value of set A is related to a value of set B through some unique relation. Here, set A is called the domain of the relation, and set B is c
    9 min read
    Closure of Relations
    Closure of Relations: In mathematics, especially in the context of set theory and algebra, the closure of relations is a crucial concept. It involves extending a given relation to include additional elements based on specific properties, such as reflexivity, symmetry, and transitivity. Understanding
    6 min read

    Mathematical Induction

    Pigeonhole Principle
    The Pigeonhole Principle is a fundamental concept in combinatorics and mathematics that states if more items are put into fewer containers than the number of items, at least one container must contain more than one item. This seemingly simple principle has profound implications and applications in v
    13 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 dis
    6 min read
    Discrete Maths | Generating Functions-Introduction and Prerequisites
    Discrete Maths | Generating Functions-Introduction and PrerequisitesPrerequisite - Combinatorics Basics, Generalized PnC Set 1, Set 2 Definition: Generating functions are used to represent sequences efficiently by coding the terms of a sequence as coefficients of powers of a variable (say) \big x in
    5 min read
    Inclusion Exclusion principle
    Given an array arr[] consisting of distinct prime numbers and an integer m, find how many numbers in the range from 1 to m (inclusive) are divisible by at least one of the prime numbers in the array.Examples:Input : arr[] = [2, 3, 5], m = 10Output : 8Explanation : From 1 to 10 there are 8 number whi
    7 min read

    Boolean Algebra

    Properties of Boolean Algebra
    The Boolean Algebra uses sets of rules for analyzing digital gates and circuits. In this article, we will be going through the Properties or Laws of the Boolean algebra. So first we will start our article by defining what are the properties of Boolean Algebra, and then we will go through what are Bo
    7 min read
    Number of Boolean functions
    A Boolean function is a mathematical function that takes one or more Boolean variables (each representing a binary value: true or false, 1 or 0) as input and produces a Boolean output (either true or false). Boolean functions are fundamental in fields like computer science, logic, and digital circui
    5 min read
    Minimization of Boolean Functions
    Boolean functions are used to represent logical expressions in terms of sum of minterms or product of maxterms. Number of these literals (minterms or maxterms) increases as the complexity of the digital circuit increases. This can lead to large and inefficient circuits. By minimizing Boolean functio
    4 min read
    Linear Programming
    Linear programming is a mathematical concept that is used to find the optimal solution of a linear function. This method uses simple assumptions for optimizing the given function. Linear Programming has a huge real-world application, and it is used to solve various types of problems.The term "linear
    15+ min read

    Ordered Sets & Lattices

    Elements of POSET | Maximal Element, Minimal Element , Lower and Upper Bounds
    Partially Ordered Set (POSET) is a fundamental concept in mathematics and computer science, providing a structured way to analyze and compare elements within a set. In a POSET, not every pair of elements needs to be comparable, making it a versatile tool for representing hierarchical relationships a
    10 min read
    Partial Order Relation on a Set
    A relation is a subset of the cartesian product of a set with another set. A relation contains ordered pairs of elements of the set it is defined on. What is a Partial Order Relation? A relation R on a set A is called a partial order relation if it is Reflexive Relation: (a, a) ∈ R ∀ a ∈ A, i.e. aRa
    15 min read
    Axiomatic Approach to Probability
    Hearing the word "probability" brings up ideas related to uncertainty or randomness. Although the concept of probability can be hard to describe formally, it helps us analyze how likely it is that a certain event will happen. This analysis helps us understand and describe many phenomena we see in re
    10 min read
    Properties of Probability
    ProbabilityProbability is the branch of mathematics that is concerned with the chances of occurrence of events and possibilities. Further, it gives a method of measuring the probability of uncertainty and predicting events in the future by using the available information.Probability is a measure of
    14 min read

    Probability Theory

    Uniform Distribution in Data Science
    Uniform Distribution also known as the Rectangular Distribution is a type of Continuous Probability Distribution where all outcomes in a given interval are equally likely. Unlike Normal Distribution which have varying probabilities across their range, Uniform Distribution has a constant probability
    5 min read
    Exponential Distribution
    The Exponential Distribution is one of the most commonly used probability distributions in statistics and data science. It is widely used to model the time or space between events in a Poisson process. In simple terms, it describes how long you have to wait before something happens, like a bus arriv
    3 min read
    Normal Distribution in Data Science
    Normal Distribution also known as the Gaussian Distribution or Bell-shaped Distribution is one of the widely used probability distributions in statistics. It plays an important role in probability theory and statistics basically in the Central Limit Theorem (CLT). It is characterized by its bell-sha
    6 min read
    Poisson Distribution in Data Science
    Poisson Distribution is a discrete probability distribution that models the number of events occurring in a fixed interval of time or space given a constant average rate of occurrence. Unlike the Binomial Distribution which is used when the number of trials is fixed, the Poisson Distribution is used
    7 min read

    Graph Theory

    Graph and its representations
    A Graph is a non-linear data structure consisting of vertices and edges. The vertices are sometimes also referred to as nodes and the edges are lines or arcs that connect any two nodes in the graph. More formally a Graph is composed of a set of vertices( V ) and a set of edges( E ). The graph is den
    12 min read
    Mathematics | Graph Theory Basics - Set 1
    A Graph is just a way to show connections between things. It is set of edges and vertices where each edge is associated with unordered pair of vertices. Graph is a data structure that is defined by two components :Node or Vertex: It is a point or joint between two lines like people, cities, or websi
    5 min read
    Types of Graphs with Examples
    A graph is a mathematical structure that represents relationships between objects by connecting a set of points. It is used to establish a pairwise relationship between elements in a given set. graphs are widely used in discrete mathematics, computer science, and network theory to represent relation
    9 min read
    Walks, Trails, Paths, Cycles and Circuits in Graph
    Walks, trails, paths, cycles, and circuits in a graph are sequences of vertices and edges with different properties. Some allow repetition of vertices and edges, while others do not. In this article, we will explore these concepts with examples.What is Walk?A walk in a graph is a sequence of vertice
    6 min read
    Dijkstra's Algorithm to find Shortest Paths from a Source to all
    Given a weighted undirected graph represented as an edge list and a source vertex src, find the shortest path distances from the source vertex to all other vertices in the graph. The graph contains V vertices, numbered from 0 to V - 1.Note: The given graph does not contain any negative edge. Example
    12 min read
    Prim’s Algorithm for Minimum Spanning Tree (MST)
    Prim’s algorithm is a Greedy algorithm like Kruskal's algorithm. This algorithm always starts with a single node and moves through several adjacent nodes, in order to explore all of the connected edges along the way.The algorithm starts with an empty spanning tree. The idea is to maintain two sets o
    15+ min read
    Kruskal’s Minimum Spanning Tree (MST) Algorithm
    A minimum spanning tree (MST) or minimum weight spanning tree for a weighted, connected, and undirected graph is a spanning tree (no cycles and connects all vertices) that has minimum weight. The weight of a spanning tree is the sum of all edges in the tree. In Kruskal's algorithm, we sort all edges
    9 min read
    Check whether a given graph is Bipartite or not
    Given a graph with V vertices numbered from 0 to V-1 and a list of edges, determine whether the graph is bipartite or not.Note: A bipartite graph is a type of graph where the set of vertices can be divided into two disjoint sets, say U and V, such that every edge connects a vertex in U to a vertex i
    8 min read
    Eulerian path and circuit for undirected graph
    Given an undirected connected graph with v nodes, and e edges, with adjacency list adj. We need to write a function that returns 2 if the graph contains an eulerian circuit or cycle, else if the graph contains an eulerian path, returns 1, otherwise, returns 0.A graph is said to be Eulerian if it con
    9 min read

    Special Graph

    Introduction to Graph Coloring
    Graph coloring refers to the problem of coloring vertices of a graph in such a way that no two adjacent vertices have the same color. This is also called the vertex coloring problem. If coloring is done using at most m colors, it is called m-coloring. Chromatic Number:The minimum number of colors ne
    11 min read
    Edge Coloring of a Graph
    In graph theory, edge coloring of a graph is an assignment of "colors" to the edges of the graph so that no two adjacent edges have the same color with an optimal number of colors. Two edges are said to be adjacent if they are connected to the same vertex. There is no known polynomial time algorithm
    9 min read
    Check if a graph is Strongly, Unilaterally or Weakly connected
    Given an unweighted directed graph G as a path matrix, the task is to find out if the graph is Strongly Connected or Unilaterally Connected or Weakly Connected. Strongly Connected: A graph is said to be strongly connected if every pair of vertices(u, v) in the graph contains a path between each othe
    12 min read
    Biconnected Components
    A biconnected component is a maximal biconnected subgraph. Biconnected Graph is already discussed here. In this article, we will see how to find biconnected component in a graph using algorithm by John Hopcroft and Robert Tarjan. In above graph, following are the biconnected components: 4--2 3--4 3-
    15+ min read
    Strongly Connected Components
    Strongly Connected Components (SCCs) are a fundamental concept in graph theory and algorithms. In a directed graph, a Strongly Connected Component is a subset of vertices where every vertex in the subset is reachable from every other vertex in the same subset by traversing the directed edges. Findin
    15+ min read

    Group Theory

    Mathematics | Graph Theory Basics - Set 1
    A Graph is just a way to show connections between things. It is set of edges and vertices where each edge is associated with unordered pair of vertices. Graph is a data structure that is defined by two components :Node or Vertex: It is a point or joint between two lines like people, cities, or websi
    5 min read
    Homomorphism & Isomorphism of Group
    We can say that  "o" is the binary operation on set G if: G is a non-empty set & G * G = { (a,b) : a , b∈ G } and o : G * G --> G. Here, aob denotes the image of ordered pair (a,b) under the function/operation o.Example - "+" is called a binary operation on G (any non-empty set ) if & onl
    7 min read
    Group Isomorphisms and Automorphisms
    In the study of algebraic structures, group isomorphisms and automorphisms play a fundamental role. By defining internal symmetries inside a group (automorphisms) and when two groups have the same structure (isomorphisms), these ideas aid in our understanding of the structure and symmetry of groups.
    7 min read
    Group in Maths: Group Theory
    Group theory is one of the most important branches of abstract algebra which is concerned with the concept of the group. A group consists of a set equipped with a binary operation that satisfies four key properties: specifically, it includes property of closure, associativity, the existence of an id
    13 min read
geeksforgeeks-footer-logo
Corporate & Communications Address:
A-143, 7th Floor, Sovereign Corporate Tower, Sector- 136, Noida, Uttar Pradesh (201305)
Registered Address:
K 061, Tower K, Gulshan Vivante Apartment, Sector 137, Noida, Gautam Buddh Nagar, Uttar Pradesh, 201305
GFG App on Play Store GFG App on App Store
Advertise with us
  • Company
  • About Us
  • Legal
  • Privacy Policy
  • In Media
  • Contact Us
  • Advertise with us
  • GFG Corporate Solution
  • Placement Training Program
  • Languages
  • Python
  • Java
  • C++
  • PHP
  • GoLang
  • SQL
  • R Language
  • Android Tutorial
  • Tutorials Archive
  • DSA
  • Data Structures
  • Algorithms
  • DSA for Beginners
  • Basic DSA Problems
  • DSA Roadmap
  • Top 100 DSA Interview Problems
  • DSA Roadmap by Sandeep Jain
  • All Cheat Sheets
  • Data Science & ML
  • Data Science With Python
  • Data Science For Beginner
  • Machine Learning
  • ML Maths
  • Data Visualisation
  • Pandas
  • NumPy
  • NLP
  • Deep Learning
  • Web Technologies
  • HTML
  • CSS
  • JavaScript
  • TypeScript
  • ReactJS
  • NextJS
  • Bootstrap
  • Web Design
  • Python Tutorial
  • Python Programming Examples
  • Python Projects
  • Python Tkinter
  • Python Web Scraping
  • OpenCV Tutorial
  • Python Interview Question
  • Django
  • Computer Science
  • Operating Systems
  • Computer Network
  • Database Management System
  • Software Engineering
  • Digital Logic Design
  • Engineering Maths
  • Software Development
  • Software Testing
  • DevOps
  • Git
  • Linux
  • AWS
  • Docker
  • Kubernetes
  • Azure
  • GCP
  • DevOps Roadmap
  • System Design
  • High Level Design
  • Low Level Design
  • UML Diagrams
  • Interview Guide
  • Design Patterns
  • OOAD
  • System Design Bootcamp
  • Interview Questions
  • Inteview Preparation
  • Competitive Programming
  • Top DS or Algo for CP
  • Company-Wise Recruitment Process
  • Company-Wise Preparation
  • Aptitude Preparation
  • Puzzles
  • School Subjects
  • Mathematics
  • Physics
  • Chemistry
  • Biology
  • Social Science
  • English Grammar
  • Commerce
  • World GK
  • GeeksforGeeks Videos
  • DSA
  • Python
  • Java
  • C++
  • Web Development
  • Data Science
  • CS Subjects
@GeeksforGeeks, Sanchhaya Education Private Limited, All rights reserved
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
Improvement
Suggest Changes
Help us improve. Share your suggestions to enhance the article. Contribute your expertise and make a difference in the GeeksforGeeks portal.
geeksforgeeks-suggest-icon
Create Improvement
Enhance the article with your expertise. Contribute to the GeeksforGeeks community and help create better learning resources for all.
geeksforgeeks-improvement-icon
Suggest Changes
min 4 words, max Words Limit:1000

Thank You!

Your suggestions are valuable to us.

What kind of Experience do you want to share?

Interview Experiences
Admission Experiences
Career Journeys
Work Experiences
Campus Experiences
Competitive Exam Experiences