Here, we have to find all possible integers between 250 which was divisible by 2,5 and 7.
Solving this problem by 2 methods:
1. Venn diagram
2. Mathematical substitution.
In this problem, we are using Mathematical substitution method.
Step-1: According to condition, we can perform least common multiple(LCM) of 2,5 and 7=70
Step-2: Total number of integers= ⌊250/70⌋
= 3
Note: Divisible numbers are 70,140 and 210.

→ An undirected graph possesses an eulerian circuit if and only if it is connected and its vertices all of even degree.
→ Eulerian circuit (or) Euler tour in an undirected graph is a cycle that uses each edge exactly once.

A partially ordered set is said to be a lattice if every two elements in the set have
1. Unique least upper bound
2. Unique greatest lower bound

(m) Data = 0011
No. of parity bits needed is decided using
2^p≥ m+p+1
p=3
Bit pattern:

P₁(check even parity at 1, 3, 5, 7 bit) = 0
P₂(check even parity at 2, 3, 6, 7 bit) = 1
P₄(check even parity at 4, 5, 6, 7 bit) = 1
So encoded data = 0011110

int z = 7.0; → Incorrect. Given data type is integer but given floating point number. It is wrong declaration.
double void = 0.000; → Incorrect. void is a keyword but can’t use with variable declaration.
It always return null value.
short array [2] = {0, 1, 2}; → Correct. It is right format. We can declare static values here itself.
char c = “\n”; → Incorrect. It is character data type but given in double quotes. It should be single quote instead of double quote.

(13 / 4 * 3) % 5 + 1
Step-1: (13 / 4 * 3) % 5 + 1
Step-2: (3.25*3)%5+1
Step-3: 9.75%5+1
Step-4: 4.75+1
Step-5: 5.75
Note: ( ) having highest precedence then *,/ and % have same precedence order.