MIT 6.033 (Computer System Engineering) covers 4 parts: Operating Systems, Networking, Distributed Systems, and Security.

This is the course note for Part I: Operating Systems. And in this section, we mainly focus on:

• How common design patterns in computer system — such as abstraction and modularity — are used to limit complexity.
• How operating systems use virtualization and abstraction to enforce modularity.

Read More

Today, let's talk about Linked List algorithms that are frequently used.

A Linked List is a data structure that stores data into a series of connected nodes, and thus it can be dynamically allocated. For each node, it contains 2 fields: the val that stores data, and the next that points to the next node.

Read More

Hi there, todaly let's talk about Servlet in a nutshell.

A Servlet is a Java programming language class, which is executed in Web Server and responsible for dynamic content generation in a portable way.

Servlet extends the capabilities of servers that host applications accessed by means of a request-response programming model.

Read More

Hello!

Today, let's talk about signing a git commit with GPG, an encryption engine for signing and signature verification.

When it comes to work across the Internet, it's recommended that we add a cryptographic signature to our commit, which provides some sort of assurance that a commit is originated from us, rather than from an impersonator.

Read More

Hi!

Let's read the Chapter 01: Reliable, Scalable, and Maintainable Applications of Designing Data-Intensive Applications.

It introduces the terminology and approach that we are going to use throughout the book, and it also explores some fundamental ways of thinking about data-intensive applications: general properties (nonfunctional requirements) such as reliability, scalability, and maintainability.

Read More

Hi there, let's talk about how to nonrecursively do a In-Order traversal for a Binary Tree.

A Binary Tree consists of 3 parts: the node itself, pointer to the left child, pointer to the right child.

An In-Order Traversal is to access the leftmost child firstly, then the node itself, and finally the right child.

Read More

Hello World!

This is my first blog post. Today, let's talk about writing a Markdown blog with Hugo, and eventually deploying it on GitHub Pages.

Hugo is a static HTML and CSS website generator, which allows us to concentrate on the contents rather than the layout tricks.

Read More