Exception Handling in Programming
Last Updated :
28 Mar, 2024
Exception handling is a critical aspect of programming, enabling developers to manage unexpected or erroneous situations gracefully. In this article, we'll discuss the concept of exception handling, its importance, and best practices for implementing it effectively in various programming languages.
What is Exception Handling?
Exception handling is a programming concept used to manage errors that occur during the execution of a program. When an error occurs, the normal flow of the program is disrupted. The program creates an “exception” object that contains information about the error. The process of responding to this exception is called “exception handling”.
Basics of Exception Handling :
Exception Handling mainly Revolves around two concepts one is Exception other is Handling.
- Exception: An exception is an unwanted event that interrupts the normal flow of the program.
- Handling: A block of Code that Handles or continues the flow of the program even after the exception is occurred (e.g. Try-Catch Block).
Components of Exception Handling:
Exception handling typically involves three main components:
- Try Block: The code that may potentially throw an exception is enclosed within a try block. If an exception occurs within this block, the control is transferred to the corresponding catch block.
- Catch Block: This block catches and handles the exceptions thrown within the try block. Each catch block is associated with a specific type of exception, allowing developers to handle different types of errors separately.
- Finally Block (Optional): The finally block is executed regardless of whether an exception occurs or not. It is commonly used to perform cleanup tasks, such as closing files or releasing resources.
Exception Handling in C:
errno is a global variable indicating the error occurred during any function call and it is defined inside <errno.h> header file.
When a function is called in C, a variable named errno is automatically assigned a code (value) which can be used to identify the type of error that has been encountered. Different codes (values) for errno mean different types of errors.
C
// C program to check and rectify
// divide by zero condition
#include <stdio.h>
#include <stdlib.h>
void function(int);
int main()
{
int x = 0;
function(x);
return 0;
}
void function(int x)
{
float fx;
if (x == 0) {
printf("Error: Division by Zero Error\n");
exit(EXIT_FAILURE);
}
else {
fx = 10 / x;
printf("f(x) is: %.5f", fx);
}
}
OutputError: Division by Zero Error
Exception Handling in C++:
try
: This is used to specify a section of the code where a problem might occur and we want to handle it. catch
: This is used to handle the problem that was thrown. throw
: This is used when a problem occurs in the program.
C++
#include <iostream>
using namespace std;
// function to throw division by zero exception
void divide(int num, int den) {
if (den == 0) {
throw runtime_error("Division by zero error");
}
cout << "Result of division: " << num / den << endl;
}
int main() {
int numerator = 5, denominator = 0;
try {
divide(numerator, denominator);
} catch (const exception& e) {
cout << "Error: " << e.what() << endl;
}
return 0;
}
OutputError: Division by zero error
Exception Handling in Java:
- throw: Used to explicitly generate exceptions in code. For example, throwing an exception when a required parameter is null in a user authentication program.
- throws: Declares exceptions that might be thrown by a method but are not handled within the method itself. It informs the caller method about potential exceptions that need to be handled.
- try-catch: Used for exception handling in Java. The code that may throw an exception is enclosed within the try block, and exceptions are caught and handled in the catch block(s).
- finally: An optional block that follows a try-catch block. It is used for cleanup tasks and always executes, regardless of whether an exception occurred or not.
Java
/*package whatever //do not write package name here */
import java.io.*;
class GFG {
// Function to throw ArithmeticException
public static void divide(int num, int den)
throws ArithmeticException
{
if (den == 0) {
throw new ArithmeticException(
"Division by zero error");
}
System.out.print("Result of division: "
+ num / den);
}
public static void main(String[] args)
{
int numerator = 5;
int denominator = 0;
try {
divide(numerator, denominator);
}
catch (ArithmeticException e) {
System.out.print("Error: " + e.getMessage());
}
finally {
System.out.println();
}
}
}
OutputError: Division by zero error
Exception Handling in Python:
In Python, the try-except-finally statement facilitates structured exception handling with three essential components: the try block, the except block, and the finally block.
- try Block: Encloses code where exceptions may occur, anticipating potential errors.
- except Block: Follows the try block and handles exceptions that occur within it, allowing for specific actions based on exception types.
- finally Block: Optional block that follows the try and except blocks, executing code always, typically used for cleanup tasks like releasing resources.
Python3
# Function to throw ZeroDivisionError
def divide(num, den):
try:
result = num / den
except ZeroDivisionError:
print("Error: Division by zero")
else:
print("Result of division:", result)
finally:
print("End of division operation")
try:
numerator = 5
denominator = 0
divide(numerator, denominator)
except ValueError:
print("Error: Invalid input, please enter integers")
OutputError: Division by zero
End of division operation
Exception Handling in C#:
- Try Block: Encloses code where exceptions may occur.
- Catch Block: Follows the try block and handles exceptions that occur within it.
- Finally Block: Optional block that follows the try-catch block, containing code always executed, typically used for cleanup tasks.
C#
using System;
public class GFG {
static void Divide(int num, int den)
{
try {
if (den == 0) {
throw new ArgumentException(
"Division by zero error");
}
Console.WriteLine("Result of division: "
+ (num / den));
}
catch (ArgumentException e) {
Console.WriteLine("Error: " + e.Message);
}
}
static void Main()
{
try {
int numerator = 5;
int denominator = 0;
Divide(numerator, denominator);
}
catch (FormatException) {
Console.WriteLine("Error: Invalid input, please enter integers.");
}
}
}
OutputError: Division by zero error
Exception Handling in JavaScript:
try
: This is where you put code that might cause an error. If an error happens, the program stops running this block and moves to the catch{}
block.catch
: This block contains code that runs only if an error happened in the try{}
block. If the try{}
block runs without any errors, the catch{}
block is skipped.finally
: This block contains code that will run no matter what - whether an error happened or not.throw
: This is used when you want to create your own errors.
JavaScript
function divide(num, den) {
try {
if (den === 0) {
throw new Error("Division by zero error");
}
console.log("Result of division:", num / den);
} catch (error) {
console.log("Error:", error.message);
} finally {
console.log("End of division operation");
}
}
try {
let numerator = 5;
let denominator = 0;
if (!isNaN(numerator) && !isNaN(denominator)) {
divide(numerator, denominator);
} else {
throw new Error("Invalid input, please enter integers.");
}
} catch (error) {
console.log("Error:", error.message);
}
OutputError: Division by zero error
End of division operation
Exception Handling Best Practices:
- Catch specific exceptions, provide clear error messages, and handle exceptions at the appropriate level
- Use finally blocks for resource cleanup, differentiate between checked and unchecked exceptions, document exception handling, and thoroughly test exception scenarios for robust code.
Conclusion:
In conclusion, exception handling is a crucial aspect of programming that ensures the smooth execution of a program despite the occurrence of errors. It allows for the management of errors in a way that doesn’t disrupt the normal flow of the program, thereby enhancing the robustness and reliability of the software. It’s an essential tool for developers to create error-resistant and efficient programs.
Similar Reads
Basics & Prerequisites
Data Structures
Getting Started with Array Data StructureArray is a collection of items of the same variable type that are stored at contiguous memory locations. It is one of the most popular and simple data structures used in programming. Basic terminologies of ArrayArray Index: In an array, elements are identified by their indexes. Array index starts fr
14 min read
String in Data StructureA string is a sequence of characters. The following facts make string an interesting data structure.Small set of elements. Unlike normal array, strings typically have smaller set of items. For example, lowercase English alphabet has only 26 characters. ASCII has only 256 characters.Strings are immut
2 min read
Hashing in Data StructureHashing is a technique used in data structures that efficiently stores and retrieves data in a way that allows for quick access. Hashing involves mapping data to a specific index in a hash table (an array of items) using a hash function. It enables fast retrieval of information based on its key. The
2 min read
Linked List Data StructureA linked list is a fundamental data structure in computer science. It mainly allows efficient insertion and deletion operations compared to arrays. Like arrays, it is also used to implement other data structures like stack, queue and deque. Hereâs the comparison of Linked List vs Arrays Linked List:
2 min read
Stack Data StructureA Stack is a linear data structure that follows a particular order in which the operations are performed. The order may be LIFO(Last In First Out) or FILO(First In Last Out). LIFO implies that the element that is inserted last, comes out first and FILO implies that the element that is inserted first
2 min read
Queue Data StructureA Queue Data Structure is a fundamental concept in computer science used for storing and managing data in a specific order. It follows the principle of "First in, First out" (FIFO), where the first element added to the queue is the first one to be removed. It is used as a buffer in computer systems
2 min read
Tree Data StructureTree Data Structure is a non-linear data structure in which a collection of elements known as nodes are connected to each other via edges such that there exists exactly one path between any two nodes. Types of TreeBinary Tree : Every node has at most two childrenTernary Tree : Every node has at most
4 min read
Graph Data StructureGraph Data Structure is a collection of nodes connected by edges. It's used to represent relationships between different entities. If you are looking for topic-wise list of problems on different topics like DFS, BFS, Topological Sort, Shortest Path, etc., please refer to Graph Algorithms. Basics of
3 min read
Trie Data StructureThe Trie data structure is a tree-like structure used for storing a dynamic set of strings. It allows for efficient retrieval and storage of keys, making it highly effective in handling large datasets. Trie supports operations such as insertion, search, deletion of keys, and prefix searches. In this
15+ min read
Algorithms
Searching AlgorithmsSearching algorithms are essential tools in computer science used to locate specific items within a collection of data. In this tutorial, we are mainly going to focus upon searching in an array. When we search an item in an array, there are two most common algorithms used based on the type of input
2 min read
Sorting AlgorithmsA Sorting Algorithm is used to rearrange a given array or list of elements in an order. For example, a given array [10, 20, 5, 2] becomes [2, 5, 10, 20] after sorting in increasing order and becomes [20, 10, 5, 2] after sorting in decreasing order. There exist different sorting algorithms for differ
3 min read
Introduction to RecursionThe process in which a function calls itself directly or indirectly is called recursion and the corresponding function is called a recursive function. A recursive algorithm takes one step toward solution and then recursively call itself to further move. The algorithm stops once we reach the solution
14 min read
Greedy AlgorithmsGreedy algorithms are a class of algorithms that make locally optimal choices at each step with the hope of finding a global optimum solution. At every step of the algorithm, we make a choice that looks the best at the moment. To make the choice, we sometimes sort the array so that we can always get
3 min read
Graph AlgorithmsGraph is a non-linear data structure like tree data structure. The limitation of tree is, it can only represent hierarchical data. For situations where nodes or vertices are randomly connected with each other other, we use Graph. Example situations where we use graph data structure are, a social net
3 min read
Dynamic Programming or DPDynamic Programming is an algorithmic technique with the following properties.It is mainly an optimization over plain recursion. Wherever we see a recursive solution that has repeated calls for the same inputs, we can optimize it using Dynamic Programming. The idea is to simply store the results of
3 min read
Bitwise AlgorithmsBitwise algorithms in Data Structures and Algorithms (DSA) involve manipulating individual bits of binary representations of numbers to perform operations efficiently. These algorithms utilize bitwise operators like AND, OR, XOR, NOT, Left Shift, and Right Shift.BasicsIntroduction to Bitwise Algorit
4 min read
Advanced
Segment TreeSegment Tree is a data structure that allows efficient querying and updating of intervals or segments of an array. It is particularly useful for problems involving range queries, such as finding the sum, minimum, maximum, or any other operation over a specific range of elements in an array. The tree
3 min read
Pattern SearchingPattern searching algorithms are essential tools in computer science and data processing. These algorithms are designed to efficiently find a particular pattern within a larger set of data. Patten SearchingImportant Pattern Searching Algorithms:Naive String Matching : A Simple Algorithm that works i
2 min read
GeometryGeometry is a branch of mathematics that studies the properties, measurements, and relationships of points, lines, angles, surfaces, and solids. From basic lines and angles to complex structures, it helps us understand the world around us.Geometry for Students and BeginnersThis section covers key br
2 min read
Interview Preparation
Practice Problem