Anonymous
Anonymous
Learn how to build them from source first then see where that takes you
klimi
Engineer
Anyone looked at the original release of C++ C source code ?
Andrey
Death Killer
Anonymous
Does anyone know how to write c codes for uploading a file and image??
Asdew
Bhaskar
Bhaskar
Ask the hardware people🙈
At 15:30:08 UTC on Sunday, 4 December 292277026596, 64-bit versions of the Unix time stamp cease to work, as it will overflow the largest value that can be held in a signed 64-bit number. This is nearly 22 times the estimated current age of the universe, which is 1.37×1010 years (13.7 billion).
Bhaskar
If 64 bit counts till 64, then how is it possible?
Engineer
Two trillion
$2 trillion
$2,000,000,000,000
1 billion seconds = 11500 days
1 trillion seconds = 31000 years
In computers, the CPU (central processing unit) and other components such as RAM and the video card speed is measured in Hz or MHz (Megahertz) and now GHz (Gigahertz). One GHz equals 1,000,000,000 (one billion) Hz.
Engineer
A 64-bit register can hold any of 264 (over 18 quintillion or 1.8×1019) different values. The range of integer values that can be stored in 64 bits depends on the integer representation used. With the two most common representations, the range is 0 through 18,446,744,073,709,551,615 (264 − 1) for representation as an (unsigned) binary number, and −9,223,372,036,854,775,808 (−263) through 9,223,372,036,854,775,807 (263 − 1) for representation as two's complement. Hence, a processor with 64-bit memory addresses can directly access 264 bytes (=16 exabytes) of byte-addressable memory.
Bhaskar
You are contradicting yourself
Dima
lol
Engineer
No that is what I said
Engineer
🤓
Dima
*Madhu joins the chat*
Bhaskar
Engineer
The format got corrupted
https://en.m.wikipedia.org/wiki/64-bit_computing
Roxifλsz 🇱🇹
Engineer
Hopefully this format helps
With the two most common representations, the range is 0 through 18,446,744,073,709,551,615 (2^64 − 1) for representation as an (unsigned) binary number, and −9,223,372,036,854,775,808 (−2^63) through 9,223,372,036,854,775,807 (2^63 − 1) for representation as two's complement.
Asdew
You were saying it's 0 – 63.
Engineer
We are not talking decimal but binary bit representation 63 bits down to 0 is very common in Hardware Description Languages as they represent the actual registers on silicon.
Asdew
????
Engineer
Engineer
Computers generally count from 0 to some value.
In hardware
For example 0 to 31 for 32 bits, 0 to 63 for 64 bits, 0 to 7 for 8 bits and 0 to 15 for 16 bits.
Engineer
I did say bits not decimal
Asdew
Roxifλsz 🇱🇹
Asdew
With 32 bits, you have 4 bytes, so 0 – 2^32-1.
Engineer
You see you even had to write 32-1🤓
Engineer
😂
Asdew
That's (2^32)-1, not 2^(32-1).
Dima
Dima
not sure if troll or serious
Engineer
You see computer need to have a concept of zero
Engineer
That is why a loop which tests for zero is much faster
Asdew
...
Asdew
Thus you are limited.
Engineer
https://m.youtube.com/watch?v=rX0ItVEVjHc
Engineer
Engineer
Asdew
You're either an idiot or a troll.
Bhaskar
https://en.m.wikipedia.org/wiki/Unix_time
Arminio
Anonymous
Thanks Rose
Dima
Asdew
An idiot troll? That's impossible.
Dima
Arminio
hehe
Harsh
Dima
Engineer
Harsh
In a loop
Asdew
Shut up, Engineer.
Engineer
I was there
Dima
Engineer
Are you trolling me now?😳
V01D
Harsh
Engineer
Fantastic!
Engineer
I have followers now
Engineer
An amazing Sunday morning
Dima
Bhaskar
I asked him, if 64bits counts till 63, then how's this possible? I didn't asked anyone to teach me about Epooch