Want to understand bitwise operators? This video dives into OR, AND, NOT, XOR, and NOR with easy-to-follow examples. Learn how to use these operators for flags, masks, and more in programming. Perfect for beginners or anyone wanting to master binary logic in C or other languages. I break it down with real examples, a touch of humor, and no fluff. Subscribe for more coding tutorials, and check out my site for extra resources. Drop a comment with your questions or video ideas!

Introduction to Logical Operators 00:00:00
Explanation of Bitwise OR 00:00:35
OR Operation Examples 00:01:01
Bitwise OR with Multiple Bits 00:02:12
Using OR for Flags 00:03:52
Introduction to Logical AND 00:08:06
AND Operation Examples 00:08:29
Using AND as a Mask 00:10:00
Checking Specific Bits with AND 00:11:17
Introduction to NOT Operation 00:13:36
Introduction to NOR Operation 00:14:38
Introduction to XOR Operation 00:16:37
XOR and Neural Networks 00:16:53
Conclusion and Call to Action 00:18:38

Thanks for watching!

Find us on other social media here:

• https://www.NeuralLantern.com/social

Please help support us!

• Subscribing + Sharing on Social Media
• Leaving a comment or suggestion
• Subscribing to our Blog
• Watching the main “pinned” video of this channel for offers and extras

Hey everybody! In this video I’m going to talk about basic logical operators such as OR and AND.

Uh so let’s let’s dive right into it. What am I talking about with the OR and AND?

Suppose for the sake of argument that this notepad is totally dark and I wanted it to be really light

and then I have to go into the system settings to fix it. Sorry let me change my theme.

How about that?

Okay.

So suppose for the sake of argument, we’ve got, you know, a couple of bits.

These are going to be a bitwise operations for the most part.

In other languages, sometimes we will say logical operator, but actually we’re just

talking about values rather than bits individually.

So these are bitwise operators.

Imagine we have like a couple of bits.

Remember the possible values for bits are just, you know, a zero and a one binary.

So suppose we have a couple of values.

values, let’s say we have a zero here and a one.

So if I apply a logical or to the zero and the one,

the result is going to be a one because either the first bit or the second bit are a one.

You could also expand these operators to have multiple sets of bits,

but we’re just going to do, you know, one set against another set.

In this case, each set is just one bit long, but we’ll do, we’ll do a more complicated stuff in a minute.

If I have a zero and a one, then the answer there is, well, let me just put or maybe.

The answer is a one.

I’ll put or maybe at the top, just like or to let you know that we’re doing ors here

on the top.

So if we have a zero and a one, the answer is going to be a one.

If we have a one and a zero, the answer is going to be a one.

Also, if we have two ones, which looks like an L over there, I got to work on my penmanship.

Then the answer is also going to be a one.

if either of the bits in question are a one then the answer should be a one. The only case with an

OR that results in a zero is if both of the bits are zero because neither the first or the second

are actually a one right so this is the basic idea of using an OR operator and you can also do this

with multiple bits at the same time like for example we could say let’s take a bunch of random

work on the it’s the pressure dude the l’s are driving me crazy okay oh my god okay so i do that

and i let go okay i’m just going to put some random bits uh underneath the the first set of

random bits put like a zero here and then like a one here maybe and we’ll say that we’re going to

do a logical or just like you might think of doing a you know addition or subtraction we’ll just say

you know, addition or subtraction. We’ll just say we’re going to or these two sets of bits.

Actually, these are six on the top and six on the bottom. If I add two more, then it’ll be a nice

little bite for the top and the bottom. So I’m just going to do that, you know, to have eight

bits on the top and eight bits on the bottom. Okay. So if I just want to logically or two sets

of bits, literally, I just have to do one pair of bits at a time. So a one or zero is just a one.

One or zero is just a one, a zero or one is a one, a one or zero is a one, a zero or one

is a one.

And then these ones, everything is just a one.

Okay.

So that was too easy.

Maybe if I, I don’t know, maybe if I change one of these ones to a zero, then we would

actually be able to have a zero somewhere in here.

So that’s a logical or a bitwise or operator or operation.

So you can, you can kind of use this in various ways.

can kind of use this in various ways i mean obviously if you want to manipulate some bits

this can be pretty useful inside of the machine but there was kind of an old school way that

people did flags with arguments they would basically say something like this they would go

in their computer program they would say you know flag a name it something like turn on the display

or enable caching or just like whatever right so we’ll just have a flag we’ll call it flag a

that value is equal to a one and then maybe flag b its value is equal to a two and then flag c

its value would be a four and then we basically just double the value of the flag and the reason

for that c d e f i’ll just stop with f maybe oh wait that was supposed to be 16 and that’s 32.

the reason for that is if you double the value of each flag so that uh

and then you can do a bitwise or against all of these flags and sort of combine multiple flags.

Because if you think about it, if we’re talking about binary,

if we suppose this is just a regular eight bit number, then, you know, the first bit has a

strength of one. If you’ve seen my other videos for converting between binary and hex,

the second bit has a strength of two. The next bit has a strength of four and then eight and

and then 32 and 64 and then 128.

And so if you look at the flags,

1, 2, 4, 8, 16, 32,

they map to only one bit.

It’s not going to be some kind of random pattern for these numbers.

It’s literally going to be flag A is going to look like this.

1, 2, 3, 4, 5, 6, 7, 8.

And then flag B is going to look like this.

1, 2, 3, 4, 5, 6, 7, 8.

five, six, seven, eight. And flag D is going to look like this. Whoops. Let me make that green.

Still getting used to this. Oh, sorry. C is the next one. One, two, three, four, five,

six, seven, eight. Can you see the pattern here? Let me just do D and be done with it at this

point. One, two, three, four, five, six, seven, eight. So because we’re increasing the value of

the flags by a power of two, or by a power of two, they’ll always correspond to just one bit.

they’ll always correspond to just one bit, which means if you apply a logical or operation,

you can represent a bunch of different flags with just one number.

Think about this.

What if I wanted to have, oh, I don’t know.

Let me erase this.

What if I wanted to have some, let’s say I wanted flag A and flag D and flag F just for

the sake of argument.

Dang, this pen.

It’s actually my fault completely, but I need to practice.

but I need to practice F okay and DNF so that would basically be you know 1 2 3 4 5 6 7 8

and then D would be the 8 so a 1 0 0 0 there and then a bunch of zeros elsewhere and then the F

So if we did an OR between all of those, then the OR is just basically 00101001.

And if you convert that from binary to decimal, what is that?

That’s a 1248 plus 8 plus 1248 and then a 32.

So 41.

just write down the number 41 and if the programmer is smart enough to you know parse all the bits

and everything then they’ll know that you have flags a and d and f set that’s not necessarily

something that all the modern programs do anymore it was much more popular in the olden days but i

think some people still kind of do it especially if they’re programming in c and other languages

where they want speed it’s pretty fast to look at bits inside of the machine so keep that in mind

Keep that in mind now we know how to do an OR operation and we know one reason that it might be useful and

Yeah, okay. I’m gonna move on to the next operation

So clearing the screen now

Hello little doggy he barked and now he’s in the room

Let’s do

The logical AND operation okay, so suppose we have two bits here

in a one only if both of the input bits are a one i’m gonna whoops i accidentally cleared the whole

entire thing let me forget where my red pen is okay and okay so if we have a zero and a zero

the result is zero because neither of those are a one if we have a zero and a one the result is

still going to be zero because we need both bits to be a one to result in a one so then that means

would also result in a zero. So you get a bunch of zeros until finally you have an input pattern

that is just two ones. And then finally the result is one. So that’s a logical and.

Let me do a quick example so we can and a bunch of bits together. I’m just going to do more

random bit patterns. So there’s another L there. I’m cringing. I’m self-cringing. One, two, three,

okay so then i’ll do like another one there and like a zero there and a zero maybe a couple of

ones maybe three ones and then a zero and then one i guess and we’ll just say that we’re going

to end those together so and oh man i’m mixing uppercase and lowercase like crazy

so uh to end them together you know that bit position right here that’s going to be a one

and then we have a zero because they don’t match they’re not both one and then we have another zero

a one and then we have a zero and a zero and a zero and a one so this is a logical and you can

use logical ands for a wide variety of things but one thing you can kind of do somewhat easily is to

use one number as a mask against another number for example notice how uh suppose this was the

input number let’s just say we have the input number up top and maybe you wanted to make sure

because you’re you’re checking for those bits individually or maybe you want to just prevent

the input from having certain bits on for some other reason well you can you can apply the mask

as the second bit and use a logical and i’ll say mask here sorry you can apply a mask as the second

bit pattern and notice how in the answer there are only ones where both you know the input and

means if I wanted to just control only which ones are allowed I can use the mask notice how the mask

has ones in these positions and there are definitely no zeros sorry there are definitely

no ones in any position where a mask had a zero so the mask can kind of like you know mute or mask

or control the input pattern if that makes sense hopefully another thing we could do if we wanted

if one bit exists. Let me go ahead and clear this real fast. I’m going to just do maybe four

bits this time. So we could obviously do an and against four zeros, and this would result in just,

you know, a resulting pattern of zero. So this is not super useful. The result would just

definitely be four zeros. But notice again how the second pattern is sort of controlling what’s

allowed to go through from the first pattern. Suppose I wanted to check to see if that particular

particular bit was on or off.

All I have to do is mask it with a one in the correct pattern.

So, you know, the second bit that I just wrote down on the bottom row,

I just want to see if that second bit is on or off in the input pattern.

I don’t care about any of the other bits.

That means the result will be this.

So now it’s much more easy for me to see if that bit is on.

I could just compare the value of those bits to a regular integer.

Like, for example, if we consider that this was the one and this was the two

considered that this was the one and this was the two and this was the four or sorry four and then

the eight I could just ask now if the final value equals two and then I would know if that bit was

on or not in the original pattern and so if I wanted to check to see if this other you know

bit was on I can move this over here and set that back to a zero so the resulting pattern would be

zeros then I’d ask myself is the resulting value equal to four no it’s equal to zero and so then

Another thing you can do that I’m going to talk about in a future video is just sort of shift the bits over.

You could, instead of checking to see if the value was a 4 or like a direct integer,

you could just sort of shift over a certain number of spots and then check to see if it was equal to 1 or 0.

Let me put this 1 back over into its original position just so that we’ll have something that had a 1.

is one from uh you know the right side if it’s one to the left from the right side

then i could just shift all the bits one to the right and end up with a pattern that is zero zero

zero one i’m not going to talk about bit shifting operations in this video but just know that you can

and you’ll see more of it in a future video so then you know this is another way to check to

see if a bit was on first you do a mask for that bit and then you shift bits and then you just

check to see if the final value is a zero or one which may or may not feel easier than checking for

or may not feel easier than checking for an actual integer in your program.

Okay, so we’ve done OR and also AND. The next bit pattern is called a NOT, which is really easy.

It’s literally just an inversion of the original bit pattern. So for the NOT, we don’t really take

two bits against each other. We just take an input bit and we just invert it. We’ll just say

So that’s a knot. Pretty easy. We could also knot, you know, a random bit pattern with Ls.

So I swear, somebody’s going to show up and this is their first computer science video.

They’re going to go tell their parents, hey, there’s Ls in computer science.

So sorry. I’m so sorry. Okay. So I got four there. So if I knot those, then that’s pretty easy.

It’s just going to be the opposite, you know, an inversion.

you know, an inversion.

One, zero, one, zero.

Let me just double check that I did that correctly.

Yeah, so that’s the knot pattern.

No big deal.

Pretty easy.

So then maybe the next thing that we can talk about is the nor,

which just means not or.

So let me draw that out real fast just to show you what I’m talking about.

So if we do nor, pretty much you can imagine first taking the or and then knotting it.

So inverting the or.

the OR. So for example, if we have two bits here, actually, let me, let me do, let me do a

sequential counter. Cause I think that’s more fun. I’m counting right now from one to a three

or a actually, I do that in the last one. I started with zero. I hope let’s count from zero

to three. So zero and then one and then two and then three. So I’m counting in binary.

two input bits and we’re going to do a nor then the first thing we probably want to do is take

the or operator so that would be a zero here i’ll just put or in parentheses just to let you know

that this is kind of a nice first step you could memorize nor if you wanted to but i don’t i don’t

really remember how to do it without doing these steps so uh it’s going to be ones for everything

else because in the or you get a one if either of those is a one and then uh the next step is you

the or i’ll just put nor here just to let you well just to let you know that you’re uh well i

don’t know if i put nor then it kind of sounds like i’m norring that one bit doesn’t it so maybe

here i’ll say uh not just to let you know that this is just one step against the previous bit

so the knot is uh just going to be an inversion and so the nor of zero zero is one the nor of zero

nor of 1 1 is 0 and that’s how you do a nor and all of these logical or bitwise

operators can be used in circuits and circuit design and just you know other

types of logical operations I’m gonna move on let’s see the next one is gonna

be XOR that I wanted to talk about in this video so what is XOR it just means

exclusive or so it’s a little bit more complicated than or this is actually a

one because it has a history with neural networks. When you have a neural network that does not have

more than one, or sorry, if you have a neural network that does not have any hidden layers,

like if you just have an input layer and an output layer, then the neural network should

actually not be able to solve XOR. It should not be able to learn it. You have to increase the

topology of the neural network in some way, make it a little bit more complicated. For example,

one or more middle layers between the input and the output layers. If you understand neural

networks, it’s just kind of fun to know, oh, XOR stumps a shallow network and kind of starts to

prove that deep networks might be a little bit smarter or deepish at least. Okay. So XOR,

let’s start off by counting here. I’m going to do zero and zero, and then this is the number one,

and this is the number two, and this is the number three. And exclusive OR just basically means

just basically means an or but if both of the bits are one then it’s a zero so that means

either of the bits can be a one to produce a one but it must be exclusive the bit that is a one

can’t also be next to another bit that’s a one so let me show you so in is in a double zero

the answer is just going to be a zero in a zero and one the answer is going to be a one in a one

exclusive, the one is it has a, it has a buddy or a partner.

It’s not an exclusive one.

So we’ll say that that’s a zero.

So that’s the XOR.

I don’t know.

You could put like a, a, a not on top of that or an and on top of that or whatever

you wanted to do.

And we can make stuff that’s a lot more complicated, but these are the basics of

or and not XOR and NOR as bitwise operators.

So thank you for watching this video.

That’s all I have to say for now.

See you in the next one.

Hope you learned a little bit and had a little bit of fun.

I’m out.

social media website that you’re looking at right now it would really mean the world to me and it’ll

help make more videos and grow this community so we’ll be able to do more videos longer videos

better videos or just i’ll be able to keep making videos in general so please do do me a kindness

and uh and subscribe you know sometimes i’m sleeping in the middle of the night and i just

wake up because i know somebody subscribed or followed it just wakes me up and i get filled

with joy that’s exactly what happens every single time so you could do it as a nice favor to me or

it as a nice favor to me or you could you could troll me if you want to just wake me up in the

middle of the night just subscribe and then i’ll i’ll just wake up i promise that’s what will

happen also uh if you look at the middle of the screen right now you should see a qr code which

you can scan in order to go to the website which i think is also named somewhere at the bottom of

this video and it’ll take you to my main website where you can just kind of like see all the videos

i published and the services and tutorials and things that i offer and all that good stuff and

if you have a suggestion for uh uh clarifications or errata or just future videos that you want to

see please leave a comment or if you just want to say hey what’s up what’s going on you know

just send me a comment whatever i also wake up for those in the middle of the night i get i wake up

in a cold sweat and i’m like it would really it really mean the world to me i would really

appreciate it so again thank you so much for watching this video and um enjoy the cool music

the cool music as I fade into the darkness which is coming for us all.

Thank you.

The post Master Bitwise Operators: OR, AND, NOT, XOR, NOR for Beginners appeared first on NeuralLantern.com.

Hey coders, ever wonder why your program’s acting funky? Join me to master debugging with xxd! This vid walks you through inspecting text or binary file output at the byte level, catching sneaky characters like null bytes that mess up automation or school assignments. From assembly to redirects, learn practical tips to ensure clean output. Perfect for beginners and pros alike! Hit subscribe for more coding tutorials, and check my site for extra goodies. Let’s debug smarter, not harder!

Introduction to xxd 00:00:00
Purpose of debugging 00:00:12
Why debug output 00:00:23
Example assembly program 00:00:56
Running the program 00:01:26
Corrupting the message 00:01:45
Terminal vs automation 00:02:27
Installing xxd 00:03:16
Redirecting output 00:03:29
Using xxd to debug 00:04:33
Identifying newline issue 00:05:36
Finding zero in string 00:06:04
Debugging conclusion 00:06:32
Weird symbols warning 00:06:47
Debugging standard error 00:07:23
Closing remarks 00:07:40
Call to subscribe 00:07:56
QR code and website 00:08:45
Request for comments 00:09:09
Fade out 00:09:31

Thanks for watching!

Find us on other social media here:

• https://www.NeuralLantern.com/social

Please help support us!

• Subscribing + Sharing on Social Media
• Leaving a comment or suggestion
• Subscribing to our Blog
• Watching the main “pinned” video of this channel for offers and extras

Hey there, I’d like to talk to you about debugging your program’s output with xxd.

What am I talking about? Well, there’s a program called xxd that can sort of inspect

at the byte level the output of some text file or binary file. It’s really useful for

inspecting things. Why would you want to debug the output of your program? Well, I don’t know.

print a message from your program the program might be printing some extra characters somewhere

or some garbage and maybe maybe you don’t notice because you’re sort of looking at your program’s

output in the terminal but then maybe if your output is being sent to another program

for the purposes of automation or like you’re getting a grade from a class or something like

that then um well it can it can sort of it can sort of get you without you realizing what’s wrong

you an example real fast of what i’m talking about i have a simple assembly program here this is not

a video about how to write assembly code so just assume that you know if you want to know assembly

see my other videos but um i’m just going to print a simple message i’m just going to print

hello i feel awesome and then the length of the message i’m specifying here you don’t know you

don’t need to know too much about this for this particular video i’m just printing a string in

assembly that’s all i’m doing and then here you can see i’m just kind of like printing it and then

I’m just kind of like printing it and then I’m like exiting.

So if we go back to the terminal here, I can type make run.

This is not a make file video.

See my other videos.

I want to type make run just to compile and run the program.

And then here’s the message that it prints, right?

Hello, I feel awesome.

It looks good in the terminal.

I can’t be 100% sure though, because think about this.

What if I corrupted the message on purpose?

This can happen in assembly all the time.

Wrong or if you add extra characters at the end of it or even if you have you know a corrupted register somewhere

That either reads from the wrong spot

To get a string or maybe it it writes over the string for some reason. There’s a lot of things that can go wrong

So for now just suppose that I’ve corrupted my message somehow by I don’t know. Let’s put a zero

In between the string so I’m gonna say is that it’s gonna be like H E L

0 L O and what that should do is

lo and what that should do uh well it should look like just the word hello but if i’m automating

this program or sending it in to get a grade at a school somewhere then this should you know not

match what is expected if i’m automating with like another system in some way but it should look okay

in the terminal let’s see i’m going to do clear and make run notice how the message looks the same

I feel awesome. So if I was automating, you know, if I was sending this string to another program

for automation, I might be convinced that I’m not doing anything wrong. And I’ll, I’ll think it’s

the other side that is wrong or, or our computers are just buggy or something like that. But actually

I’ve outputted a corrupted message for some reason. So how can I really be sure that my

message is what I think I’m seeing in the terminal? That’s the XXD program. Pretty easy.

apt install xxd let me see if I have it on this system oh it’s already installed

okay good so I’m gonna do clear and make run again so there it is I would like to

just redirect the standard output pipe to a file with a special command in the

shell let me just show you real fast I am definitely printing to std out the

standard pipe which is just a number one file descriptor if you don’t understand

If you don’t understand that, I have other videos, but I’m going to run the program again,

but then I’m going to redirect the output to a file and I’m going to call it stdout.txt.

It’s probably a good idea to eliminate spaces.

I think I’ve made mistakes in other videos where I didn’t put a space before or after

this little redirector symbol and I ended up creating a file just called the number

two or the number one.

But pipe number one is standard output.

So I’m going to say anything that comes to pipe one, which is standard output, I’m just

output I’m just going to redirect it to a text file. So when I hit enter notice

how nothing prints to the screen but the standard output text file that I

specified is now created. If I spill the contents of std out it still looks

normal so don’t let that trick you but watch what happens if I use xxd.

xxd std out basically xxd is going to read it as a binary file and tell me

every single character in there while I oh I forgot to change the title of that

that’s not this video but notice right here where it says H E L L O and then

right before that there’s like a little dot if you look at the dot let’s see

what is the dot it’s one two three four five six it’s the sixth thing one two

one two three four five six seven eight nine ten twelve thirteen fourteen fifteen oh there’s

fifteen characters but there’s not that many i think probably they’re packing them by two here

let me see if that makes more sense now one two three four five six one two three four five six

yeah that makes a lot more sense so the sixth uh byte not the sixth uh word uh is basically

to this dot right here and if you recall oa is a decimal 10 which is uh the beginning of a new line

you know like a carriage return line feed um 13 comma 10 so that’s what it is right there

and then so now we know that there’s xxd is figuring out here or helping us understand

that there’s a new line between slash main and then the message which if you recall that’s

exactly what happened and then when we look into our hello string there’s a dot in the middle here

string there’s a dot in the middle here what is that dot well we just have to figure out what

number that corresponds to so the oa was that dot right there so we just got to go a couple more

bytes forward one two three four bytes forward one two three four bytes forward it’s this zero right

so xxd even though the terminal didn’t help us originally xxd has helped us realize that we’re

that we’re actually printing a zero under the hood and we can’t see it in the terminal.

So we have now debugged our output. You know, depending on where you print this,

you might see nothing like in the terminal. It didn’t really show anything. But if you’re on a

webpage somewhere or some other type of thing that’s going to print the data for you, you might

see a weird symbol. I mean, it really depends. This is not something you’ll see everywhere, but

you might see a weird symbol that kind of looks like a black diamond with a question mark inside

mark inside of it or some other weird symbol.

If you start seeing weird symbols all over the place or just in a place where you know

there’s not supposed to be a weird symbol, that might be an indication to you that you

have weird values sitting inside of your string.

And then you should probably try to debug with XXD.

So that’s it.

That’s the basics for debugging with XXD.

Just, you know, file output anyway, for your information.

If you wanted to debug the standard error pipe, you could also do this.

you know because the error pipe is just a two um and that’s basically it i’m not going to

debug right now because that’s that’s too easy but i hope you enjoyed this video thank you for

watching i hope you learned a little bit and had a little bit of fun i’ll see you in the next video

hey everybody thanks for watching this video again from the bottom of my heart i really

appreciate it i do hope you did learn something and have some fun uh if you could do me a please

If you could do me a please, a small little favor, could you please subscribe and follow this channel or these videos or whatever it is you do on the current social media website that you’re looking at right now.

It would really mean the world to me and it’ll help make more videos and grow this community.

So we’ll be able to do more videos, longer videos, better videos, or just I’ll be able to keep making videos in general.

So please do me a kindness and subscribe.

the middle of the night and i just wake up because i know somebody subscribed or followed

it just wakes me up and i get filled with joy that’s exactly what happens every single time

so you could do it as a nice favor to me or you could you could troll me if you want to just wake

me up in the middle of the night just subscribe and then i’ll i’ll just wake up i promise that’s

what will happen also uh if you look at the middle of the screen right now you should see a qr code

which you can scan in order to go to the website which i think is also named somewhere at the

you to my main website where you can just kind of like see all the videos I published and the

services and tutorials and things that I offer and all that good stuff and uh if you have a

suggestion for uh uh clarifications or errata or just future videos that you want to see please

leave a comment or if you just want to say hey what’s up what’s going on you know just send me

a comment whatever I also wake up for those in the middle of the night I get I wake up in a cold

it would really mean the world to me. I would really appreciate it. So again,

thank you so much for watching this video and enjoy the cool music as I fade

into the darkness, which is coming for us all.

Thank you.

The post Master Debugging with xxd: Inspect Program Output at a Byte Level for Automation & Clean Code! appeared first on NeuralLantern.com.

Hey coders! Ever hit a wall with a program that just won’t work? In this video, I’m spilling the beans on caveman debugging—a super simple, no-fuss way to hunt down bugs in your C++ code (or any language, from assembly to Python)! No need to wrestle with complex debuggers; this method is all about using print statements to trace what your code is doing, step by step.

I’ll show you a real C++ program where things go wrong (think integer overflows and mystery crashes) and walk you through how to sprinkle in cout statements to spot the problem fast. You’ll learn how to label decision points like loops and if-statements, break down complex expressions with temporary variables, and format your debug output so it’s easy to read. Plus, I share a neat trick called short circuiting to toggle your debug prints on or off without deleting them—saving you tons of time!

Whether you’re a beginner just starting out or a pro debugging a massive codebase, caveman debugging is a lifesaver. It’s quick, it’s intuitive, and it fits my “let’s figure this out” vibe perfectly. Stick around to see how I catch a sneaky bug in a for-loop and fix it in minutes.

Why watch?

• Learn a beginner-friendly debugging technique that works in any language.
• See real code examples with clear, relatable explanations.
• Get tips to make your debug output readable and avoid hours of frustration.
• Discover how to short circuit print statements for reusable debugging.

If you’re ready to level up your coding game and squash bugs like a champ, smash that play button! Don’t forget to subscribe and hit the bell for more coding tutorials, from beginner hacks to advanced tricks. Drop a comment if you’ve ever used caveman debugging or have a bug you need help with—I read every one! Check out my next video on using a proper debugger for even more debugging goodness.

Scan the QR code on-screen or visit my website (linked below) for more tutorials, services, and coding resources. Let’s keep the coding community growing—your support means the world! #CavemanDebugging #CodingTips #DebuggingHacks

Hey everybody! In this video I’m gonna try to familiarize you with a concept

called caveman debugging. It’s just as bad as it sounds but it’s really really

really useful. So suppose for the sake of argument you’re writing a program I’m

gonna show a C++ program here but this this concept is not just for C++

debugging it’s also for assembly and any other kind of language that you can come

other kind of language that you can come up with but suppose I have a program and I’m trying to

figure out why it’s not working so if you look at this program right here that I’ve kind of written

up already we have a main function here and we have like a little hello message that’s not my

name I love that name though and we have a variable a and then we just sort of do some nonsense to it

to try and compute a value for a when I say nonsense I mean literally I’m just I just made

I’m just I just made up instructions the point of this video is not to show you some advanced program

It’s just to show you that you know

This is how you can possibly debug a program that has gone awry

So you can imagine at home that this code you’re seeing right here might be your larger project your larger

Code base whatever it is that you’re doing that is not working for some reason and you’re not sure why

So, um, let me run the program real fast

It basically is just like a little for loop and then it just sort of

of you know not randomly but it just kind of increases the value of a for no reason

a bunch of times and then it calls a function that will crash later

so let me show you what happens when we try to run this program okay do do do

okay i want to go clear and make run if you don’t know how to do a make file or compile

or link or anything like that uh then go see my other videos so clear and make run

What did I do wrong?

TempResult was not declared in this scope.

Okay, well, this is now a video on reading compiler errors.

Line 59, I probably left something out.

Oh, because I just changed it.

I forgot to put it back in there.

Return tempResult, we should just return input times two.

And I’m just making this up.

It’s not really like a valid algorithm.

Okay, so we run our program.

We print the final result and we realize for some reason the final result is wrong.

result is wrong. So I don’t, I mean, I just made this up. So I don’t really know what the right

answer is. But just imagine that you are looking at some sort of an output, some sort of a final

state, maybe a crash. And you realize, oh, my program doesn’t work, but it’s too complicated

to figure out. Caveman debugging to the rescue. Caveman debugging kind of is as bad as it sounds.

It’s just really, really simple. But it’s also really useful, especially if you just want to do

on you don’t want to dive deep into a full-on debugger or do something more advanced it literally

is just printing a lot of things while your program is running i do it all the time i usually

don’t even go to a debugger unless i really get in trouble with like some huge mess um okay so

the first thing i’m going to say is in this for loop we uh you know we’re kind of like iterating

And so probably this is a good idea to announce that we’re iterating in the for loop.

So I’m just going to go Cout.

In C++, you know, we have the Cout object that we can use to stream texts to standard output,

which usually goes to the terminal.

So use whatever construct you’re using for your particular language.

So we’re going to do Cout.

And I should say also, if you’re programming in assembly,

if you are programming in assembly,

it’s a little bit more complicated than just writing a Cout.

little bit more complicated than just writing a C out you probably have to have some pre-computed

messages and then you can use a library to print a number to the screen or use printf to print stuff

to the screen but you can do it just takes a little bit longer so anyway conceptually I’m

just going to say this is the first iteration of my loop so I’m going to sort of announce it I’m

going to say main and then I’m going to call it main four or how about primary four or first four

but I want to try to label the for loop.

And maybe instead of leaving those parentheses blank,

I could say iteration number i right there,

or maybe I could do iteration i.

That would be pretty good.

Then I just have to replace the i with the actual variable i

so that the i keeps increasing.

So I’m just going to like do another stream operator here

and I’m going to say i.

Then I’ll print a new line.

we’ve got, you know, one iteration of our loop.

Maybe I should also print what is the current value of A

because the point of this, you know, weird nonsense code

is we’re coming up with a value for A, right?

So I should just print what A is at the top of each iteration of the for loop.

So I’m going to say A is equal to, and then do another A at the end of it.

And then maybe at the bottom of the for loop,

when the for loop is actually ending one of its iterations,

I can just say we’re at the bottom of the iteration so maybe I’ll put to end

iteration and then print the final value of a and then at the top I’ll say begin

iteration at this point you might start to feel like hey aren’t you using too

many words here like why can’t I just print a bunch of numbers I mean you

could but when you’re coding you need all the brainpower you can get to not

just code but to debug coding is already hard enough without making it harder

harder for yourself than you need it to be. So, you know, I see people all the time, they’re

trying to debug their code and they just like start printing numbers. And after not very long

at all, they’re looking at the debug output and they’re just like, what did that number mean?

Where is the number I’m looking for? It’s just a bunch of numbers. It’s harder to debug when you

do it that way. Do it the nice and pretty way. It just costs you a couple of extra keystrokes to do,

you know, nice letters and new lines and things, nice words, labels. Isn’t that still a lot better

Isn’t that still a lot better than debugging for an extra six hours?

Because you can’t really understand what you’re seeing.

Anyway, let me show you what this looks like so far with just those two lines added.

Now we can kind of see, alright, alright, on iteration number 61, where I was 61, then

this was the first value of A and then after that this was the second value of A, you know,

when we were finished with the iteration.

It seems to have gone up by a certain amount.

you know it was like a negative blah blah blah 836 and then negative blah blah blah 708 so it

kind of increased in value all right that’s a little bit helpful now it’s a really good uh

place to uh print our decision points so anytime in your code where you have an if or an else or

a function call or anything where you are kind of like you know making a decision or processing your

data in some way it’s probably a good idea to announce your decisions so i could say up here i

say up here i can go maybe i’ll say uh main first four and then i’ll call it uh maybe i’ll do a

double colon there and i’ll say top if just to make it easy to read that i’m kind of like at

the first if statement um maybe i’ll even put parentheses i’ll say a is more than 20 just to

kind of like name what i’m actually doing and then i could replace the a with the actual value of a

actual value of a so i could say a like that and maybe uh when i’m reading this later i might want

to kind of actually see the variable name so i could say uh you could just like put a as a string

and then maybe its value in parentheses or something like that do a new line um and then

maybe after that top thing i’ll say uh true to indicate that we’re inside of the the if statement

the if statement and then maybe at the bottom of that if statement we’ll just say

a is now true and we’ll say like a is now you know whatever the new value of a was so just

basically we’re announcing that we decided to go into this if block and then we announce what we

ended up changing a to and also you probably anytime you see a compound expression like this

You know B time something or a plus something or just you know a big part of multiple parts of the expression any expression

That’s more than just like one variable or one number. It’s probably a good idea if you break that up into temporary variables, too

and then

Print out each variable and I know that’s a lot of stuff to read but again it beats debugging for an extra six hours

I’m gonna leave that be for now though

leave that be and

I’m just gonna continue adding comments into the rest of the code. So I’m gonna do the second if block here

So I’m going to do the second if block here.

I’m going to say we’re in the first floor.

We’re in the bottom if more than 20 true.

And then we’ll print out what is the value of a after we’re finished.

We’ll say a is now is now whatever value for a.

And then I’ll do the same thing for this function call.

Because, you know, when I call this function, it’s going to change the value somehow.

So we’re going to do cout about to a plus equals f, you know, call to f.

And then inside the arguments, I’m obviously putting i plus 3.

But because i is a variable, we could just print that.

So I’m going to do quote, quote, and then just stick the actual i in there.

And then another new line.

a finished a plus equals f and then I’ll just say you know a is now you know a you know print the

new value of a you could also say a equal equal a and then print the value whatever you want but

the point is I’m just printing everything here so now let’s go down a little bit more because

there is a function call if you look at this function call down here here’s like some nonsense

being used here’s some other like you know disabled code really what i’m doing at the

very end is i’m just taking the input that the function received and i’m just multiplying it by

two and returning it so again imagine that your code is a lot more complicated than this

maybe input times two is actually input times two divided by three and then some other function

call and then some other this and some other that and whatever so a lot of people will just kind of

stuff like a really complicated expression in one line or one assignment or one return statement

And that’s super confusing because you can’t really be sure that every part of the expression is as you thought.

So it’s a really good idea to break it all up into parts and print each part.

So you could imagine that we have like a C out here and we’ll say C out, you know, begin F.

I’ll say like begin for F and then F receives an input of input.

Do an end L.

And then I’ll make a temporary variable here.

variable here I’ll say int temp results equals input times two and then I’ll

print that f and maybe I’ll do the input again

temp result is now and then say temp result so I’m just gonna print what the

temp result actually was and I could print something about I just multiplied

thing about I just multiplied the input by two and then you know the more

complicated your expression is the more temporary variables you want to use and

just kind of print every single one of them and print you know this new

variable is the result of dividing by two this new variable is the result of

calling some other function and so forth

so then we have like a basically you know basically a pretty good idea maybe

at the end though instead of multiplying by two again you want to make it more

want to make it more consistent with your debug output so like here temp result is obviously going

to be the result that i return why would you do the expression all over again for the return part

when you could easily get it wrong why not instead just return the temp result that you made right so

then that way your output completely matches what you’re actually returning and for now i think

that’s all we need to do let me run it one more time and then you’ll see a bunch of stuff now uh

Now, we have a lot of information that we can use to trace how our program was thinking and hopefully find the problem.

But isn’t this like a little bit starting to get a little bit hard to read, right?

You can see that there are kind of blocks happening whenever we iterate.

So, you know, for me, I always try to keep in mind you need all the brainpower you can get.

Why not just format it a little bit better so it’s really easy to just quickly look at one block and see, you know,

the couts kind of like belong together so i’m just going to add one more cout in the main for loop

here just at the very bottom i’m going to go couts and l just so that i get a new line and if i run

the program again notice how it’s easier to see the blocks like oh that’s clearly one iteration

right here you know your mind just grabs onto it faster and that increases your brain power and

makes it easier to debug and read the debug output so i can go all right all right okay so

all right okay so we’re right up here oh around uh iteration um number 83 uh a was this number

and then it got increased by uh this other number and the reason that that happened is because the

function returned 172 so it basically increased it by 172 and then it ended up being that number

oh okay i think i see what went wrong oh no right in this particular program if we scroll up just a

little bit we can probably see that the integer is overflowing right the integer was getting bigger

right the integer was getting bigger and bigger and bigger here and then eventually

it jumped into the negative at some point so right here we can see oh okay when did this

number become negative suppose we didn’t want it to be negative um what was this this is like

a million this is a billion no wait wait wait this is uh no that’s a million right there so it’s like

299 million and then it overflowed oh no no it didn’t it didn’t overflow it started at 299

it started at 299 then at the bottom it was sitting at 899 million that’s kind of close to a billion

and it did jump up from 300 million to 900 million so that’s a jump up of like 600 million

oh you know it’s like kind of jumping up faster with each iteration oh and i’m using a 32-bit

signed integer which has a maximum value of around 2 billion so now i could possibly realize at this

the number is just like it became too big and I need to change my data type or I need to change

my algorithm for some reason right so you can kind of get to the bottom of things pretty quickly

so here’s another problem that people encounter when they’re using caveman debugging

basically you you add all these cout statements or print statements or whatever you’re doing in

whatever language you have and then when you’re finished you’re kind of like well I guess uh

I need to delete all of these Couts because I don’t want all this you know

Junk being printed in my program after I fix the problem or maybe you’re trying to debug a different part of your program

So then you start commenting out all the print statements or you start

You know deleting them or whatever and then whoops later on you realize maybe that part of my program

Was not actually fixed and I have to add all the Couts all over again from scratch that costs time

So that’s not fun. So here’s a trick that I like to use. It’s called a short circuit

it’s called a short circuit it’s a sort of like a beginning C++ thing or just

when you’re first learning how to use logical operators for boolean

expressions so I’m gonna do a boolean and I’m just gonna name it after what

problem I’m trying to solve so we could just call this you know main C outs or

something like that let’s I don’t know primary problem I’ll call it primary

the boolean as true because then what will happen is uh we can then short circuit all of the cout

statements we can say primary problem couts and cout like that and the way the short circuit works

works is if you have a logical and expression you can see right here we have two sides

of that statement now one’s on the left which is just the boolean and one’s on the right which is

have a logical and then you know one and zero is equal to zero true and false is equal to false so

both things have to be true for the expression to evaluate to true which means if the first thing

is false there’s no point in even looking at the second thing at all because if i if i set that to

false then the second part the c out is it doesn’t matter the whole expression is going to evaluate

to false anyway so uh the logical operator itself will just you know block out the rest of the

you know, block out the rest of the statement.

That’s called a short circuit.

So I’m going to copy the short circuiting to all of my C out statements like this.

Okay.

And do that.

And then the C out there.

And I guess I’ll leave the final result there.

And for the moment, you know, this is just a regular function.

apply the short circuiting to this other f unless I do a separate boolean but

keep in mind if this was a class and you had two different methods that you

wanted to short circuit see outs inside of at the same time you could just use a

member variable and name it after the problem you’re currently trying to solve

and then just short circuit each see out in the appropriate method with that

boolean so I guess in this regular program that doesn’t have a class I

could move the boolean into the global if I wanted to but I’m not going to right

if I wanted to, but I’m not going to right now.

And if you’re writing assembly or some simpler language

and you’re thinking, hey, I can’t short circuit an assembly

or some other language, well, you could write a function

that just takes a couple arguments.

You could write a function that takes a string to print

and maybe a number to print or just, you know,

something simple like that.

And then in the function itself that prints,

you could call it debug print if you want.

Have it look at a global variable or define

that you’ve set up at the top of the assembly module.

set up at the top of the assembly module, which you can just turn on and off,

like just do a data byte and set it to a zero or set it to a one.

And then the function debug print will just look at that variable to decide

whether or not it’s going to actually print or not.

So, you know, it’s a little more complicated in assembly,

but you can do it basically the same concept.

Let’s run this again just to make sure it still works.

Okay, so it still works.

So now suppose I want to turn off all the Cout statements.

If I just change the true to false,

the true to false notice how it’s all gone except for the stuff inside of f which i told you i

wasn’t going to touch but notice how easy it was to mute it and then if i want to bring it back

later i just go true to unmute it of course if you want to do a little bit more typing you can

also do if statements like if this condition is true and that condition is true then print the

debug statement so then you can have a more complicated way of muting and not muting but

I’m going to leave it as is right now.

Let’s see, what else do we got here?

I think actually at this point, this is the basic idea of caveman debugging.

Just basically print everything.

Print all of your decision points.

Use pretty labels that are really, really easy for you to understand.

Use formatting so that your brain doesn’t have to struggle to understand what you’re seeing.

If you just print a bunch of numbers, you’re going to be shooting yourself in the foot.

you’re going to be shooting yourself in the foot and use short circuiting or if statements to

selectively mute them so you can do less typing and and debugging the debugging and so forth but

yeah i think i think this is all i really wanted to show you in this particular video

i hope you feel like an expert in caveman debugging i certainly am and it you know it

kind of fits my personality a little bit i’m like what’s going on um and like i said before

debugger it’s probably a better idea but I usually don’t unless I’m in big trouble

and I have a huge mess on my hands I usually just go directly to caveman

debugging we’ll look at the same piece of code in my next video that I’m going

to publish which is going to talk about using a proper debugger so watch the

next one also but for now I hope you’ve enjoyed this video thank you for

watching I hope you learned a little bit and had a little bit of fun see you in

video

whoops what the heck

hey everybody thanks for watching this video again from the bottom of my heart

i really appreciate it i do hope you did learn something and have

some fun uh if you could do me a please a small little favor could you please

subscribe and follow this channel or these videos

or whatever it is you do on the current social media website that you’re looking

at right now it would really mean the world to me and

more videos and grow this community so we’ll be able to do more videos longer

videos better videos or just I’ll be able to keep making videos in general so

please do do me a kindness and and subscribe you know sometimes I’m

sleeping in the middle of the night and I just wake up because I know somebody

subscribed or followed it just wakes me up and I get filled with joy that’s

exactly what happens every single time so you could do it as a nice favor to me

or you could you control me if you want to just wake me up in the middle of the

and then i’ll i’ll just wake up i promise that’s what will happen also uh if you look at the middle

of the screen right now you should see a qr code which you can scan in order to go to the website

which i think is also named somewhere at the bottom of this video and it’ll take you to my

main website where you can just kind of like see all the videos i published and the services and

tutorials and things that i offer and all that good stuff and uh if you have a suggestion for

clarifications or errata or just future videos that you want to see please leave a comment or

if you just want to say hey what’s up what’s going on you know just send me a comment whatever i also

wake up for those in the middle of the night i get i wake up in a cold sweat and i’m like

it would really it really mean the world to me i would really appreciate it so again thank you so

much for watching this video and um enjoy the cool music as as i fade into the darkness which is

us all.

Thank you.

The post Caveman Debugging: Simple Trick to Debug C++ Code Like a Pro! appeared first on NeuralLantern.com.

Want to master decimal-to-hexadecimal conversion? Join me in this fun, beginner-friendly tutorial where we break it down with clear examples?like turning 223 into 0xDF! From number systems to handy calculator tricks, I?ll guide you step-by-step, no stress. Bonus: my dog makes a cameo! Perfect for coding newbies or anyone curious about hex. Subscribe for more easy tech tutorials, and let me know what you want to learn next! #DecimalToHex #CodingBasics #LearnToCode

Introduction 00:00:00
Number Systems Overview 00:00:12
Decimal vs. Hexadecimal 00:00:39
Hexadecimal Digits Explained 00:01:06
Conversion Process Introduction 00:01:40
First Conversion Example Start 00:02:10
Handling Remainders 00:02:38
Dog Interruption 00:03:16
Continuing First Conversion 00:03:43
Finalizing First Conversion 00:06:04
Reversing Digits Order 00:06:24
Mapping Numbers to Hex Letters 00:07:34
Verifying First Conversion 00:08:48
Hexadecimal Prefix Importance 00:10:57
Second Conversion Example (223) 00:11:34
Third Conversion Example (2816) 00:13:32
Hex and Binary Relationship 00:14:56
Padding Zeros in Hex 00:16:07
Video Conclusion 00:16:58

Thanks for watching!

Find us on other social media here:

• https://www.NeuralLantern.com/social

Please help support us!

• Subscribing + Sharing on Social Media
• Leaving a comment or suggestion
• Subscribing to our Blog
• Watching the main “pinned” video of this channel for offers and extras

Hello there.

Let’s talk about converting decimal to hexadecimal.

Hopefully you’ve watched my other videos by now, but basically we have different number

systems, number bases that we can use.

We have decimal, which is a base 10.

which is base 10 or sorry base 16.

We can basically convert back and forth between all of these systems.

We can represent the exact same number just in different ways.

Just as a quick refresher.

Decimal, we can have characters that are 0 through 9, 0, 1, 2, 3, 4, 5, 6, 7, 8, 9.

That’s 10 total characters.

That’s why it’s base 10.

In binary, we have, you know, just characters 0 and 1.

characters 0 and 1 and in hexadecimal it’s meant to compact the representation a little bit it has

more characters or more possible characters per digit than decimal so the number is going to be

a little bit shorter usually unless it’s like very very small than decimal and it’ll be a lot shorter

than the same number in binary so in hexadecimal we start off with 0 1 2 3 4 5 6 7 8 9

three, four, five, six, seven, eight, nine.

And then to get the remaining digits, we just go A, B, C, D, E, F.

So we have this many characters.

It’s 16 total characters.

We can represent a number between 0 and 15.

So that’s a difference between, you know, hexadecimal and decimal.

Now let’s learn how to actually convert.

So I’m going to start off with a number.

I’m just going to type like a random number here.

Hopefully this doesn’t go on for too long, the conversion.

decimal number is just that. How do we convert? If you watch my other videos, it’s basically the

same thing as converting from decimal to binary, except instead of dividing by two, because binary

is base two, we’ll divide by 16 because hex is base 16. So I’m going to start off by saying,

let’s take the original number and we’ll divide it by not two, 16. What does that equal? There’s

no way I’m doing this in my head. So I’m just going to use a calculator for every single step,

going to use a calculator for every single step not even going to try I’m

going to say this number divided by 16 is 5 1 1 7 5 7 with some sort of a

remainder so I’m gonna go 5 1 1 7 5 7 remainder something so in most

calculators you can just punch up the modulo operator which is like the

percent symbol before I do that I just want to point out 0.75 is 3 4ths of

of whatever it is that is one you know that one character can represent we know

we can represent 16 different values what’s 16 divided by 4 that’s 4 so three

of those should be like 12 I hope unless I’m saying something totally wrong so

I’m gonna do modulo so that’s 12 okay remainder 12 my dog is growling at me

He likes to lie about peeing.

He doesn’t actually pee.

He already did a huge pee and then three times after that at 20 minute intervals, he went

out there and lifted his leg and just like three squirts came out and he expected a giant

treat for it.

I’m not doing it.

You’re not getting that treat.

I expect a big pee pee if you want a treat.

You dog?

Dang little dog.

Okay.

So, here we are still dividing.

here we are still dividing. I got the remainder. So then we just need to take, you know, the

quotient result, you know, what is the result of actually dividing, just carry it over to

the next line. I’m going to do some spaces to make it look all even and continue to divide.

So divided by 16 equals something. Don’t forget that if you have the modulo operator over there,

you got to take it out, go back to division. It’s going to be 31984 remainder something.

what’s the remainder i’m just going to get the modulo i don’t want i don’t want to recall what

0.8125 is i’m sure some of you out there can already do that but it is 13 remainder 13.

um so i’m gonna go 319 divided by 16 31984 divided by 16 so it’s going to be 1 999 okay so carry that

over real fast though divided by 16 equals 1 9 9 remainder something there’s no decimal point at the

There’s no decimal point at the end of that so I can just assume the remainder is going to be zero.

If you want to double check to be sure, which is a good idea, use the modulo operator.

If your calculator doesn’t have modulo, find another calculator or jump into Python or something.

So I’m going to carry over 199 to the next line there.

1, 2, 4, remainder, whatever modulo says, 15.

That’s pretty cool.

All right, then I’m gonna carry it over,

just 1, 2, 4, divided by 16 again.

If you were hoping I’d be able to do it in my head by now,

you were wrong.

1, 2, 4, divided by 16, it’s gonna be 7.75,

so just like seven, remainder something.

What did I say last time for the 3 4ths?

Was that 12?

whoops, I can’t remember anymore.

12, yeah, okay, so remainder 12.

And then we’ll carry it over and we’ll say 7 divided by 16.

So we know that, you know, 16 doesn’t really fit into 7 at all.

So it’s going to be 0 remainder, whatever the number is.

Let’s punch it here just to double check.

We’ll say 7 divided by 16.

You can see that it’s 0.

And then the remainder is going to be 7, just, you know, what the original number was.

number was. So now at this point when the actual you know carry down quotient is

going to be zero then we just have zero divided by 16 equals just zero remainder

zero and it’ll just continue like this forever and ever and ever and ever and

ever. So this is how you know you’re done. Another thing that I mentioned in

other videos is how do we actually know where the zeros belong? I mean if you

read this intuitively from the top to the bottom you might think that you know

you know the top number is going to be like the first digit but it’s actually

backwards it goes from the bottom up the reason you can know that is again based

on my other videos if we just type a random decimal number here if I add

zeros to the right side I’m actually changing the value of the number I’m

making it bigger but if I add zeros to the left side I’m not changing the value

at all so that means those zeros here which could go on for infinity based on

how much tenacity you have they should be on the left side because you don’t

side because you don’t want any amount of these zeros to change the value of your number because

they you know it’s an arbitrary number of zeros based on how how fast you get tired of doing zeros

so that means if i go from top to bottom i have to reverse it if i go from bottom to top it’s

already going to be in the right order or sorry if i if i correlate or if i map bottom to top to mean

left to right then it’s fine already if i map top to bottom for left to right then i’ll have to

For left to right, then I’ll have to reverse it when I’m done.

So I’ll do it both ways just to show you.

But there’s one more step we need to do because in hexadecimal,

we have more characters than decimal.

We have to translate what does this 12 and 13 and these other numbers mean.

Luckily, we had some of them in there.

It could have been too easy.

So remember in hex, we have 0, 1, 2, 3, 4, 5, 6, 7, 8, 9.

And then we have A, B, C, D, E, right?

So we know that the value of 0 is 0 and 1 is 1 and 2 and 2 and so forth, right?

Like 9 is 9.

But what’s the value of A?

For each increasing digit, the value just goes up by 1.

So that means that A is worth 10.

I’m going to write this vertically just so that you understand that this means the strength

of the A is 10.

And then the strength of the B is going to be 11 because it just increases by 1.

The strength of the C is 12.

The strength of the D is 13.

Oops, I forgot the F.

Oops, I forgot the F. Hit F in the chat if you forgot the F too.

So the strength of the E is 14. The strength of the F is 15.

And then we’re done. And remember, there’s 16 digits total.

So the highest value is 15 because it includes the zero.

So, you know, 16 total possible values you could represent, but the highest value, 15.

So that means every time we see a 12 here,

say that that’s really a C and every time we see actually let me let me put

the other C in there real fast every time we see a 13 that means it’s a D

every time we see a zero zero through nine it just it means the original

number oh wow we only had two digits that are gonna mean the original number

so mark my words you know the 15 is gonna be an F every time you see zero

one two three four five six seven eight nine it maps to the same number so seven

maps to seven it’s totally fine the only time it maps to a letter is of course when you exceed nine

so 10 and above are going to map to letters so now i have these mappings i just need to sort of scan

uh my my work to come up with the correct hexadecimal number so i’ll start from top to

bottom because it’s a little bit harder that way and it’ll be more brain practice i’m going to go

and then you know as many zeros as you decided to calculate and hopefully this

reminds you oh no I’m increasing the value by adding the zeros that means I

have to reverse everything so I’m gonna get rid of these zeros though and I’m

gonna reverse it 7cf0dc okay great now let’s double check because it’s always

a great idea to check your work in different ways with different methods to

decrease the possibility that you’re accidentally wrong so now I’m gonna go

So now I’m going to go from bottom to top and see if it’s the same thing.

7 C F 0 D C. Does it match? Yes.

So now I’m pretty confident that I have the right answer.

Let me punch this up in my personal calculator real fast.

I’m going to do just to double check the work before we cut the camera,

because if I’m wrong, I want to be able to correct myself right away.

Instead of coming back with another video later,

which sometimes I guess I’ll have to do.

f0 dc is the correct answer all right so we now have converted our first number from decimal to

hexadecimal nice and by the way if you didn’t already know this you’re supposed to put a

prefix in front of hexadecimal numbers not necessarily in every program that asks for

hex input some of them are not programmed that way but in general when you expect someone to

read your numbers if it’s hex you want to put ox in front of it because you don’t want them to

confuse, let’s say we have this number and this number and this number. All three of those could

be a different number depending on whether they’re binary or decimal or hex. But if you put the

symbols in front, this is binary, this is hex, then now the reader knows that these are three

different numbers and they can infer what the numbers mean. Okay, so let me, let’s just do like

another number. We’ll make it a little bit smaller so it’s easier. We’ll say decimal and we’ll go two,

and we’ll go 2 2 3.

So it’s faster.

So we start off with 2 2 3,

we divide it by 16,

and that’s going to be something.

So 2 2 3 divided by 16

is going to be 13 remainder something.

I’m going to do the modulo operator.

And by the way,

if you don’t have a modulo operator

and you can’t figure out a better way to do this,

a good trick is to just say,

let’s take 13,

because that was the answer, right?

13 point something.

We’ll take 13 and multiply that by 16 again,

that by 16 again so it goes higher then take the difference between that and the original number

so we can say 223 minus uh the number multiplied back up and it’ll tell us that our remainder is 15.

let’s see was that actually the remainder let me just double check here oh gosh what am i doing

223 modulo 16 15 yeah there it is if you’re lazy like me you could also do something like this i

and I don’t have a modulo.

I’ll do 13 times 16 and it’s 208.

And then I’ll just subtract the original number

and then we get negative 15,

but then I know it’s not negative, I know it’s 15.

So it’s just like, it makes you a little bit faster

in the calculator.

So this number I think was too small

because we just do 13 and then divide that by 16.

Obviously the answer is gonna be zero remainder 13.

And we just have a two digit hexadecimal number.

digit hexadecimal number. Let’s do that real fast. What is 15 going to be? It’s A and no, no,

no, not A. Sorry. That’s F. Subtract two from that. D E F. So it’s going to be D, I think.

So then if we go from bottom to top, it’s going to be O X D F. Let me double check that I’m

telling you the right thing. 223 D F. Okay. So we got it right. Let’s do something just like a

not as difficult as the first one so I’ll try four digits maybe two two two two

how about that four digital four digital digits how about that we’ll do

two eight one six divided by 13 equals something two eight one six divided by

16 that’s 176 remainder something there’s no decimal point so I can just

16 is 176 divided by 16 is 11.

Another zero remainder.

Getting kind of boring though, isn’t it?

Remainder zero.

And then we’ll do 11 divided by 16.

That’s going to be zero remainder 11.

That’s too easy.

Okay.

So what is zero?

Zero is zero.

You’re welcome.

And then what is zero?

It’s also zero.

0, it’s also 0 and then what is 11? That’s B.

So we should have a number now of 0xB00 if we’re going from the bottom to the top.

If you go from the top to the bottom of course it’ll be 00B and then you reverse it B00

but I just wanted to skip that step for now.

Let me punch this up into my personal calculator to make sure I don’t need to make a correction.

B00, there we go.

Also, you know, here’s another thing to keep in mind.

it’s to read you know sets of bytes which typically go in patterns of one byte or two

bytes or four bytes or eight bytes or whatever so the cool thing about hex is one character

can represent a number from zero uh to 15 or 16 combinations and if you think about that in binary

that’s four bits right it’s like one two three four one two four eight multiply eight by two

16 subtract 1 is 15.

So you can go from 0 to 15.

So that means for every character in hex,

you get four characters of binary.

So it’s like a huge savings, right?

But the point is, if you wanted to represent one byte,

that’s not going to be four bits.

That’s going to be, you know,

four bits followed by four bits for a total of eight bits.

Even if there are zeros in the beginning,

in binary, if you’re representing a byte,

But in binary, if you’re representing a byte, you typically want to pad the zeros to the

left so that it looks like it’s aligned to nice blocks of eight or 16 or 32 or 64 in

terms of bits.

So we should do the same thing with hex.

We should always have two hex digits together.

We should try not to have like an odd number of hex digits.

And if you want to get more strict than that and say like, oh, only, you know, two or four

eight you can do that but i just will say pad it with a zero to the left remember when you pad a

number with zeros to the left it doesn’t change the value like if i just put a bunch of zeros in

front of this decimal number it wouldn’t change the value so we can do that with hex and it looks

nicer and neater and people can quickly see okay so there’s like a byte right there it’s ob

they can imagine oh that byte is probably um 11. so there’s like a like an 11 byte it’s like got

a sequence of zeros and ones and then there’s another byte right after it which is smaller

which is smaller, which just has zeros.

So it just helps the reader visualize what’s going on.

Okay, I’m going to cut the video here.

I hope you enjoyed this video.

I hope you learned a little bit of stuff and had a little bit of fun.

I’ll see you in the next video.

Hey, everybody.

Thanks for watching this video again from the bottom of my heart.

I really appreciate it.

I do hope you did learn something and have some fun.

If you could do me a please, a small little favor,

please a small little favor could you please subscribe and follow this channel

or these videos or whatever it is you do on the current social media website

that you’re looking at right now it would really mean the world to me and

it’ll help make more videos and grow this community so we’ll be able to do

more videos longer videos better videos or just I’ll be able to keep making

videos in general so please do do me a kindness and and subscribe you know

sometimes I’m sleeping in the middle of the night and I just wake up because I

And I just wake up because I know somebody subscribed or followed.

It just wakes me up and I get filled with joy.

That’s exactly what happens every single time.

So you could do it as a nice favor to me or you could troll me if you want to just wake me up in the middle of the night.

Just subscribe and then I’ll just wake up.

I promise that’s what will happen.

Also, if you look at the middle of the screen right now, you should see a QR code,

which you can scan in order to go to the website, which I think is also named somewhere at the bottom of this video.

where you can just kind of like see all the videos I published and the services

and tutorials and things that I offer and all that good stuff and if you have

a suggestion for clarifications or errata or just future videos that you

want to see please leave a comment or if you just want to say hey what’s up

what’s going on you know just send me a comment whatever I also wake up for

those in the middle of the night I get I wake up in a cold sweat I’m like this

really it really mean the world to me I would really appreciate it so again thank you so much

for watching this video and enjoy the cool music as as I fade into the darkness which is coming for

us all

Thank you.

The post How to Convert Decimal to Hexadecimal: Fun & Easy Guide for Beginners appeared first on NeuralLantern.com.