In this step-by-step guide, I walk you through setting up a Raspberry Pi headless—no monitor needed! Learn how to tackle SD card issues, disable the auto-mount service (uDiscs2) to avoid corruption, and configure SSH for secure remote access. I’ll also show you how to set a static IP using Network Manager, prep the Pi for a WiFi dongle, and install the “screen” utility to save your work. Whether you’re a beginner or a seasoned Raspberry Pi enthusiast, this tutorial covers practical tips to get your Pi online and ready for projects. Hit subscribe, check out my website via the QR code, and join the community for more tech tutorials!

Introduction and SD Card Issue 00:00:00
Disabling Auto-Mount Service 00:00:41
Mounting SD Card Partitions 00:01:24
Configuring SSH on Boot Partition 00:02:15
Setting Static IP in cmdline.txt 00:02:48
Configuring Root Partition and SSH Keys 00:03:44
Setting File Permissions for SSH 00:06:04
Unmounting Partitions and Booting Pi 00:07:31
First SSH Login to Pi 00:09:14
Configuring Network Manager for Static IP 00:09:51
Setting Hostname and System Update 00:17:01
Installing Screen Utility 00:18:24
WiFi Dongle Installation Overview 00:19:11
Video Conclusion and Subscription Request 00:21:00

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

Okay, I’m back.

I have finished writing my SD card.

I had a problem when the scene was paused.

Basically, those annoying pop-ups came back

where I was like in the middle of writing to the card

and the auto-mounting service suddenly decided

that there was a file system there

and it auto-mounted it and then it, you know,

put it up onto the screen.

And I think it corrupted the card.

So I ended up having to rewrite the card from scratch.

So let me just show you real fast within this video how to disable that service.

It’s sudo system control.

Start with status and then type uDiscs2.service.

For me, I already disabled this to get it working.

So what happened?

No, I already stopped it.

I already stopped it. Basically you just want to do stop to temporarily stop it.

And then if we go back to status, it’s still it’s still enabled. That just means that it’ll come back on for the next boot.

Okay, so if your SD card corrupted or anything like that, you probably want to start over after you disable U-Discs.

And then if we use the Partead partition editor again, we can see that SDB is still there.

So that’s still considered the name of our card. So now that

now that the auto-mounter is not doing anything for us we need to mount the card ourselves so

i’m going to go into cd actually just to double check media and then mike and then notice how

it’s not mounted so i’m going to go into cd i’m going to go into the temporary directory i’m going

to go into that pi directory i think i probably made that earlier on camera for you and then i

made two other directories one called boot and root so i’m just going to mount the uh oops dev

partition one, which is usually the boot partition to the boot folder.

Do my password and then do the same thing for partition two,

which is usually the file system root folder.

So first thing we need to do is go into the boot partition.

So this is what the pie will see when it boots up.

Yeah.

Okay.

So what we need to do is make an empty file called SSH in the boot folder

SSH in the boot folder or the boot partition because we want to tell the

pi that its SSH server should be enabled by default so I’m gonna go sudo touch

SSH if I list it again notice how there’s just an SSH folder and that’s it

there’s nothing inside of it the pi just knows the other thing we have to do is

modify the startup command line here I already did this actually when I jumped

Basically you want to do, you want to edit the cmdline.txt file, and then you want to

find the argument that says root wait.

And right after that, you want to stick the IP address that you want your PI to start

up as or start up with.

So it’s IP equals and then the address.

And then again, like we said before in this video, you need to know what is the subnet

of your existing network and you need to choose an IP address for your PI.

Let’s see if I actually matched what I was supposed to do.

to do oh gosh for the pie yeah 5.1 okay so I’ll move that over to the first thing there yeah so

just 123 is what we wanted so that’s why that is there so I didn’t actually modify this but you’ll

have to modify yours I didn’t because I have to because I already did it and then we’ll go into

the into the root partition so we’ll go into the root partition and notice how it’s got like all

And notice how it’s got like all the files and folders that you’re used to seeing with Linux.

So that means, you know, this is the temporary amount slash pi slash sorry, slash temp slash pi slash root.

Inside of it, there’s a subfolder called home.

And then there’s the home directory for the root account under the root folder.

You could modify that instead if you want to.

I’m just going to go into the home account.

Sorry, the home folder.

And then go into the pi accounts home folder.

because that’s what your PI account is going to start off with.

Again, notice how we’re in like a deeper subdirectory.

So from the PI’s perspective, we’re really only in slash home slash PI.

I already actually did this.

When I jumped away, I wanted to make an extra video for SSH or sorry, for first boot stuff.

So I made the SSH folder.

What you need to do is make directory dot SSH so that you have a SSH folder in this PI folder.

in this pi folder then once you have that go inside of it and you want to make a file called

authorized keys so i did nano authorized keys like that and then i edited it and i just put the public

key of of the machine that i’m currently on right now this is just a virtual machine so i guess it’s

fine if i share but um what you want to do is generate your own ssh key if you don’t know how

but uh you can print out your ssh key with pretty much cat squiggly line or tilde swinton and then

like a slash and then dot ssh and then id and then dot pub so that was my public key that’s how i

found it and then um you know if you don’t have a key you can go ahead and do this on your host

ssh keygen forgot if i put this into the last segment but you type that and hit enter a bunch

of times and when you’re done hitting enter enough you’ll have your public key there somewhere

your public key there somewhere. You probably want to eventually learn how to put a password on your

key but it’s fine for now. So we created the authorized keys file that basically tells

the operating system that I would like that particular key to be able to authenticate as

that user and since the pi is a god user or like a root user it’s pretty nice. The other thing we

have to do is make sure that we set permissions correctly. If the permissions aren’t correct on

your SSH will not authenticate so so I’m gonna make sure that this is set to

the right permissions for me I usually do 7 0 0 on the authorized keys file I

can’t remember if 6 0 is fine so I just put 7 that basically means that your

current user which will eventually be the PI user has full permission to look

at that file but nobody else does so you can tell by the way because on the left

execute and then a bunch of empty dashes meaning nobody else has permissions so we got to do the

same thing for the ssh folder um so i’m going to go uh you know chamad if this doesn’t work by

itself you might want to say pseudo chamad but i think it’ll work because the username that it

thinks is on that folder is actually the same as my current user which is great so i’m going to go

and not the six on there, meaning the current user should be able to actually like read

that directory.

If it’s six, they won’t even be able to read the directory.

So we do that just to make sure that the dot SSH file and the authorized keys file have

correct permissions.

And then I think we’re ready to log into the pie for the first time.

So I’m going to go up.

By the way, if you were inside of root for some reason, I do this sometimes, sudo su

and let’s, oops, let’s go up and then let’s unmount,

whoops, let’s unmount this boot partition

or the root partition.

You may get an error message saying

that the partition is busy

because what you didn’t realize was the account

that you just came from is still considered

in that directory.

So you gotta make sure that there are no terminals

or accounts or anything actually using that directory

before you try to unmount it.

So I’m gonna go sudo, oh, I gotta go up one level.

sudo unmount boot umount and then umount root uh if there are no error messages then that means

the sd card is ready to be put into the actual pi before i do that though i’m going to start

pinging the pi because it’s fun to see the pings come online i’m going to go 192.168.123

because that’s what we chose for the pi already in my other video that i just made i typed like a

here forever on camera. I’m not going to edit it out. So I’m going to take the SD card out

and you can’t really see my Pi because it’s plugged into an ethernet cable, but I’m plugging

an ethernet cable into the Pi. I’m putting the SD card into the Pi and then I’m going to plug power

into the Pi. Totally headless. Don’t have to worry about very much at all. So it’s got power now.

and pretty soon now it should start responding to pings.

Soon as it comes up,

I’m gonna log in and start finalizing the ethernet setup.

There it goes.

Might take like a few more seconds after this

before the SSH server actually comes up,

but I’m gonna give it a try right now and see what happens.

And remember to do PI at,

because we did not make a different user.

When you see this message right here,

that the remote is not recognized that’s a security feature so I’m gonna put yes

and now we’re in the Pi so what I was supposed to do is a network manager connection show at least

this version of the Pi the latest version uses network manager if you’re watching this video

from the distant future you probably just need to you know use whatever tool they have instead of

network manager so I’m gonna edit the ethernet connection and I’m gonna print the connection

the connection details just to double check here.

It’s…

I guess it’s fine.

So now I’m going to set up the IPv4 settings.

So I’m going to go set ipv4.method to manual

because I want a static IP.

Getting dynamic IPs that are also fixed is kind of like another video.

I want to set the address to the one that we just put into the command line.

So 1.123 and give it a 24 block,

meaning it’ll be considered in the same subnet

with other addresses that only have the last number changed.

Then we’ll set the gateway to 1.1,

which is the router address.

Okay.

I’m looking at notes right now, 1.1.

And then we’ll set the DNS.

You don’t actually necessarily need to set the DNS

if you’re, well, I don’t know,

maybe you probably should if we’re doing static right now.

Yeah, you should probably maybe try setting the DNS

as your router, because usually your router

is also your DNS server at home.

If that doesn’t work, maybe try a different number

that you can find online.

This one is, I think, Google DNS.

You just need at least one DNS server,

preferably two or more that works

so you can resolve numbers to names

and your computer can go online by typing names.

So for me, these are my DNS servers.

So I’m just gonna type them in real fast.

Whoops.

And then you don’t need to do this next setting,

You don’t need to do this next setting, but I like to be able to use shorter server names.

So for me, instead of typing… Let me show you what this means in a second. So I’m going to say

my search domain is home because I have a fake domain at home called home. Most people do LAN.

You should probably double check this by saying print ipv4, like print ipv4. And then after we’re

reason I do this is if I ping a server, like let’s say I do router.home, for me that’s too much

typing every single time. If I added that.home search domain, then I could just ping router.

So that’s the only reason that I do that. It’s just a little bit more convenient.

So now let’s remove the setting that we put into the command line so that we have more freedom to

modify the network in the future if we want to. So let’s go to the boot partition.

We’re in the PI right now, so it’s a little bit different.

We’ll go into the firmware subfolder and then we’ll modify that command line file that we

had in before where we were forcing that IP.

We’ll just erase this so that it’s no longer forced because the network manager configuration

we just did should be okay.

And then let’s reboot, reboot the machine.

Do another ping so that I can get online as soon as it comes back up.

Should just take a couple seconds here.

seconds here. So how was your day? How are you? I think somebody let me know if I look weird in

this camera because I have like a new camera with like a viewfinder or not a viewfinder,

like an LCD display. I didn’t used to have that before. I had the oldest, cheapest,

crappiest camera you could possibly imagine. Now it’s just kind of cheap.

lcd you know screen so i’m looking at my own face right now instead of the camera

so tell me if this seems strange or weird to you

but

Okay, so I’m back.

I don’t know where I cut the last video, but basically we had just set a static IP address

on the Pi and then rebooted it and it didn’t come back online.

So I had to stop the video and just try to figure out what I did wrong.

And basically I forgot to tell the connection to start on boot.

So what I did to fix it is I went into the SD card again.

So I did another mount.

I didn’t mount the boot partition.

I only needed to mount the root partition.

and the path that you go into is pretty much this if you’re using network manager

you go into your temporary amount so that’s this first part right here temp pi root and then the

file system from the pi’s perspective this is the path where you can find your system connections so

etc network manager system connections inside of it you’ll see a file for every connection that you

set up on the fail that you just did or that i just did maybe this will prevent you from

failing. Maybe I’ll show you how to set that inside of the Pi too, just to be sure.

So basically we’re just going to edit that connection file. There’s a bunch more stuff

down below, but I just kind of spaced that down so you won’t see it. What you’re really interested

here in this connection file is auto connect. It should have been set to true. And now if we do that,

we should be able to unmount the card and boot the Pi back up and then it should go online.

It’s actually kind of like maybe a good reminder to always include redundancies as a good computer

nerd, right?

Computer scientists, computer nerds, we always like have redundancies in everything.

What I should have done is chose a different IP address for the network manager connection.

That way if I screwed it up, the Pi would still boot under the first address and only

after seeing that it booted with the new address, I could have removed the first address.

But you know, I’m a little impatient and careless sometimes.

I’m going to unmount this root partition and we’ll go back to looking at the

pings, right? That’s the correct ping.

I’m going to remove the SD card from the reader.

I’m going to put it back into the pie and then I’m going to plug in the power.

Okay. Now, hopefully it won’t take long before the pie comes back online.

If it never does, you and me are going to be sitting here.

You and me are going to be sitting here.

Oh, please, come on, what have I done wrong?

Okay, it works this time.

So it was definitely the auto connect.

So now I’m going to go SSH into the Pi.

We already saw that security warning, I think, either in this video or the other video, but

what have I done?

I forgot to put the one there again.

Dumb.

Dumb. Okay, so we’re in the pie. First boot, first connection without even using a computer monitor. Pretty sweet.

So now I’m going to go sudo network manager command line show and then I’m going to edit the ethernet connection

just to show you what we should have set before we saved. It would have been connection.autoconnect.

Connect to yes.

That didn’t change anything, but that’s what I should have done.

I mean, it would have changed something before.

So now we’re inside the Pi, and we’re ready to start setting up more stuff.

So the first thing I’m going to do is, well, I’d like to change the hostname on this Pi.

So I’m going to do sudo nano etc hostname.

There’s a command called hostname I think you can use, but I just like to set it in the file.

So basically, we want to set the hostname of the Pi.

pi that’s not terribly useful for now but I just like it because it shows up on the command line

so I’m going to go pi repeater dot living room dot home don’t judge me for my silly domain names

so now the next time we reboot the pi we’ll have a good domain name then I’m going to do an update

so I’m going to do actually you know what what you should do at home I’m going to omit this just to

sure everybody should do that because the local list of packages that are available needs to be

updated otherwise you might have a hard time installing later it sometimes gets out of sync

and it doesn’t work so we’ll all do update at home you should do upgrade right away i’m not

going to do upgrade right now because it’ll take a long time and then after you do upgrade you

should do auto remove with a dash yes there or just type yes manually again i’m not going to do

And then you should reboot the computer or reboot the PI

then let’s

Install a program called screen which gives us a virtual screen. Let me show you just real fast

What this is for so sudo apt install screen

It’s just basically a virtual screen that you can work on

So if you accidentally lose your connection or something goes wrong, you can log back in and get right back to your work

so I type screen here and I’ll just type like a bunch of random characters and

type like a bunch of random characters and then I will detach from the screen and exit the Pi. So

imagine you lost your internet connection or your network connection. I can go back into the Pi now

and I can list screens with screen-list and then I can reattach to it with a dash R.

Notice how my work is still there. This doesn’t survive if the whole machine reboots but this has

saved me a few times from losing work when I was connected to a remote terminal. Okay so now what

Okay, so now what do we have to do?

The next most important thing that we have to do is install our WiFi dongle.

We have to actually install drivers.

If you’re looking at this video way in the future, I don’t know, maybe the Pi will handle

this.

But right now, as of the making of this video, this dongle doesn’t work unless you install

the drivers from source.

So let me just prove to you real fast.

out. Well, maybe you’ll just have to trust me. At home, do this command IP, whoops, do this command

IP ADDR and hit enter. And you should see two network adapters, you should see Ethernet zero

and also wireless LAN zero. Wireless LAN zero should be already working. It’s not connected

yet, but it’s working. Because well, that’s the one that’s built into the pie. You want also

another one you want wireless LAN 1 like we talked about before for that we have to plug

in the dongle and install the the firmware so I think what I’m going to do now is stop

this video and jump into another one where I just kind of talk about how to install this

dongle so by the time you watch this video that other video should be posted I’m basically

just going to expect that you pause this video and you go over there and you watch the video

If you don’t have the same dongle as me, that’s okay.

The instructions will probably help you get a pretty good idea for how to do it yourself.

And then again, if enough people comment about the same…

I don’t know if I said this before.

If enough people comment asking me to make a video for the same dongle,

I might buy the dongle and then just try to install it for everybody.

We’ll see what happens.

So I’m going to cut the video now.

Go to the other video that shows you how to install the dongle, and then we’ll continue.

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,

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 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 night just subscribe and

then I’ll just wake up I promise that’s what will happen also if you look at the

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 uh clarifications or errata or just future videos that you want to see

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 coming for us

Thank you.

The post Headless Raspberry Pi Setup: SSH, Static IP, and WiFi Dongle Guide appeared first on NeuralLantern.com.

Get a clear, beginner-friendly dive into how your CPU works! This video explains the fetch-decode-execute cycle, the role of the clock, instruction pointer (RIP), and units like the ALU and cache. Learn why timing matters and how your CPU handles instructions step-by-step. Perfect for gamers, coders, or anyone curious about what makes computers tick. Inspired by Kip Irvine’s Assembly Language for x86 Processors, this is your gateway to understanding computer architecture. Subscribe for more tech insights and hit that QR code to explore more tutorials! #CPU #ComputerScience #TechTutorials

Introduction to CPU Operations 00:00:00
CPU Clock Explanation 00:00:17
Clock Cycle and Stability 00:01:07
Instruction Fetch from RAM 00:03:24
Instruction Pointer (RIP) Role 00:03:48
Sequential and Conditional Execution 00:04:49
Code Cache Functionality 00:06:24
Instruction Decoding Process 00:07:51
Control Unit Operations 00:08:33
Arithmetic Logic Unit (ALU) 00:08:52
Floating Point Unit 00:11:03
Data Cache Usage 00:12:08
Summary of CPU Process 00:14:36
Closing and Subscription Call 00:15:07

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

CPU #ComputerScience #TechTutorials #ComputerArchitecture #AssemblyLanguage #TechExplained #CPUBasics #LearnTech #x86Processors #Coding

Hello there. Let’s talk about how your CPU fetches, decodes and executes instructions.

We’re going to just do a quick surface level overview, but I hope you like it.

Okay. So for starters, your CPU has something called the clock.

keep my pen onto one monitor here let me just double check that real fast

okay is it working yeah okay so

okay so notice how we have this line that goes up and down and up and down it kind of looks like a

little binary line uh it actually is uh sometimes your cpu is outputting a zero to this special

and it just oscillates between zero and one constantly it goes zero one zero one zero one

it does so very very very very fast and the reason it does that is because something needs to control

the timing of your cpu imagine this we kind of take this for granted but when you apply electricity

somewhere as a human you kind of feel like the electricity goes to the other place like on the

other side of your house or your room or whatever you kind of feel like it goes there instantaneously

really fast but in reality electricity doesn’t go faster than the speed of light so there is a limit

which means if you have a cpu that is executing instructions really really really really fast

you know fetching instructions from your system ram really really fast

there’s there’s there’s the problem of trying to um to know for sure that the electricity actually

made it uh to the other place in time uh so like what if we said let’s load some instructions from

load some instructions from memory, they come down the wire to your CPU.

How do we know when it actually finished coming down the wire to the CPU?

We just take it for granted.

But in reality, physics has a limit.

And so the electricity needs time to get there and it needs time to stabilize.

So the clock cycle helps us with that timing.

So, you know, if we make the clock go too fast, your CPU becomes unstable.

Your gamers, you gamers probably know that.

If we make it too slow, then it’ll work.

it’ll work, but, um, you know, we’re not getting the fastest, you know, CPU, uh, that, that

we, that we can, we’re not getting all the performance out of it that we can.

So we make it, we make the clock cycle go as fast as we can, uh, without making the

CPU, uh, instable.

And so just keep that in mind.

That’s one component of the CPU.

Okay.

So then the next thing I wanted to show you, oh, and by the way, let me give credit to

the authors of this book.

I’m just looking at a diagram, but, um, this book is written by someone named Kip

This book is written by someone named Kip Irvine

and it’s titled Assembly Language for X86 Processors.

It’s written by Pearson or it’s published by Pearson

and the year is 2014.

So get a copy of this book.

Anyway, so this is a simplified CPU block diagram.

Let me get my notes here real fast

so I don’t forget what I was supposed to say.

Clock ticks and alu.

Okay, so I guess that’s pretty much it.

Imagine now that we have a little RAM stick or some place where we can get instructions for the CPU.

So this is like system RAM, we’ll say.

And we’ll just pretend for the sake of argument that we already have existing circuitry

that will easily transfer data back and forth from the RAM stick to the CPU.

So anytime the CPU wants to grab some kind of data or like an instruction or something off the RAM stick,

it can just do it. And that’s the arrow right there.

keep in mind after that is that there is a special register in the CPU called the instruction pointer

RIP in x86-64 assembly the RIP register and the RIP register it basically just holds a memory

location telling the CPU where is the next where’s the address of the next instruction that we want

to execute so you know imagine you have like some kind of memory address 0x I don’t know 55 and then

an instruction on the very next actually let’s do five zero so I can increase this by eight without

doing hex in my head we’ll say this is like the address five zero in hexadecimal so that means

that the next time the CPU wants to execute an instruction it’s just going to ask system ram

for that address system ram is going to give it whatever ones and zeros it has and then it can be

decoded and executed after that and then of course we have to execute a program you know step by step

you know step by step we have to execute more instructions and we can’t just do one instruction

so typically in a program you execute instructions one by one by one by one by one

and then every once in a while there might be some decision logic like you have an if else

branch like let’s say uh you know for the for the high level people i’ll put a question mark here

you have like an if statement and you say like if that’s true then execute this i’ll put maybe i’ll

then we’ll just execute this other logic down here. So you know very often we execute instructions

sequentially but every once in a while we have to jump right because if if you executed this

if statement and you realized that this condition was not true then you could not execute the body

that came right after the comparison instructions you would have to jump down to wherever the else

block is so there is circuitry inside of the CPU that allows you to either increase the instruction

instruction pointer by 8 bytes, 8 bytes because 64 bits per instruction because that’s your CPU.

So you just kind of go sequentially or to jump somewhere because you made a decision or you’re

like making a function call or whatever. So just keep in mind that under the hood, under this

diagram, there is a lot more logic even than the more detailed diagrams that you can find elsewhere.

There’s just like a lot more detail. So anyway, the RIP register just kind of increases by 8

every time we execute an instruction,

sometimes it’ll drastically change its address

so we can jump execution somewhere else

in order to make a decision.

So just keep that in mind.

So suppose that we just fetched an instruction from memory.

You know, it comes in here

and we kind of send it down the line.

We first give it to the code cache unit.

Your CPU is just not a solid block of stuff.

It’s got subunits inside of it.

And one of these units is the code cache unit.

it’s a lot more complicated than what you’re seeing here but basically

system ram is very slow dealing with the cpu internally is very very very fast in comparison

so if we have like a register or some unit that we’re accessing that’s inside of the cpu it’s

lightning fast compared to accessing the memory so that means cpus have caches which just i’m not

going to go too much into caches for this video but basically every time we get a new instruction

we might put it into the cache, which is like incredibly fast because it’s hardware that’s part

of the CPU. Then maybe sometime in the future, we might want to execute the same exact instruction

at the same exact address. Again, that’s possible. Remember we have loops. We can execute the same

instructions a bunch of times in a row. So if we come across an instruction that we have executed

in the past and it’s already in the code cache, then we don’t actually need to wait for memory

to fetch the instruction for us, we can just go directly to the code cache and it’s a dramatic

speed up.

Remember, when you access memory, execution has to stall for quite a long time usually

or sometimes.

Okay, so that’s what the code cache does.

Once the memory and the code cache have figured out, okay, we got the instruction and everything’s

good, then we just sort of decode the instruction.

We decide, you know, what is in the instruction?

it all like data or is it all like like is it half and half and part instruction

part data part whatever there’s lots of different formats for instructions so

the instruction decoder just sort of like you know decides how to separate

it and it sends data into the control unit notice how there’s a little arrow

pointing from the instruction decoder to the instruction pointer so we could use

that information to decide how to modify the RIP register like if we’re gonna go

or if we’re going to jump somewhere.

And then the, let’s see,

when we send the instruction to the control unit,

the control unit is not necessarily the brain

because the whole CPU is the brain of the computer,

but the control unit is kind of like the decider of the CPU.

At least that’s the way I see it.

It decides what to do.

There’s a lot of other subunits in the CPU.

Notice how down here we have, you know, CPU registers

and we also have the all you.

the all you the all you is basically the arithmetic logical unit so it’s it’s a little subunit that

will execute mathematical instructions or logical instructions like it’ll take some bits and it’ll

it’ll move them to the left or the right or it’ll flip the bits or whatever or it’ll add two numbers

together the registers you know they’re very very very fast they’re like you know the variables of

the cpu um so the control unit will examine uh whatever it’s getting and it’ll decide all right

want us to do it wants us to add two integers together or it wants us to

write something to memory or it wants us to do whatever right so when

the control unit receives input remember this is all just like ones and zeros

right so imagine if we had like a bunch of ones and zeros coming in and they’re

just wired directly into the control unit right so then the control unit has

its own internal circuitry that that makes it so well if I receive this

going to tell everybody else to add numbers together and if I see some other number I’m

going to tell everybody else to multiply numbers together so the control unit is really responsible

for deciding what the other units need to do in order to accomplish the current instruction

so gosh I really need to fix this I just reconfigured this thing and now it’s just like

drawing even when I don’t want it to draw so the control unit let’s say that we do that we have

that we have like an addition instruction we want to add two registers together the control unit will

send this down the wire to let the all you unit know that it needs to perform addition the all

you unit also has inputs and based on what it receives it will decide to do something it’ll

decide to add or subtract or multiply or just whatever so the control unit sends the right

input into the all you unit so that it knows to add or do whatever we wanted it to do

operands like it might receive data that just came from memory it might receive registers it might

receive just like a raw immediate number that’s embedded into the instruction on the other hand

we might also send something into the floating point unit so the control unit it’s always sending

all of these signals to all of its you know connected units these wires it’s not like we

can remove these wires so there’s always something even if it’s a zero going down the line

so the control unit will basically send the right signals down to the all you to tell it you’re

going to add and it’ll send the right signals down to the floating point unit to say you’re

not going to do anything or just we’re not we’re going to ignore the result there’s like all these

logical gates that we’re not showing on this diagram where we can just like ignore the output

result of some unit that we’re not going to use so it’s sending all these signals to these units

Just like a quick note here, the all you only deals with integer math and, you know, bitwise

logical operations.

Floating point numbers in the machine are stored totally differently than integers.

So we need a totally different unit in order to process them.

So that’s why there are two units there.

Well, I mean, I guess depending on, you know, what CPU we’re talking about, but like as

far as the ones that I’m aware of and that I use.

So then, you know, the data cache, kind of the same thing.

kind of the same thing um you know there’s like a code cache up here and a data cache down there

so sometimes we might want to fetch data that we’ve already fetched before and we don’t want

to hit system ram so you know we don’t want that slow down so we’ll just take it from the cache

and um we will also populate the cache when we have a result so when this like all you is done

adding whatever it’s going to add it’ll send its result data to the data cache and then um

two or three or whatever then we can reuse the result in another instruction or send it back to

memory or do whatever we want to so this is like a basic idea right like you you start off by you

know grabbing something from memory possibly if it’s already in the cache then you wouldn’t

actually grab it and then the instruction decoder decides you know are we gonna we’re gonna jump

are we gonna go to the next instruction after this is over so it’ll have the next address

notice how there’s kind of like a little cycle that goes here between code cache instruction

decoder and instruction pointer and so you know we’re always kind of deciding what’s the next

instruction that we’re going to execute and then we like you know send the decoded instruction to

the control unit the control unit decides you know are you going to do some addition are we

going to use registers or not and then you know like are you not going to do anything or are maybe

you are going to do something in this case I’m just saying the floating point won’t do anything

integers. And then once that is all processed, you know, it comes to the data cache and, um,

well, we can, we can basically just, uh, you know, write it back to memory. I think this

diagram is not showing an arrow that will write it, write it back to memory. Um,

yeah, the code cache is definitely not going to feed directly into memory. That’s just a cache,

but you know, so, so imagine like there’s a, there’s like another wire here that goes

so when we have a result we can just write it into system ram

let me see if i forgot to say anything rip

yeah that’s basically all i wanted to say okay so now you have a fairly good idea of at least

one level deeper of what’s going on inside of your computer how the cpu in a general way loads

and all these little subunits getting told what to do

and the results getting piped back to the instruction pointer

and also to system RAM and so forth.

And it just keeps going like this again and again and again.

And also just remember that at certain points

during even one cycle, we wait for a clock tick.

I’m not gonna say exactly when we wait

because it’s kind of specific to what’s going on

to be on the scope of this video.

But yeah, the clock speed controls

how fast these cycles go.

And there’s much more advanced stuff

And there’s much more advanced stuff that you could learn later,

like pipelining and such to increase efficiency.

But this is a basic idea of how your computer works.

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,

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 know somebody subscribed or followed

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

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 and it’ll take you to my main

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

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 sweat and i’m like it would really it really mean the world to me i

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 How Your CPU Works: Fetch, Decode, Execute Explained appeared first on NeuralLantern.com.

Hey there! In this video, I’m diving into the world of logic gates – AND, OR, XOR, and NOT. We’ll break down how each gate works, draw them in ANSI style, and rig up a circuit to see how they turn inputs into logical outputs. I’ll walk you through truth tables and show you how to chain gates for cool results, all while keeping it real and relatable. Whether you’re new to digital logic or just want a refresher, this is for you. Got questions? Drop a comment! Subscribe to join the crew, and scan the QR code to check out my site for more tutorials. Let’s geek out together!

Introduction to Logic Gates 00:00:00
Overview of AND Gate 00:00:47
Overview of OR Gate 00:01:07
Overview of XOR Gate 00:01:24
Overview of NOT Gate 00:01:49
Drawing AND Gate 00:02:14
Drawing OR Gate 00:03:07
Drawing XOR Gate 00:04:12
Drawing NOT Gate 00:05:31
Building a Circuit 00:06:04
Combining Gates 00:07:21
Testing with All Zeros 00:09:56
Testing with All Ones 00:11:23
Testing with Random Inputs 00:12:32
Introduction to Truth Tables 00:15:00
Creating Truth Tables 00:16:03
Analyzing Circuit with Truth Tables 00:18:50
Hierarchical Truth Table Approach 00:20:04
Final Circuit Analysis 00:26:36
Conclusion and Call to Action 00:29:15

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

Okay, hey everybody! In this video I’m going to talk about logic gates. I’m going to show you

AND, OR, XOR, and NOT. We’re going to draw them in a diagram style and we’re going to rig up a

bunch against each other and see if we can figure out how they would process some input data into

you know some logical output.

Okay so for starters let’s just go over what the gates look like. If you don’t know how these gates

don’t know how these gates work check my previous videos because I’ve explained them there. Here I’m

just going to sort of try to draw them and make a little big a little circuit area that we can play

with. Okay so AND. Okay you know what you want me to I’ll just do a quick recap. The AND gate just

means that both bits have to be a 1 in order for a 1 2 output so if we do a 0 and a 0 and a 1 and

sorry one and a zero and a one and a one then only this one is going to end up being a one

everything else is going to be a zero for the logical or it’s going to be if we do zero zero

zero one one zero and one one and if this is too fast and confusing for you see my other videos

but basically it’s going to be a one for those three because if either of those bits are a one

then the output is going to be a one and the only place it’ll be a zero is when both of the bits are

Let’s look at XOR. So XOR is

Basically and it’s an OR except this one position right here where both bits are a one that would end up being a zero

So for XOR 0 0 0 1 1 0 1 1

It’s going to be a 0 and

Then a 1 and then a 1 and then a 0 so it’s just a little bit different from OR and then not just inverts the bits

so

bit at a time and it’s just a zero becomes a one and a one becomes a zero and that’s pretty much it

okay so maybe I should put not right here just to just to emphasize that I’m talking about not

okay I’m definitely not not talking about not sorry so let’s do uh let’s draw a logical or a

bitwise and gate it’s basically just kind of like this and then there’s a little flat ridge at the

end of it and it takes two inputs there are many different styles to draw these kinds of gates but

i’m going to use the ansi style i think for the most part so just keep in mind you know you can

draw these in many different ways it’s going to take two inputs imagine this is a little circuit

right here and it’s going to give you one output so if you imagine what we talked about before

we could send it two different bits and it will produce the output for us so if we give it a zero

for us. If we give it a 0 and a 1, it’s still going to output a 0. If we give it a 1 and a 0,

still a 0. If we give it a 1 and a 1, then finally it’ll actually give us a 1.

Okay, so that’s just the way that gate looks. And now I’m going to draw the next one.

Let’s draw the OR. So maybe I’ll put OR here. Whoops. Oh, I got to do that. OR. So the OR gate

kind of looks like the AND gate at least in the style that I’m drawing except the

the flat ridges is more curved like this so you know an AND gate I’ll draw it in

red just to remind you that this is not what we’re doing right now it’s you know

flat right where’s the OR gate it has a curve it’s like a crescent moon kind of

it still takes two inputs so I’m gonna do an input here and an input here and

it still has one output and so if we’re just gonna give it a zero and a zero it’s

give it a zero and a zero it’s going to output zero for us if we give it a zero

and a one it’s going to output a one if we give it a one and a zero it’ll still

output a one if we give it a one and a one it’ll still output a one okay that

was pretty easy let’s look at exclusive or so XOR XOR the XOR gate looks like

like the ore gate so i’m going to start by trying to draw an ore gate as best i can

which is not good oh god let me start over on that one let me try one more time and then i’ll just

give up okay do this and then i’ll say okay that was good enough and then it has another line right

here the line is supposed to be parallel to the uh the crescent moon you know the curved side but

and that way it sort of looks like the inputs are passing through

like the first line before they touch the actual ridge.

So that’s an exclusive or it also outputs one bit.

So just practicing, we’ll give it two zeros.

It’s going to output a zero because there’s no or involved in two zeros

or I guess there’s no orness to the two zeros.

If we give it a zero and a one, then that’s going to output a one

one input is a one if we give it a one and a zero same thing looks good because

one input was a one but then once we get to two inputs then it’s going to output

a zero because the exclusive or demands that only one of the bits is a one and

actually exactly one of the bits is a one to produce a one okay so then the

next thing that I can show you is a knot gate it’s sort of like a little triangle

are different drawing styles it takes only one input and then there’s like a little circle up

here on top and then it outputs at the top and so if we give it a zero it’s going to output a one

i guess i could draw it a second time since there’s only you know two things we can we can input to it

it’s going to give us a zero if we inputted a one into it so it just reverts it’s an inverter

helps you understand the basics of these types of gates. Now I’m going to try to make a bunch of

them see if I can come up with something interesting on the fly. I had problems with

the drawing system on my other computer so I didn’t really prepare an example. Hopefully this

is good you never know. I’m just going to draw an AND gate here and I’ll say that it takes two

inputs because that’s what it does and then right next to it maybe I’ll do an exclusive OR so I’ll

like an OR gate here, and then I’ll do the exclusive OR part of it, and I’ll give it

two inputs because that’s what they take.

And then next to that, maybe I’ll just do a regular OR.

We’ll say OR, just like that.

Oh, that’s awful.

Try one more time.

Just do this, and then say this.

Okay, that’s acceptable, sort of.

We’ll do two more inputs there.

And what else can I do?

What else can I do?

Should I do another exclusive or or an and?

What do you think?

Vote.

Just kidding.

I’m going to do an and right here.

So I’m kind of repeating one of the gates.

Let’s see.

And or X or not.

Yeah, that’s all I wanted to talk about.

Okay, so now we can combine them because remember these have an output.

But if we sort of use the outputs of two of the gates as input for another gate,

then we can you can we can sort of like chain uh our circuits to make something a little bit more

interesting so maybe here i’ll do an and i’ll say this is an and gate oh god that’s awful

one more time okay my text-to-speech engine who i’ve given the personality of mary poppins

is telling me that a door is open so i’ve got to close the door after this video anyway

video anyway um yeah I have like an LLM server uh in the other room and so now my home assistant

is a little bit smarter and sometimes she messes with me that’s a story for another video

so I’m combining the output of both of those gates and sticking them into an and

and then I can do the same thing here I think I drew those I think I drew it like way too high

I’m gonna run out of room let me try one more time put that there we’ll do an and gate

gate like that and then I’ll just maybe curve the wires so it seems like uh it makes more sense okay

and then maybe over here I’ll do uh I don’t know maybe this should be an or I’ll do an or gate

like that and then the inputs from the other ones go into the or gate

then these two can combine to one more so maybe I’ll do exclusive or

or I guess I’ll just put an or gate here and then I will that’s not that’s not

curvy enough is it I like my Alex might I like my XOR gates nice and curvy so

we’ll do this and then I’ll put another line under it and then we’ll connect

these two so we’ll do this okay so then finally we have like one bit that’s

one bit that’s going to come out at the top let’s use the knot gate might as well so i’m going to

connect this to a knot gate and put a little circle on top of it and then it will give us our

final output and maybe i’ll stick it here in green or something like that okay so there’s lots of

different uh input output combinations we could use uh let’s see for every input we have that’s

one bit so one two three four five six seven eight that’s eight bits that means i could draw out

256 possible input combinations, which I’m definitely not going to do in this video.

But let’s just do some random stuff.

Let’s start off with zeros just for fun.

So we’ll do a bunch of zeros here.

So if you sort of look at this diagram, we go, all right, what was that?

This and here, there’s two zeros.

It’s going to produce a one.

So I’m just going to put a one right here to remind me that a one is going to be the

output of that gate.

the OR gate here is going to also output a what am I doing why did I put a one a zero because zero

and zero is zero and then zero or zero is also zero so this is going to output a zero and then

this exclusive OR is also going to output a zero and then the end is zero so I just have zeros at

the next level then we look at the inputs here to this and that’s obviously going to be zero and

then we look at the OR here that’s obviously going to be zero and then those two go into the gate

that’s a little bit higher and it’s going to output a zero because exclusive

or needs at least, you know, it needs exactly one, uh, one.

So it kind of feels like it’s going to be a zero for the output, right?

Uh, you’d be wrong if you thought that because the knot is going to invert it.

The knot is going to take that zero and flip it to a one.

So if we do all zeros, the answer is actually going to be a one.

Okay.

Let’s reset this and try again.

So I’m going to just get rid of these greens here.

and then I’m going to do, maybe I should write the inputs in red so they’re more fun,

so they don’t feel like they’re blending too much in with the actual diagram.

Okay, so now I’m going to, let’s try all ones. Let’s see what happens if we do all ones.

So I’m going to do ones on every input. One, one, one, one, one, one, one. And so

if we look at this AND gate, it’s going to output a one because, well, a one and one is a one.

one is a one the or gate same thing because a one or one is a one and then do the same thing down

here for this and and then the exclusive or that’s going to be a zero because it wants exactly one

bit to be a one not both so it’s a little bit more interesting and then we go up one level this and

gate is going to output a zero because it wanted both of those uh inputs to be a one for it to

output a one and then for the or it’s also going to output a well it’s going to output a one again

both of those are ones and then if we look at the exclusive or oh that’s going to output a one this

time because exactly one of the inputs is a one then the not is going to invert it so the final

answer is going to be zero for this whole giant thing i want to say make sense and wait for

questions but i guess i can’t so let’s try another example i’m going to do maybe two examples with

totally random numbers and then i’m going to show you how to write a truth table that might help you

might help you work this out on paper or like a like a notepad if you don’t really want to draw

so let’s see um uh i guess i’m gonna like maybe take some of these and turn these into zeros

let’s see get rid of that make that a zero maybe like i don’t know i feel like i’m not random

enough okay one zero and then like a maybe like a zero here how about like a one there and a zero

How about like a one there and a zero there?

Just one, zero, one, zero, oh, one, oh, one.

That’s too much of a pattern.

Let me do, let me do a one, oh here, or a one and a one.

Okay.

That feels more random to me.

So looking at the AND gate, that’s going to output a zero.

The OR gate is going to output a one.

The exclusive OR is going to output a zero.

The AND is going to output a zero.

So we just got a one right there.

So this AND is going to output a zero again.

This OR is going to output a one.

And then the exclusive OR, it’s got enough to output a one.

it’s got enough to output a one so that’s nice and then its final output is going to be

a zero because we had to not that one nice okay let’s just i don’t know change a couple random

bits i’m going to change this well let me erase first and then i’m going to start changing random

bits i don’t even remember what that last bit was anymore i’m going to pretend it was a one

and then i’m going to change it to a zero and then i’m going to change this zero to a one

change this one to a zero and then I’ll change this this zero to a one not like exactly random

it’s human random sort of so let’s look at this the and is going to output a one and the exclusive

or is going to do a one and then the or is going to do a one and then the and is going to do zero

one and one zero okay I think I did it right so the or is going to do a one and then I think

what’s happening is I gotta adjust my penmanship style I still have to like lift up sooner so it

doesn’t change colors so then the end it’s going to output a one and then this exclusive or it’s

going to output a zero because it wants only one bit one input to be a one and then the not is

Okay, let’s look at the idea of using a truth table to make this a little bit easier to

solve if you’re just kind of doing this without drawing.

So I’m not going to clear this just yet.

I might have to clear it in a second.

The first thing that you should do when you’re making a truth table is, you know, I mean,

I guess you can style this however you want, but you kind of have to think of this hierarchically.

Like what’s the easiest thing to do?

You don’t want to start computing the thing at the very top because that depends on a

lot of other stuff that’s at the bottom.

So instead I’m going to look at the very bottom row of inputs because they’re the easiest to calculate.

So I’m going to do and, I’m going to say something and something.

I guess I’m just going to put and by itself.

Maybe I’ll put one for input.

So for the inputs, I’ll just do the bits here.

0 1 1 no okay let’s just use two inputs only because we’re looking at the lowest level here

yeah and we’ll make maybe like a separate row or separate table for that so we just have two

inputs per gate on the bottom row and so for the end it’s going to be a one right then for the 0 1

should just do this in numeric order. I’ll just do every possible combo because we don’t have that

many numbers. So we have four combos. This is like zero, one, two, three. So from zero to three or

four possible combos. And then the end is going to be a zero here and a zero there and a zero there.

So that’s a truth table that just handles that first gate. So then I’m just going to, you know,

write, I mean, you could make another truth table for this, but I’m going to try to write this in a

I’m going to try to write this in a more compact way.

I’m going to say the second column is the result of ending.

The next column is the result of oaring.

And then the last column is the result of,

maybe second to last is the result of an XOR.

And then maybe I’ll make another table for nodding.

So what is the result of an OR here?

It’s going to be a, whoops, a zero.

The OR here is going to be a one.

So when you start to make these tables,

it just makes it a little bit easier to work your way up because when it gets time to let’s say the

not you don’t have to compute all the other things because they’re already computed in the table so

we got the or which i should have probably done first because the second gate was an xor i should

have done that maybe third i don’t know i’m going to leave it as and and or right now and then we’re

going to do xor so xor is basically if exactly one bit is a one will output a one so that’s a one

so that’s a one there and then a one there and then a zero there okay so we’ve got the basics

and if you think about it that’s the whole bottom row right so if we’re just sort of looking at

let’s say the the third gate right here then uh we just have to look at input one one for the or

and then that’s this right here right there so that tells us what the answer would be truth table

for input zero one we just have to go all right zero one xor the output should be a one

and we can double check ourselves because it’s really really easy to make mistakes i’m sure

there’s a chance that i have or will make a mistake pretty soon

so we did and or an xor let’s do maybe just one for the knot just to remind ourselves of what it is

and i’ll just say not and so we can only do two different inputs on the uh on the knot so i’m

so I’m going to go maybe a zero and then a one right here and then the not is going to say we

have a one there and a zero there okay so now we can get a little bit more complicated

by combining these terms so for the input now we could do

we could do uh let’s say two gates at a time so we’ll do the input here and we’ll say the input

1, 0, 1.

And so when we not, when we not the, well, when we do an and for the 1, 1, we can end

up with a 1.

And then when we do an XOR on the 0, 1, then this is not the best truth table, to be honest.

I’m just trying to I’m just trying to do it the XOR is going to be a one so now we kind of have

the results written down here let’s do another little table and you know the way these tables

work is you kind of want to put every possible combination of inputs there but that alone is

going to be so many combinations I don’t want to write it all down and by the time we get to eight

bits it’s going to be like in the 200s so if we just look at the next pair of gates we’ll say

gates will say one one zero zero and the first thing is an or for the one one and

then the next thing is an and for the zero zero and so I can just write this

down and go all right the or is going to be a one and the end is going to be a

zero okay so then I can do another level I’ve pretty much just handled you know

the bottom row here and again each table is supposed to be filled out for every

combination of inputs but I can now just kind of move on to the next row I can say

what is the result of inputting a one and a one you could do that but it might be a little bit

better and closer to some other places that might want you to input this sort of thing

to write down what is the result of the or what is the what are the two gates that are giving you

Okay, so the first input on the very bottom left, that’s an and, right?

And then the next input on the bottom row is an XOR.

And if we’re trying to figure out, you know, how are we combining those?

We could say and XOR, or we can do, you know, two ampersands.

I guess I’m going to do and XOR, just to keep it in plain English as much as I possibly can.

So basically, this is going to have, you know, one result.

this is going to have, you know, one result, you know, one bit result and its input is going to be

a one, one, zero, one. And so maybe I should do another row here. We can say the end

for the end is going to, for one, one is going to be that. And the XOR is going to, well,

I already wrote that down in the table. Okay. I’m just going to, I’m just going to clean it up

because you know, it’s really good in these truth tables. If you write down all

truth tables if you write down all of the numbers, but I’m just going to do it this.

I’m just going to do it this.

Maybe we can visually see that there’s a one one going into the first end and then a zero

one going into the second gate, which is an XOR.

I think maybe that’s acceptable.

So the result of that, if we just sort of look up at this table here, we have, you know,

what is the end and what is the OR?

It’s a one and a one.

So if we end those two together, that should be a one.

that should be a one so that means if we end the and against an xor then that’s the result that we

get and then we’ll make another little table here for the next layer of inputs so i’ll just do this

and i’ll say

or and then the operator that combines them is an or and then on the right side it’s an and

The input to both of those is going to be a one, one, zero, zero.

And again, you should make another row for every possible combination of inputs.

That would be a really smart idea.

So then I will say that, uh, the, or in the end for a one, one and a zero,

zero is this because we already wrote that down in the truth table.

So really we’re going to be looking at inputs of one and zero.

So that means, uh, if we’re applying an, or to that,

applying an or to that, the final result should actually be one.

Okay.

So now we’ve got that second row.

We just have to look at the second to the last row.

So I’m going to go input for an X or of something else.

And the X or is going to be, oh gosh.

of an and

well xor let’s put that in the middle let’s say and on the left and or on the right and then we’ll

do an xor against them maybe you could put the parentheses on the other ones i don’t know i’m

struggling with notation clearly right now but so we say and exclusive or with the or but then what

Let’s put some more parentheses around it and we’ll say the and anded with an X or.

Now we’re running out of room here.

Can I get this like at the top maybe more?

How about that?

Okay, that’s a little bit better.

So we have and being anded against an X or and then I put parentheses around that.

There is a, there are special symbols you can use for this to make it more clear, but

for this to make it more clear, but I’m not really trying to explain that right now.

I just want you to see how the gates work.

So we have, then the next two operators are in, oh gosh, yeah, we’re XORing against two

things.

So on the right side, the OR is ORing and OR, and then on its right side is the AND.

So maybe I should do, I don’t know, I guess I’ll put parentheses right there to make it

seem a little bit more clear.

So now we’ve basically got an XOR and on its left side what’s happening underneath it is an

anding which is the middle of an and on the left and an XOR on the right and then the

the right side of the XOR is

then the the right side of the XOR that was my LL I’m talking to me again

on its left sorry it’s oaring on its on its right and then under the or it’s got an or on the left

and an and on the right okay so we’ve written all these down in a way that’s okay not great but okay

and i’m just going to do one one zero one one zero zero and then um i’ll make another video in the

future about truth tables if everyone is super interested but that’s that’s not really what i

I’ll make a video where the truth tables look proper and nice and full and all that stuff.

So let’s do, what is the answer between the, oh, I have to scroll up a little bit to see that.

So the left side of the XOR had an anding of an and and an XOR.

So that was this right here.

So the result of that was a one.

and an end and that was a one so I have two ones basically so this XOR is going to output

a zero because it’s it’s got two ones as an input or as inputs okay so then I guess I could copy

paste this to make it a little bit easier on myself to write it all out and I could just say

let’s not the whole entire thing to get to that highest level so I you know again I can just kind

I, you know, again, I can just kind of keep the whole thing copy pasted and you know,

the original input bit sequence, uh, I can just nod it.

I can just change that zero to a one.

So let’s just double check all our levels here to make sure that I did this correctly.

You never know.

So the input not, we know what that is for the end and the X or where’s the end and the

X or, okay.

So bottom left.

What did I do wrong?

Input.

Oh, that was, those were just the basics.

Okay.

So that’s not a combination.

Okay, so that’s not a combination.

Let me just double check the basics for the anding.

Zero and zero and zero and then zero and then one and then one.

And then here it should be a one and then the or should be one and should be zero.

And here the and should be one and the or should be one.

Okay, so I’ve got the basics, right?

And then on line 15 here, we’re looking at

an AND and an XOR. I guess I just did both of those at the same time. Okay, so the AND is a

1 and the XOR is a 1. And then the next one, the OR and the AND, it’s a 1 and a 0. Okay.

And then we’re ANDing the AND and the XOR. So that’s a 1, 1, 0, 1. The answer should be a 1.

That matches the diagram. Okay. And then the ORing of the OR and the AND on the right side,

the or and the and on the right side, that’s a one.

So that matches the diagram.

And then when we’re doing the whole thing, except for the knot,

it should be a zero at the top.

Okay, good.

And then finally, when we invert it at the very top, it’s a one.

So keep that in mind.

You can build and build and build in a hierarchical manner.

I mean, think if I started adding a bunch more stuff on top of this knot,

maybe if there were a bunch of other circuits somewhere else

and they were combining and combining like many layers.

This is the sort of thing that could help you.

Drawing, I think, is a little bit easier, but this could help you to just draw out a little table.

And of course, you want to have a giant table showing all combinations somewhere,

just to make sure that you can just look it up quickly.

But yeah.

Okay, so I think this is all I wanted to talk about.

Let me just double check.

All right.

So this is all I wanted to talk about for this video,

about logical gates and the basics and kind of helping yourself with a little bit of a table.

yourself with a little bit of a table. In future videos, I’ll talk about a proper table, perhaps.

And I hope you’ve learned a little bit and laughed a little bit at me struggling to do this on the

fly without a pre-made example. And I hope you had a little bit of fun and learned a little bit

of stuff. And I’ll see you in the next video. Thanks for watching. Hey, everybody. Thanks for

watching this video again from the bottom of my heart. I really appreciate it. I do hope you did

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?

It’s a 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

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 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.

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 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 wake up in a cold sweat and I’m like,

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 Logic Gates Crash Course: Learn AND, OR, XOR, NOT & Build Circuits appeared first on NeuralLantern.com.

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.

Ready to conquer binary scientific notation? Let’s make it fun and simple! In this video, I walk you through how to represent binary numbers with fractions in scientific notation—a must-know skill for computer science, programming, and understanding IEEE 754 floating-point representation. We start with the basics of scientific notation in decimal (think 8.54 × 10⁵), then dive into binary with clear, step-by-step examples. You’ll learn how to handle large and small binary numbers, move decimal points, and use base-2 like a champ. Whether you’re a student, coder, or just curious about how computers process numbers, this video has you covered!

I’ll show you practical examples, like converting huge binary numbers and tiny fractions, plus tips to avoid common mistakes (like mixing decimal and binary notation). By the end, you’ll be ready to tackle binary in IEEE 754 or impress your friends with your number-crunching skills. Subscribe for more tech tutorials, and hit that bell to stay updated! Visit my website (link below) for more resources, and leave a comment with your questions or video suggestions—I read every one! Let’s keep learning and having fun with tech together!

Introduction to Binary Scientific Notation 00:00:00
Purpose of Binary Representation 00:00:12
Overview of Scientific Notation 00:00:41
Rules for Scientific Notation 00:01:12
Decimal Scientific Notation Example 00:02:26
Practice with Large Decimal Number 00:04:12
Practice with Small Decimal Number 00:05:21
Binary Scientific Notation Concept 00:06:32
Binary Number Representation Rules 00:07:28
Large Binary Number Example 00:08:24
Small Binary Number Example 00:09:31
Mixing Binary and Decimal Notation 00:12:54
Pure Binary Scientific Notation 00:13:04
Connection to IEEE 754 00:13:48
Conclusion and Call to Action 00:14:21
Engagement and Website Promotion 00:15:32

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! Let’s talk about representing binary numbers with fractions in scientific notation.

Why would you need to do this? Probably the best use that I can think of off the top of my head

is being able to represent binary numbers with fractions inside your machine in a format known

It’s just a crucial step before you can represent numbers inside your machine using IEEE 754.

Okay, so first off, let me just show you a little bit here about scientific notation.

So you probably have seen something like this before where it’s like 8.3873,

and then you’ll see like a multiplier times 10 to the fifth power, right?

I can’t really type this out very well, so maybe I could just draw it for a second, you know.

well so maybe I could just draw it for a second you know 8.54 times 10 to the fifth power right

that’s what I’m trying to convey but anyway so about scientific notation itself it’s standardized

so that it’s easier to use and that is you know it’s just like faster for everyone to understand

and there’s less confusion part of the standard is that you always want to have a number on the

that is between 1 and 9 inclusive. You don’t ever actually want to have a 0 there that would be bad.

You don’t want to have a 10 or anything greater that would also be bad. You just want to have

1, 2, 3, 4, 5, 6, 7, 8, 9 on the left side. And then on the fractional side,

you want to have a number that just kind of like helps you represent the entire

original number without losing precision. And then on the right side, you want a number,

a number, let’s say like x to the y power, where x is the base of the number system you’re working

in. So this is decimal. The base for decimal is 10. So we’re going to say 10 to the something

power. What is the power? The power here helps you understand how big or small the number on

the left really is. That’s kind of one of the benefits of scientific notation. It seems to

help you understand a little bit more of how big or how small a number is rather than exactly

than exactly down to you know the last digit what what is the number precisely so we could say for

now it focuses more on largeness or smallness than preciseness what number are we actually

representing with this in scientific notation well times 10 to the fifth power just means move the

decimal point over a certain number of times so uh you know that’s why we have 10 to the something

go left or right in a base 10 number you’re looking at a different number that has a factor

of 10 for its strength in either direction like multiply by 10 multiply by 10 multiply by 10

or divide by 10 divide by 10 divide by 10 in the other direction so this means we want to move the

decimal point five times to the right to increase the strength of the number times five so one two

three four five if we put the decimal number there then this is the number we were going to represent

number we were going to represent originally so if somebody says hey give me this number 838730

and put it in scientific notation then you your first instinct is to say all right let’s uh type

that number out and we’ll put like a dot zero there and it will just we’ll move the decimal

point over until there’s only one digit um and it’s a you know somewhere between a one and a nine

three four five times over in order to get the decimal point there so that

means it’s going to be this times 10 to the fifth power because we moved it over

five times and you can see that’s the original number that I showed you these

zeros at the very end they don’t actually mean anything so we can omit

them probably a smarter idea to omit them and that’s why we see numbers that

way okay so keep that in mind there’s only one digit let’s maybe do like

practice number here I have a couple practice numbers written down already

let’s see so we’ll start with this number a huge gigantic number just to

practice if we copy paste this down to the next line and then we decide all

right how many times do we need to move the decimal point to get the decimal

point right there so that the two is the first number remember one to nine

inclusive so I’ll just I’ll use two decimal points so I can count more

9, 10, 11, 12, 13.

So that means I did 13 moves.

I’ll put 13 right here so I don’t forget.

Times 10 to the 13th power.

And the 13 is positive because when we’re looking at the scientifically notated format

of the same number, you know, 2 point something is way smaller than the original number.

So we want the scientifically notated format or form to get bigger in order to reach this

number.

in order to reach this number so that means 10 times sorry times 10 to a positive number positive

means it’ll be bigger in its original form okay so now let’s do another practice number

let’s do a number that’s really really really small like you’re inside of inner space or

something so we start up with this number and we still want to have a number between

rewrite it here I really want to have eight point something because that’s the first number that’s

bigger than zero that I can see so again I’m using two decimal points so that it’s easy for me to

count I’m going to go one two three four five six seven I had to move it seven times so it’s going

to be negative seven is going to be the exponent so you know raised something raised to the negative

seven it’s still going to be 10 to the negative seven that I multiply it by so then I’ll say get

And now this is the same number represented in scientific notation.

It should have all the same digits.

The decimal point basically should just be moved.

Of course, you know, when you represent in scientific notation,

depending on what standard you’re working with,

you might actually omit some of the numbers at the very end of the fraction here.

But that’s why we say this is kind of more to impress upon you the smallness or largeness of a number

rather than represent the number exactly precisely.

okay so we got that two practices in there how can we do this same exact concept in binary

well keep in mind in binary binary is a base two number this video is not about binary conversion

as a whole number or binary with fraction let’s just pretend that we already know how to do that

and we have a binary number to start off with so let me grab my example number here

have some kind of a binary number with a fraction, which you can do if you don’t understand how to do

this part yet from decimal with a fraction to binary with a fraction or back and forth.

See my other videos. For now, we’ll assume you can do this. So how can we get this in scientific

notation? So the first thing we have to understand is that it’s going to be, you know, some number

right because that was the format we used before the number should only start with a one it should

never even start with a zero remember in binary we can only use ones and zeros before i said here

let me just show you this real fast again before i said the starting number has to be one through

nine inclusive that was because in decimal we have zero one two three four five six seven eight nine

be only use you know one two three five six seven eight nine so but in binary um i’ll put like

a character set like the available characters we can use to represent the numbers in decimal

so in binary the care set that we can use is just you know a zero and a one only but the same rule

the one so that means the first number always has to be one it has to be always one dot something

for our purposes to represent the same number in scientific notation so it’s going to be

this and obviously that one has to be it it cannot ever be a zero so i’m going to put the

decimal point there uh and then i’m just going to count like how much did i actually move the

seven eight nine ten eleven twelve thirteen fourteen fifteen six just fifteen just fifteen not

sixteen so i’m going to put times something to the fifteen power and remove that other decimal

point and then the base is two so it’s going to be two to the fifteenth power

so now maybe i should move that up a little bit

gigantic number uh in scientific notation it’s going to look a little smaller but then the times

base to the 15th power is going to help us understand how big it is oh it’s like pretty big

let’s do the same thing backwards let’s say that we wanted to start off with a very very small

number so it’s like you know a zero point something in binary so you can imagine if this is like one

256 that’s probably going to be a number that’s no bigger than or just like slightly bigger than

256 so it’s going to be like kind of a small number right well we’ll do the same thing just

copy to another line and then make sure that the decimal point sits in a place where there’s always

a one at the start

and then just count the number of times you moved

number of times you moved the number oh I guess before we would have possibly

deleted numbers on the right if we were gonna reduce precision in this case

after we count the numbers we’re gonna remove everything to the left of the one

so that the one is in the first position and I’ll just go ahead and do it okay so

how many times do we move it one two three four five six seven eight that’s

eight times so I’m gonna put an eight there just to remind myself that there

will be an eight I’ll remove all the stuff at the beginning that doesn’t

all the stuff at the beginning that doesn’t matter anymore and it’s going to be times two because

that’s our base to the eighth power but the original number is a lot smaller than the

scientifically notated number looks so that means we have to put a negative eight because remember

when you say times let me just show you this on a calculator when we say let’s let’s go back to

fifth power then you know that we’re just basically adding four zeros right so

like we have five total zeros so we’re adding four zeros to the ten but if we

did to the negative five power we’re gonna be like dividing it by ten a bunch

of times so instead of multiplying it by ten for a total of five times we’re

gonna divide by ten so then the number gets really really really small so that

means when we say two to the negative eight power we’re gonna be dividing it

We’re going to be dividing it by two that many times.

And so we end up with a really, really, really small number.

Isn’t that what I kind of said?

Let’s see.

I mean, like, not exactly, but, you know, it’s like 0.003 and then some numbers after that.

Didn’t I say one divided by 256?

It’s 0.003 and then some numbers.

So this number is just a little bit bigger than 0.003.

Nine.

Let’s see how much bigger it is.

bigger it is point three six two five what

oh because i’m not i’m not including the the part on the left that we will multiply it by so if i

you know if i did some like binary up here and i was in binary mode then it would probably make

more sense it ended up being exactly the same exact number that’s why i was confused because

if we just type that part on the right side then it really is going to be one over 256.

Anyway, long story short, we have this number here, the fractional part, and then we’re

going to multiply it by two to the something power.

Notice something in particular that I’m doing, which is probably my mistake, but I kind of

like doing it this way.

Notice how the left part is in binary and the right part is in decimal.

There’s no number two in binary or no number eight in binary.

numbers like this to scientific notation so that you can convert a binary number to i triple e

floating point number this is as far as you really need to go but if you truly want to represent a

binary number in scientific notation then you should also convert all of the relevant parts

so how do we represent uh the number two in binary it’s going to be one zero how do we represent the

number eight in binary it’s going to be one two four eight it’s going to be that so uh you know

big number times 10 in binary is still the number two to the something power the negative 1000 in

binary power is going to be you know eight the negative eight power so this is great if you just

want to write an entire number in scientific notation but uh you know in probably my next

video when we talk about ieee 754 notation this is as far as you really need to go

eight number into a a whole number in binary and then putting that somewhere but so just

forget about this for now keep in mind this is how far you have to go if you want to go to ieee

if you only want to be in pure binary then this is what it would look like

okay that’s it uh i think that’s all the example i have for you today in this video thank you so

much for watching i hope you learned a little bit and had a little bit of fun 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, 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.

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 night just

subscribe and then I’ll just wake up I promise that’s what will happen also if

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 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

Thank you.

The post How to Master Binary Scientific Notation (with Fun Examples!) appeared first on NeuralLantern.com.

Struggling with converting decimal fractions to binary? In this fun, beginner-friendly tutorial, we dive into how to convert numbers like 45.8046875 to binary and back to decimal, step by step! Learn the multiplying-by-2 method, handle precision loss, and understand fractional binary representation. With real examples (0.126753, 0.84375), you’ll master this key computer science skill. Perfect for students, coders, or anyone curious about how computers store numbers. Subscribe for more tech tutorials, and let me know what you want to learn next! Visit [YourWebsiteLink] for more. #Binary #DecimalToBinary #ComputerScience #TechTutorials

Introduction to Decimal-Binary Conversion 00:00:00
Understanding Fractional Binary Numbers 00:00:15
Fractional Binary Representation Basics 00:01:00
Converting Decimal Fractions to Binary 00:04:06
Example: Converting 0.126753 to Binary 00:04:52
Precision Loss in Conversions 00:05:36
Example: Converting 0.84375 to Binary 00:09:57
Converting Binary Fractions to Decimal 00:14:22
Example: Converting Complex Number 45.8046875 00:16:48
Combining Whole and Fractional Parts 00:21:00
Conclusion and Verification 00:23:25
Outro and Community Engagement 00:24:16

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 how to convert decimal numbers with fractions into binary

numbers with fractions and vice versa.

So up to this point, if you’ve been watching my other videos, you probably know that you

can easily convert a decimal number to binary and binary to decimal if the decimal and binary

numbers but in order to progress towards IEEE 754 representation in other words

in order to eventually be able to represent binary numbers with fractions

like floats or doubles in the machine you have to start learning how to get

the fraction part of a decimal number into binary the way we’re going to do

it in this video it’s not actually going to be the final representation of how

your machine stores floating point numbers but it’s an important step on

on the way there. Without this step, you probably wouldn’t be able to do it.

So what am I talking about? I’m just going to open up this notepad real fast and just show you

that what I really mean is, suppose we have like a number 45 point blah, blah, blah, blah, blah,

right? So this is the whole part and this is the fractional part. Okay, no problem. Also in binary,

we have like a bunch of ones and zeros. This is a whole number, but we could put a decimal point

and then just start doing more numbers after the decimal point in order to represent a

in order to represent a fractional binary number.

Okay, so let’s see.

We know, hopefully at this point, if you watch my other videos,

that, I don’t know, I’m just going to put some random numbers here

and then like some more random numbers there.

And you know that the strength of each of these numbers

is sort of like increasing by powers of two on the left side, on the whole side.

So the strength of that first digit is one.

digit is one the next digit has a strength of two and then four and then eight and then 16 maybe i’ll

put the six up here and then 32 so three and two and then 64 and maybe i’ll do another digit i’ll

just put like a zero there and then you know the left most digit has a strength of 128 so basically

a 1 or a 0 for the actual binary number multiplied by its strength. So 1 times 1 is 1, add that to

0 times 2, add that to 1 times 4, and 0 times 8, and 1 times 16, and so forth, right? So hopefully

we know how to do that at this point. To do the same thing on the fractional side, maybe I won’t

put a decimal marker there, it’s really the same deal except as we go left, we were multiplying by

have more power more strength but as we go to the right past the decimal point they should have less

strength and we’ll just divide them by two so pretty much at this point let’s see we’ll have

one half will be the strength of this digit right here whoops one half so the strength that that

digit has is just one half the strength that the next digit has is going to be one fourth remember

1 4th remember you multiply sorry you divide by 2 each time whoops I’m getting lost oh man I

probably need to add some spaces because it’s starting to get pretty ugly so this digit has

a strength of 1 half this digit has a strength of 1 4th and then we’ll just say that the next one

has a strength of 1 8th and so forth we’ll just keep dividing by 2 each time so don’t forget that

don’t make the mistake of saying 1 4th or sorry don’t make the mistake of saying 1 half 1 3rd

one half, one third, one fourth.

Don’t increase the denominator by one.

You want to multiply, or sorry,

you want to divide by two each time.

Or if you want to say the word multiplication,

then you multiply by 0.5, I guess, if you want to.

I’m just going to write 1 16th

and then just be done with the divisions.

I hope you understand what I’m talking about.

We’re going to do some examples right now.

Okay, so let’s calculate.

Well, actually, let’s just, just to emphasize, just to make sure everybody understands, what

we would do to convert such a number from binary to decimal would basically be, you

know, compute the left side as if it were a whole number.

I’m going to put W for whole number.

And then separately convert the fractional part as if it were just, you know, zero point

something.

And then just combine the two things when you’re in decimal.

And you’ll do the same thing when converting a number from decimal to binary.

decimal to binary you convert the whole part first put that into ones and zeros then convert the fact

the fractional part into a fractional binary part and then just combine them across the decimal point

so let’s do an example let’s start with converting 0.126753 i don’t think that this number is going

to resolve easily it’s kind of like a good lesson here when you’re converting between binary and

there are always going to be some numbers in in in decimal that you can’t represent in binary

and vice versa there are always going to be some numbers in binary that you can’t represent in

decimal so it’s not that decimal or binary or you know superior or inferior i mean all technology

is pretty much running on binary so it can’t be that bad but um just keep that in mind some numbers

that you type randomly are just never going to resolve and you’ll have to give up at some point

have to give up at some point and say, well, we’re just going to call this a precision loss

because we just, we just have to like give up, especially if you only have so many bits

to put the fraction in. Okay. So what am I going to do? What’s the, what’s the basic algorithm

here? There are lots of different ways to do it. The way that I’m going to show you is just

multiplying by two. So if we take, you know, 0.126753 and we multiply it by two,

We end up with, let’s see, times 2.

Whoops, hello.

Oh, I got to do that.

Times 2.

We’re going to end up with a different number.

If the number is equal to or greater than 1,

then we will say that we have achieved a number of 1 for the converted binary number.

And if not, we’ll say we have achieved a number of 0.

If the number is 1, we’ll also subtract 1 from the remaining number here in decimal.

The result we have is just, what’s going on?

Oh, I somehow turned on my annotator.

Okay.

In this case, we just have, you know, this number right here.

It’s not greater than one or equal to one.

So I’m just going to say this gave us a binary number of zero.

And because it gave us a zero, we’re not actually going to change it at all.

We’re not going to subtract one from it.

We’re just going to leave it as is.

We will then multiply by two again.

by 2 again. So I’m just going to say, do it one more time. We’ll say this multiplied by 2,

and it’s going to be this number. Again, it did not exceed or equal 1, so the bit in that position

is going to be a 0, and we’ll just copy and carry it over just as is. Do it again, and we’ll say

Now we have a number that equals or exceeds one.

So we’ve achieved a one in the binary position.

So it’s going to be a one here.

Then we got to subtract one.

So we’re just going to be left with 0.014, 024 and whatever.

And then we just continue.

Maybe I’ll do it a couple more times,

but I’m going to give up because I don’t think

that this number will translate completely.

So I’m going to say multiply by two again,

and it’s going to give us,

hang on a second here.

What was that?

Hang on a second here. What was that? That was one. Oh, I forgot to subtract one. So I got to

subtract one. And then I’m going to multiply by two. Now we get this number right there.

This is not equal to or greater than one. So the bit is going to be zero.

And then that means the remaining number is just going to be the same thing.

We’ll do another. Actually, let me let me clean the calculator for a second here.

going to select this whole thing and just paste that and I’m going to say

multiplied by two that’s going to be that new number and I think you’re

starting to understand why I want to give up because we’ll just be kind of

doing this forever this might end up being an irrational number in binary I

don’t really know I haven’t gone that far but it’s definitely gonna take a long

time so I’m gonna give up and I’m just gonna say all right the final binary

number is gonna be 0.00100 and then just say maybe there’s some more stuff at

maybe there’s some more stuff at the end we’ll just call this a precision loss

you can see well maybe I should do one more number actually because it it’s kind of a mirror there’s

like two zeros and then a one and then two zeros on the other side let me multiply this by two

real fast just to show you without symmetry what would happen so I’m gonna multiply that by two

and it’s gonna be this number right here so that’s gonna be zero because it didn’t exceed

or meet one and so the number we have left over is just that okay so now

because there’s no symmetry you can see that the number is going to be point

zero zero one zero zero zero we go from top to bottom we don’t do any kind of

reversal like you might do with whole number binary conversion I don’t know

maybe it’ll be zero for a long long long long time and never or yeah they’ll

probably be some ones in there at least I don’t know if it’s ever going to

resolve you’ll know you’re finished when the

Here is a zero.

So again, I’m just going to give up on this because I don’t really know if it’s going to work.

Let’s do a number that I know is going to resolve.

I have this one prepared in advance.

So let’s do 0.84375.

Okay.

So how do we convert this?

Again, just multiply by two.

Every single time you meet or exceed one, then you’ll say that we have a one in the binary number.

binary number and then subtract one after that and if not we will say that

we have a zero in the binary position and then we won’t subtract one okay so

that number multiplied by two is going to be point one six eight seven five so

that’s definitely greater than or equal to one so I’m going to say we have a one

in the binary position and then the next number is going to be just be zero point

now we take that number 6875 you could also just you know in your calculator you could say minus

one and then we’ll multiply it by two to get the next bit the number is going to be 1.375 so i’m

going to write 1.375 here and then it’s greater than or equal to one so it’s going to be another

one here and then after we subtract one it’s going to be 375 no problem okay so let me just

And then multiply by 2 to get to the next bit position.

It’s going to be 0.75.

All right, so 0.75, that number is less than 1, so we have a 0 in that bit position.

We also don’t subtract anything because we had a 0 in that bit position.

Then we just multiply by 2 again.

Multiply by 2, now we have 1.5 because that’s greater than or equal to 1.

We have a 1 in that bit’s position, then we subtract 1.

one it’s just going to be 0.5 that should be pretty easy right because that’s that sounds

like there’s a one in a bit and then it’s just done after that so i’m going to do minus one

and then multiply by two again notice how that is exactly a one so it’s going to be 1.0

which means we have a one in the position because it is equal to or greater than one

and then uh well what we have left over is zero

Zero multiplied by two is going to be zero.

So that means if we kept doing this forever,

then all the numbers down here are just going to be zeros forever.

And I said in another video,

when you realize what’s going on with the zeros,

like where are they?

Are they on the left or the right?

When you’re converting a whole number from binary to decimal or decimal to binary,

the zeros would be on the left side.

So that’s why we would reverse

because if you just add infinity zeros on the left of a whole number,

you’re not changing the value.

number you’re not changing the value but if you added them to the right you’d be increasing the

value when it comes to the fractions the right side of the fraction won’t change the number for

example if we had you know one point and then some like random binary numbers if we just kept adding

zeros on the right side that’s not changing the value of the number because this is the fractional

part however if we started adding numbers on the left side then we would make the fractional part

smaller and smaller and smaller so that means the zeros have to be on the right side and you can see

and you can see here the right side is the bottom so that means we’re going to take these numbers

I’ll just put etc here just so you can see etc that means we’re going from top to bottom so the

final number is 0.11011 and then a bunch of zeros after that are just you know nothing

and that’s the final answer we now have 0.84375 is equal to binary that number and we’ll just say

that number and we’ll just say OB to to indicate that the following is a binary

number because again you could have a decimal number and then have like a

bunch of like ones and zeros in the fraction part I guess so to make sure

that the reader understands what they’re seeing you’ll say OB to indicate this is

a binary number on exams or quizzes if you’re out there doing this for an exam

or a quiz keep in mind you probably want to talk to professor to make sure that

ob is supposed to be part of your answer they might just want this it depends anyway so 0.11011

okay then let’s convert it back again let’s let’s convert this number to the original decimal number

there okay so how can we do that pretty much just start adding the fractions up so remember the

Remember, the first fraction that we see is going to be one half.

One half.

And the second fraction we see is going to be one fourth.

And then we just keep multiplying.

One fourth, one half.

Maybe I should write this in a notepad here.

We’ll see one half plus one fourth plus one eighth.

And some of these bits aren’t going to count.

Like, for instance, the one eighth, it’s not going to count towards the fraction.

But for me personally, if I forget to type one eighth,

I’m probably going to accidentally use it for the next position.

So I’m just going to type everything one at a time.

So let’s see, we have one, two, three, four, five, one, two, three, four.

So I got to do one more plus one 32nd and then multiply by the bits.

So say like, you know, one times that and then one times that and then zero times that

to basically, you know, cancel it out.

And then one times that and then one times that.

plug it all into the calculator

let’s see if I got that right

0.84375

so that’s how you convert

back from binary to decimal

pretty easy and then also

of course when you’re practicing this you want to try

with a bunch of different random numbers to start off with

you just want to be

careful again this process

could take forever if you have like

you know the wrong number that you

start with but I guess at least

at least when we’re converting from binary to decimal it’s going to end up resolving to something

uh it won’t necessarily be something that you can’t represent but you know if you start

up with a random number in decimal there’s a chance maybe it’s not going to work with binary

okay well you have to give up and call it a precision loss okay so then now let’s uh let’s

ask what if we had a complex number because we know how to do this now with just the fractional

now with just the fractional part but what if we had a number that was um a little bit more

difficult let’s say we have wait a minute you know for you know for 37 5.

oh i think i just accidentally did a totally different number than i wanted to on my plan

luckily i got the right answer okay

Anyway, what if we had a more complicated number?

Let’s see, 804, 6875.

Okay, so 804, 6875, but with a 45 in front of that.

Remember we said before that this is the whole part

and this is the fractional part,

and you just wanna do them separately

and then combine them afterwards.

So the whole part, let’s see, what is that gonna be?

I’m just gonna say that this is not a video

for whole number binary conversion.

This is just dealing with fractions.

just dealing with fractions. Find my other videos if you want to know how to convert the whole part,

but I’m going to say that 45 is just this number in binary. And you can double check real fast.

You can say 1 plus, here let’s do it again, let’s do it just to be sure. 1 plus not a 2 because

there’s a 0 there, and then we’ll say 4 plus 8 plus not a 16 because there’s a 0 there, and then

plus 32. Add that together, that’s 45. So the whole number part is pretty easy if you already know how

number part is pretty easy if you already know how binary conversion but now let’s convert point uh

zero eight zero point eight zero four whoops screenshot no thank you zero point eight oh four

six eight seven five so i’m gonna have to do this from scratch since this is a different number than

i just worked with we’ll do that multiplied by two and it’s going to be this number

is that really not the same number?

Yeah, I guess I really just did a different number.

Okay, so that means we’re going to have a 1 in the binary position

and the remaining fractional part is just going to be this.

Whoops, zero point that.

So then we take that number and bring it down.

Multiply it by 2.

Whoops, not supposed to actually bring that part down.

We’ll bring it into the calculator.

We’ll multiply it by 2.

actually let me get that again and subtract one just to double check myself it’s always good to

double check yourself then we’ll multiply this by two and then the number is going to be point

1.28 so we have that and then since it’s either equal to or greater than one it’s going to be

you know a one in the binary position so 0.21875 is going to be the remainder there

so I’m going to do minus 1 and then times 2 to make sure the calculator agrees with me whoops

21875 okay then I’ll do a multiply by 2 to get the next number 4 3 7 5

and that’s not equal to or greater than 1 so we’ll put a 0 there and we won’t subtract anything

so it’s just going to be 0.4375 again then we’ll multiply that by 2 to get the next number

times two it’s going to be 0.875 so 0.875 again this is not one or greater so we have zero in

the binary position and we don’t subtract anything 0.875 multiply by two again times two so it’s

going to be 1.75 1.75 and then of course we’ll have a one in the binary position and the leftover

0.75 so let me just go back to the calculator and I’ll say minus 1 times 2 it’ll give us 1.5

so 1.5 over here means we’ll have a 1 in the binary position because it was equal to or greater

than 1 the leftover is going to be 0.5 now you know we’re about to finish because 0.5 times 2

is just going to be 1.0 which will give us a 1 for the binary part and then the remainder is going

remainder is going to be 0.0 and then you know there’s no need to multiply 0 by 2 because it is

forever going to just be zeros uh maybe i’ll just write it out one more time just so you know 000

right remember that so that means of course the zeros are on the right side of the fractional

part and on the left side is going to be 0.110011

1100111 and then now we just have to combine those two numbers so maybe just I’ll put something

here indicating that this is the conversion of just that number like that now we’ll combine

both of those parts right so 45 was this so I’ll say maybe therefore this big number right here

combine this number for 45 and then I’ll just put a decimal point and then I’ll put the fractional

part on the right side and then let me just double check my work real fast it should be

10110111 wait wait what no no 101101 and then 1100111 okay so that’s it we’ve converted

converted a complicated decimal number into binary.

And we can do it in the reverse, just using the same thing.

You know, step one, convert this number into a whole number of decimal.

And then step two, convert this number into a whole number,

sorry, a just only fractional number for decimal

by just getting the one half plus one fourth and so forth.

put them around a decimal point just for practice okay I’ll go ahead and do it

some of you are probably like why won’t you do it I’ll do it okay so just only

looking at the fractional part because that this is not a video to convert

whole numbers in binary and decimal but just to convert the fractional part only

I’m gonna do let’s see say whoops whoops whoops whoops whoops whoops maybe I need

Okay, so starting with just this one right here,

it’s going to be 1 half plus 1 fourth plus not 1 eighth, not 1 16th, a 32.

1 32 plus 1 over 64 plus 1 over 128.

0.8046875.

So it looks like we succeeded.

Okay, so now we know how to convert

a decimal number with a fraction

into a binary number with a fraction.

And we also know how to convert

a binary number with a fraction

to a decimal number with a fraction.

That feels like a long video.

Let’s see what it is after I cut this.

Thank you so much for watching.

I hope you learned a little bit of stuff

and you had a little bit of fun.

I will see you in the next video.

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.

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 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.

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

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 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 Fractions to Binary (and Back!) – Easy Step-by-Step Guide appeared first on NeuralLantern.com.

Hey there! Struggling with binary to hex conversions? This video makes it SUPER easy—no math required! Learn to convert between binary and hexadecimal with simple patterns you’ll memorize in no time. Perfect for computer science students, coders, or anyone curious about how computers work. Subscribe for more tutorials, and scan the QR code to visit my site for extra resources. Drop a comment with your questions or video ideas! #Binary #Hex #ComputerScience #Coding

Introduction to Binary and Hex Conversion 00:00:00
Why Convert Between Binary and Hex 00:00:13
Recap of Number Systems 00:00:41
Binary Base Two System 00:01:01
Hexadecimal Base Sixteen System 00:01:24
Benefits of Hexadecimal 00:02:06
Simplifying Binary-Hex Conversion 00:03:04
Four Bits Equal One Hex Digit 00:04:32
Memorizing Binary-Hex Patterns 00:05:13
Creating a Binary-Hex Conversion Table 00:06:26
Converting Hex to Binary Example 00:08:52
Understanding Nibbles and Bytes 00:10:44
Converting Binary to Hex Example 00:13:19
Conclusion and Verification 00:15:38
Call to Subscribe and Engage 00:16:20

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

Hi there! Let’s talk about converting back and forth between binary and hexadecimal.

Why would you want to do that? Well, maybe you’re in computer science. Maybe you’ve been presented

with some numbers that you need to convert. Maybe you have like a bunch of ones and zeros.

Maybe you have like an ox and then something that looks really weird. It’s got some letters in it,

but it’s also got some numbers. And you’re trying to figure out what are these? What are we trying

we try to convert back and forth between.

You should have watched my other videos by now,

which will teach you how to convert back and forth

between both of these number bases and decimal.

So you can understand what they are

in just normal human terms.

But as a quick recap, decimal is a base 10 number system

because we have 10 possible characters that we can use.

We can say zero, one, two, three, four,

five, six, seven, eight, nine.

So that’s 10 total characters, zero through nine.

We also have binary, which is what computers use, which is a base two system.

It’s base two because the only characters you have available are just zero and one.

So base two, two characters.

You can represent a number between zero and one in a single digit.

Then we have hexadecimal, which is a way to represent a number in a more compact way.

system there because we have 16 possible characters we have 0 1 2 3 4 5 6 7 8 9

just like decimal but then we add more numbers we had like six numbers we say

a b c d e f and what happens is the a has a strength of 10 whereas the you know

the 9 just to its left had a strength of 9 the a has a strength of 10 the b has a

of 11 the c has a strength of 12 and the d has a strength of 13 and the e has a strength of 14

and the f has a strength of 15 and so you know we just have more characters that we can use in one

single digit which means we can rent we can represent the same number in decimal but just

we can represent it smaller if we use hexadecimal so it’s kind of useful when you’re working with

looking at bits in binary or hex and not necessarily decimal because binary as

you’re going to learn in this video gives you kind of a good idea just by

looking at it after you’ve practiced a little while gives you a good idea of

what hex numbers you would be seeing if you were looking at the same number and

vice versa if you’re looking at hex numbers if you look at them a lot in

your daily life you’ll start to kind of like see through the matrix and you’ll

And if you’re interested in finding what bits are on and off,

it’s convenient to be able to look at a hexadecimal number

and kind of intuitively know,

okay, those bits are probably like on and off.

Those bits are all on, you know, whatever.

So this is the basics of number basis.

Here’s a trick.

In all my other videos,

when we converted back and forth

between decimal and binary and hex and all that stuff,

we used multiplication, we used division,

you know, we messed with the numbers quite a bit.

the great thing about binary and hex conversions is you don’t even really need to do math.

Maybe a little math at first while you’re learning, but eventually when you get used to it,

you start to realize you can memorize short patterns. Let me bring your attention to the

fact that in hexadecimal, you have 16 possible combinations, or you can represent a number

you can do the same thing in four characters if I had four characters right

here in binary very quickly you could do the calculation in your head if you’ve

watched my other videos you can see well that one counts for a one and this one

counts for a two and this one counts for a four and this one counts for an eight

if I want to know what the maximum value is that I could represent with four

digits I just take the the top numbers strength multiply it by two and then

strength multiply it by 2 and then subtract 1. So if we have 1, 2, 4, 8, I’ll just multiply 8 by 2,

that’s 16, and then subtract 1, that’s 15. So I can represent a number between 0 and 15 with 4

binary digits. But I just said you could do that with one hexadecimal digit, right?

So that means one hexadecimal digit is actually four binary digits. And if you just memorize

16 combinations of numbers, which is not like that hard.

And even if you don’t memorize them all,

I don’t have them all memorized.

It’s really easy to convert in your head

a four digit binary number to decimal

and then convert that back to hexadecimal pretty fast,

hexadecimal.

So what’s the equivalent of 1111?

Well, we know it’s the highest possible value

with just one hexadecimal digit.

So that would have to be an F.

So you can memorize already

You can memorize already a couple of really, really easy combinations.

We could say, let me say zero binary, OB to say that we’re looking at binary is equal

to zero X F. So just the letter F in hex.

Remember that we like to prefix different base number systems to give the reader a reminder

of what base they’re looking at.

one i’m going to say that 000 in binary is just zero in hex if i didn’t put that prefix how would

you know if you’re looking at hex or binary or decimal it would be even more confusing if you

had like you know one two zero is that hex one two zero or is that uh decimal one two zero i guess it

can’t be binary one two zero but if we did one one zero now it could be binary or hex or decimal so

i’m just going to put uh zero b for binary and i’m going to say it’s zero so that’s two of the

of the 16 total possible combinations that we would memorize.

So let’s iterate through all the combinations.

Just for the sake of making this table more compact,

actually, let me start a new little notepad page here.

I’m going to omit those prefixes because those are a good idea,

but while we’re doing our lookups, they’re a little irritating.

So I’m going to take them out.

So I’m going to say 0001.

Let me say this.

So I’m just going to count from 0 to 15 in binary.

to 15 in binary.

So this is going to be one, one,

and then zero and then zero, one, zero, one, zero, one,

I don’t know, that’s a lot of copy pasting.

Let me just double check here that I’m doing this right.

I should have 16 lines.

I don’t, so I’ve done something wrong.

Let’s see.

So this is like 0, 1, 2, 3, and this is 4.

This is 5, and then 6, and then 7, and this is 8.

Oh, I have that twice.

Okay, 8.

And then since I copy pasted the bottom part,

I think I can probably assume that’s okay.

One, two, three, four, five, six, seven.

That was kind of spooky.

I guess a lesson learned is that relying on a battery pack

or a light that’s gonna stay on for many hours

is probably a dumb idea.

Anyway, continuing, we have this table here.

We have like 16 possible combinations.

So now I’m gonna map these to hexadecimal digits.

uh you know like 10 are going to be really easy right it’s just going to be zero and then one

and then two you can make a vertical table if you want for yourself I’m just doing it this way

because it’s easier the way that I’m typing in this notepad the way that I’m typing in this

notepad so I’m going to do seven eight nine and then when we get to 10 let me just double check

10. So this is eight plus two. So that means this is indeed a 10 and oh, 10 in hex, not a decimal.

So that’s a and then B and then C and then D and then E and then F. Okay. So now that we have this

little table set up, you know, if you want to write it horizontally, that’s fine. It’s actually

binary and hex now imagine we have a gigantic hex number zero x and then i’m just going to do like a

bunch of numbers and then i’m going to do change some of these to like letters just to make things

more interesting a b c d e did i use any d e f e b i didn’t use a b oh there we go and i’ll put like

another aid in there okay so this is huge and this would take like a while to calculate right

to calculate right if you were going to convert it to decimal for hex to binary conversion it’s

actually pretty easy you literally just go b what is b b is that so b is just that you don’t even

have to do any math let me copy paste this down here so i can show you a really easy way to do

D is this right here.

So I’m going to say the D is that.

And then the 6 is that pattern right there.

So move you over.

1, 2, 3, 4, 1, 2, 3, 4, 1, 2, 3, 4, 1, 2, 3, 4, 1, 2, 3, 4, 1, 2, 3, 4, 1, 2, 3, 4.

Maybe that’ll line up later, hopefully.

So the 1 is pretty easy.

Probably didn’t even need to copy-paste that.

I could have just looked at it and typed.

looked at it and typed the E is going to be that and the seven is going to be that

and the two is going to be this eight see what I’m doing I’m literally just

copy pasting the bit patterns if you don’t have copy paste when you’re doing your conversion

that’s okay you can at least write down zeros and ones really fast if it’s just

you know four at a time I should also point out that um you know this is pretty important to

good term that people like to use. Four bytes or one hexadecimal digit, it’s called a nibble.

So usually you’re used to seeing eight bytes in a row and you call that, sorry,

usually you’re used to seeing eight bits in a row and you call that a byte or two hex digits in a

row and you call that a byte. If you just see four bits or one hex digit, that’s a nibble.

Two nibbles make a byte. Try to remember that. So we have this giant thing here.

we have literally now successfully converted binary.

I’m going to put, I’m just going to put OB here

and then remove all the spaces.

This is the binary number that we originally had

in hexadecimal.

So again, just to emphasize, these are the two same numbers.

They’re just represented differently.

Differently.

Let me punch this into my personal calculator

to make sure that I gave you the right walkthrough

so I don’t have to correct in a video later.

so expression X result binary oh god I can’t even I can’t even read that okay

so let me let me do it backwards I’m gonna copy paste this one in there okay

so let’s see X okay so it’s telling me that supposed to get to B and then a D6

728fac. Okay, so I did it. And this is also a good reminder that you kind of want to pair off

into groups of one byte at least. So, you know, each two characters, that’s one byte. One character

by itself is a nibble. So you want to pair off into bytes. And notice how this b is all by itself.

So you want to pad to the left with a zero so that you’re just kind of working with bytes.

It’s easier on the eyes and the brain. And you’ll usually see something like this

output from a program or something. In fact, you might see something like this representing,

here’s a word, or you might see something like this showing that this is like a D word or,

you know, like a 32 bit number. And if we wanted to say, oh, this is a 64 bit system. So let’s

look at 64 bits. Let’s look at eight bytes. Then we’ll just like pad it with, let’s see, one, two,

that’s one, two, three, we’ll pad it with a bunch more zeros. One, two, three, four, five, six,

So this is a proper 64-bit number or an 8-byte number that works with modern systems,

whether you have the space in there or not.

And so I’m not going to do another example from hex to binary.

Let’s do a quick example from binary to hex.

It should be just as easy.

So I’m going to start a new tab here and just copy-paste the table that I made.

Let’s make a bunch of random numbers for binary.

And so now we’ve got like a bunch of numbers.

All we have to do is I’m going to copy paste this so I don’t ruin the original thing that

I wrote down.

And I’m just going to break it up into groups of four, starting from the least powerful

digits, you know, like all the way on the right.

So I’m going to go doop, doop.

Okay.

So after breaking it into groups of four, you can see that the, you know, the most powerful

digit there is a one all by its lonesome.

I could put 000 to make sure that they’re all groups of four bits. I don’t really have to because

I could still kind of understand just by looking at the one that it’s going to end up being a one

and then literally just translate it the same way I did before. Okay that’s a 1.

1 0 1 0 that’s an A. What’s a thousand and one? It is a nine. What’s a 0 100?

what’s one oh one oh a what’s a thousand and one didn’t i just do that that’s a nine

what’s a zero zero oh ten that’s going to be a two for sure yeah two i finally got one off the

top of my head one zero one one that’s a b and then uh basically 15 minus eight i don’t really

want to work that out of my head right now so i’m gonna look at the table seven okay i guess i

should have done that easy right like how fast was that so i’m just going to copy paste these

put an ox in front of it and maybe bunch them into groups of two first to see what’s up

okay so they’re not in groups of two that means this one is kind of i should have started grouping

them on the right side kind of messed it up someone just you know rearrange the grouping

Let me punch this into my personal calculator to make sure that I got this right. Actually, let me do this original number here

I must say

This binary number is supposed to be

1 a 9 4 a 9 2 b 7. Okay, we did it

Really easy, right? So every time you have to convert back and forth between binary and hex

It’s your lucky day because that’s like one of the easiest conversions you could do

Thanks for watching this video. I hope you learned a little bit of stuff and had some fun

I’ll see you in the next video.

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

And I just subscribe and then I’ll just wake up. I promise that’s what will happen

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 uh uh clarifications or errata or just future videos

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 coming for us all

Thank you.

The post Binary to Hex Conversion Made EASY! No Math Needed! 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.