## ALL of Wikipedia in One QR Code?

Good morning John. This is a QR code. It’s a way of visually representing data, just like barcodes, or snapcodes, or facial expressions, or the written word. And I was looking at one of these things recently and I thought to myself: how much data could you really fit on a QR code? Well, QR […]

## 009 – Convert Decimal to Binary (Base 10 to Base 2)

So how do we convert numbers from decimal to binary. So if I have a number like 45 in decimal, how do I convert that to binary? Well, there is a way of doing it that you might like, you might prefer. And so– you might not. We can say, how many times does 2 […]

## Randomized algorithms lecture #2 – birthday paradox, random shuffle, hashing

Welcome to the second part of the randomized algorithms lecture! If you haven’t seen the 1st part, the link is in the description! 1st problem, Catch ’em all! When you enounter a Pokemon, it’s a random out of N types, How many Pokemon will you encounter (on average) before seeing all N types? The statement […]

## Derivative formulas through geometry | Essence of calculus, chapter 3

Now that we’ve seen what a derivative means, and what it has to do with rates of change. Our next step is to learn how to actually compute these guys, as in if I give you some kind of function with an explicit formula you’d want to be able to find what the formula for […]

## Can you solve the wizard standoff riddle? – Dan Finkel

You’ve been chosen as a champion to represent your wizarding house in a deadly duel against two rival magic schools. Your opponents are fearsome. From the Newt-niz school, a powerful sorcerer wields a wand that can turn people into fish, but his spell only works 70% of the time. And from the Leib-ton school, an […]

## 012 – Two’s Complement – Part 1

The answer to the question, just in case you were wondering, ‘It’s tricky to rock a rhyme, to rock a rhyme that’s right on time, it’s tricky.’ there you go. Just in case you were wondering. OK. So what do we have left? Well, what about this situation? I get a negative 25 in decimal. […]

## Graph Theory: Nearest Neighbor Algorithm (NNA)

– WELCOME TO A LESSON ON THE NEAREST NEIGHBOR ALGORITHM THAT CAN BE USED WHEN ATTEMPTING TO FIND THE OPTIMAL HAMILTONIAN CIRCUIT. UNFORTUNATELY NO ONE HAS FOUND AN EFFICIENT AND OPTIMAL ALGORITHM TO SOLVE THE TRAVELING SALESPERSON PROBLEM. IT SEEMS UNLIKELY ANYONE EVER WILL. IF YOU WERE ABLE TO SOLVE THE TSP PROBLEM, YOU WOULD […]

## Randomized algorithms lecture #1 – probability, repeating a process

When the problem statement describes some random process or, it’s guaranteed that the input to our program will be generated randomly uniformly at random. It’s obvious then that we should use some properties of that. It’s less obvious that we should use randomized algorithms, where the statement is normal and only in the solution, we […]

## Graph Theory: Dijkstra’s Algorithm

– WELCOME TO A LESSON ON DIJKSTRA’S ALGORITHM. WHEN YOU VISIT A WEBSITE LIKE GOOGLE MAPS OR USE YOUR SMART PHONE FOR DRIVING DIRECTIONS YOU’RE USUALLY LOOKING FOR A SHORTEST PATH BETWEEN TWO LOCATIONS. THESE COMPUTER APPLICATIONS USE REPRESENTATIONS OF THE STREET MAPS AS GRAPHS, WITH THE ESTIMATED DRIVING TIMES AS EDGE WEIGHTS. OFTEN IT […]

## Scheduling: The Decreasing Time Algorithm

– WELCOME TO A LESSON ON THE DECREASING TIME ALGORITHM. IN THIS LESSON WE WILL APPLY THE DECREASING TIME ALGORITHM TO DETERMINE A PRIORITY LIST AND THEN CREATE A SCHEDULE USING THE LIST PROCESSING ALGORITHM. IN OUR PREVIOUS EXAMPLES WE WERE GIVEN THE PRIORITY LIST, BUT NOW WE’LL LOOK AT A METHOD OF CREATING A […]