Computer Science

  • Preemptive vs. Cooperative scheduling

    In an operation system, multitasking refers to the ability to execute multiple tasks concurrently; there are primarily two different types of multitasking: preemptive and cooperative. These methods are used by […]

  • Understanding two’s complement

    Have you ever wondered why, in Java and other languages, one byte can only represent to as the maximum value and why cannot we have . There is indeed a […]

  • Dijkstra’s algorithm to find the shortest path

    Let’s imagine you and your best friend live quite far apart, you haven’t seen him for a while, your best friend is organizing a party at his house and you’re […]

  • An Introduction to Term Frequency – Inverse Document Frequency (tf-idf)

    tf-idf is one of the most fundamental concepts in information retrieval. It’s the product of 2 statistics, the term frequency (tf), which is the numeric value representing how many times […]

  • Covariance and Contravariance (Java)

    Many programming languages support subtyping, for example, MechanicalKeyboard can be a subtype of Keyboard, and according to the Liskov substitution principle, the MechanicalKeyboard instance should be substitutable everywhere the Keyboard […]

  • Demystifying the blockchain concept – In simple English

    In recent years, the concept of cryptocurrency and blockchain become more and more prevalent. Everyone may have heard about a cryptocurrency named Bitcoin or something like blockchain. With your curiosity, […]

  • The Algorithm Design Manual – 2nd Edition (free download)

    Besides Introduction to Algorithms, The Algorithm Design Manual is another great book in the Competitive Programming community. The Algorithm Design Manual provides straightforward access to combinatorial algorithms technology, stressing design over-analysis. This […]

  • Boosting your coding skills to the next level with these 8 awesome coding sites

    If you follow my blog for a while, recently my articles are all about algorithms, why do I do that instead of spending time to write some tutorials about JavaScript […]

  • A Quick Introduction of the Top Data Structures for Your Programming Career & Next Coding Interview

    Niklaus Wirth, a Swiss computer scientist, wrote a book in 1976 titled Algorithms + Data Structures = Programs. 40+ years later, that equation still holds true. That’s why software engineering candidates […]

  • Graph and its representation

    Graph Description In this article, we will learn about what is a Graph and also its representation in computer science. After reading this article, you’ll be able to understand what […]

Every support is much appreciated ❤️

Buy Me a Coffee