The code we humans write cannot be read by computers – it must be translated into machine code. Compilers and interpreters do that, and the browser is an interpreter!
This is the first in a potentially long series about browser mechanics, in my own words. Read on to learn about one of the first steps a browser takes: decoding bytes to Unicode code points.
Want to learn how a browser works? Computer Science fundamentals? This is a great place to start! A long list of resources for my research for my talk at CSSConf EU, the Algorithms of CSS.
My 2017 Year In Review post ended up morphing into a longer article, so for now, here are some goals and plans for 2018. They can be boiled down to WordPress, Computer Science studies, and writing.
Stacks and queues are quite similar in that they are both linear and abstract data structures (meaning they describe the behavior of a different data structure, like a linked list or array). All the action in terms of adding and removing items happens at their ends, and their main difference is in which end that adding/removing happens.
Day 2 of Data Structures...let's talk about trees! What is a binary tree versus a binary search tree? Isn't the DOM a tree? All of this and more!
Linked lists are very similar to arrays in that they are a one-dimensional list of elements. Unlike arrays, however, in a linked list, you cannot just jump to index 4, you have to walk through the list, starting with the "head", or the first element in the list, and work your way through to the fourth element. They are very useful for lists where you need to add/remove elements, but not so useful if you need to search elements.