OOPs - Java Programming | Ep-15 | Final, Super & this Keyword | Tamil | code io

Final, Super & this Keyword in Java OOPs
Follow us on
Instagram
code io - / code.i.o
Goms - / goms.io
Siva - / siva.io
Linkedin
Code IO - / code-io-tamil-67682b20b
Goms - / gomathinayagam-avudaik...
Siva - / sivasubramanian-a-4435...

[@Mohamed-bk9np]

Bro Collections kum video pottinga na romba useful ah irrukum

[@codeio]

Sure 👍

[@gokulgoku2557]

nice explaination bro♥ small suggestion bro i'm trying to place in siemens technology bro how to place on that company bro

[@Guru-mx4ez]

TQ so much bro

[@PriyaPriya-kl3jt]

Bro I want more daimention about this keyword so please upload the separate vedio for this keyword of another points.

[@sugu3388]

Post a video on looping

[@leavers8865]

bro neenga use panrathu ena IDE

[@codeio]

IntelliJ by JetBrains bro

[@informer9261]

Bro dsa video podunga bro, tamil la.

[@user-jr3ff3zj4m]

🦋🦋🦋🦋🦋🦋🦋🦋🦋🦋🦋🦋✨

[@simassaboordeen3768]

compiler name plssss

[@jebishkumarjb3944]

Bro java intelij enaikku laptop support aachala solution sollugga

[@hackhack1966]

Vs code yethu bro

[@vinothe9675]

Python language code a= 0.3 b= 0.1+0.2 if a== b: print("a and b is equal") else: print ("a and b are not equal") Answer :: a and b are not equal Let's be explained this one bro

[@vgodwin877]

The code assigns a variable a with the value 0.3, and another variable b with the sum of 0.1 and 0.2. Then it compares a and b using the == operator, which checks if they are exactly equal. If they are, it prints “a and b is equal”, otherwise it prints “a and b are not equal”. You might expect that a and b would be equal, since mathematically 0.3 is the same as 0.1 + 0.2. However, due to the limitations of floating-point precision, there might be a slight difference in their values when stored in memory. This is because most decimal fractions cannot be represented exactly as binary fractions, which is how computers store numbers. For example, the decimal fraction 0.1 has the binary fraction 0.0001100110011001100110011001100110011001100110011..., which is infinitely repeating. Therefore, the computer has to truncate or round this fraction to fit in a fixed number of bits, which introduces some error.