#basecs

What is Git? Git is an open-source Distributed Version Control System (DVCS). Created in...

Background I’ve been wanting to make a game for a long time now… suffice to say I have occasionally...

"In computer science, pointer swizzling is the conversion of references based on name or position to...

"Your theory that the sun is the centre of the solar system, and the Earth is a ball which rotates a...

This article explains the network socket in an easy way Definition A socket is one endpo...

Applying the theory of graphs into practice

Jump right into the building blocks of graph theory, and discover how we can identify a graph by its different kinds of edges.

We'll start by learning about recursion, the strategy for implementing DFS, and investigate the time complexity of the algorithm.

We'll learn the basics of the DFS algorithm, and see how to interact with a single node when traversing through a tree.

We'll learn about what it means to search through a tree, and see how the order of traversal through a tree can change the way that we visit every node in the data structure.

We learn how to represent one number in three different number systems—base 2, base 10, and base 16—and see how they compare to one another.

Today's episode of BaseCS explores a very special number in computing: 256!