Categories: python

Relational & Logical Operators in Python

In Python, operators are specialized symbols that perform different computations. To create an expression, we combine operators and operands. Expressions are merely values’ representations. The fundamental building blocks of a program that define its functionality are relation and logic.

Relational operator:

Value comparisons are done using relational operators, also known as comparison operators. It responds to the condition by returning either True or False.

OperatorDescriptionSyntax
>Greater than: True if the left operand is greater than the rightx > y
<Less than: True if the left operand is less than the rightx < y
==Equal to: True if both operands are equalx == y
!=Not equal to – True if operands are not equalx != y
>=Greater than or equal to True if the left operand is greater than or equal to the rightx >= y
<=Less than or equal to True if the left operand is less than or equal to the rightx <= y
Example:
a = 9
b = 5

print(a < b)
print(a > b)
print(a == b)
print(a != b)
print(a >= b)
print(a <= b)
Output:
False
True
False
True
True
False
Logical Operators:

To decide on an expression, logical operators are mainly used. The following logical operators are supported by Python.

OperatorDescriptionExample
andIf both expressions are true, then the condition will be true. If a and b are the two expressionsa → true, b → true
then a and b → true.
orIf one of the expressions is true, then the condition will be true. If a and b are the two expressions,a → true, b → false => a or b → true.
notIf an expression a is true, then not (a) will be false and vice versa.a → true=> not a → false.
Example:
a = 5

print(2 < 3) and (2 < 5)
print(2 < 3) or (2 < 5)
print(not a)
Output:
True
True
False

Note: also read about Python Tuple

Follow Me

Please follow me to read my latest post on programming and technology if you like my post.

https://www.instagram.com/coderz.py/

https://www.facebook.com/coderz.py

Recent Posts

Generate Parenthesis | Intuition + Code | Recursion Tree | Backtracking | Java

Problem Statement: Given n pairs of parentheses, write a function to generate all combinations of well-formed parentheses. Example…

2 months ago

Square Root of Integer

Given an integer A. Compute and return the square root of A. If A is…

1 year ago

Build Array From Permutation

Given a zero-based permutation nums (0-indexed), build an array ans of the same length where…

1 year ago

DSA: Heap

A heap is a specialized tree-based data structure that satisfies the heap property. It is…

1 year ago

DSA: Trie

What is a Trie in DSA? A trie, often known as a prefix tree, is…

1 year ago

Trees: Lowest Common Ancestor

What is the Lowest Common Ancestor? In a tree, the lowest common ancestor (LCA) of…

1 year ago