Skip to content
  • facebook.com
  • twitter.com
  • t.me
  • instagram.com
  • youtube.com

Basic Computer Science

Learn the Foundations. Understand the Science Behind Computing.

Subscribe
  • Home
  • Online Tools
  • Basic Computer Science app
Posted inFeatured

๐Ÿง  How Skip Lists Provide Fast Searching Without Complex Balanced Trees

Posted by admin August 27, 2026
Continue Reading
Posted inFeatured

๐ŸŒณ How Tries Make Autocomplete and Dictionary Search Extremely Fast

Posted by admin August 27, 2026
Continue Reading
Posted inFeatured

๐ŸŒณ How B-Trees Help Databases Search Millions of Records Efficiently

Posted by admin August 26, 2026
Continue Reading
Posted inFeatured

๐ŸŒธ How Bloom Filters Quickly Check Whether Data Probably Exists

Posted by admin August 25, 2026
Continue Reading
Posted inFeatured

๐Ÿง  How Dynamic Programming Solves Complex Problems by Reusing Previous Results

Posted by admin August 25, 2026
Continue Reading
Posted inFeatured

๐Ÿ—บ๏ธ How Graph Algorithms Find the Best Route Between Connected Points

Posted by admin August 24, 2026
Continue Reading
Most Popular Post
Posted inFeatured

๐Ÿง  How Skip Lists Provide Fast Searching Without Complex Balanced Trees

Posted inFeatured

๐ŸŒณ How Tries Make Autocomplete and Dictionary Search Extremely Fast

Posted inFeatured

๐ŸŒณ How B-Trees Help Databases Search Millions of Records Efficiently

Posted inFeatured

๐ŸŒธ How Bloom Filters Quickly Check Whether Data Probably Exists

Editor's Choice
Posted inFeatured

๐Ÿง  How Skip Lists Provide Fast Searching Without Complex Balanced Trees

Posted by admin August 27, 2026
Posted inFeatured

๐ŸŒณ How Tries Make Autocomplete and Dictionary Search Extremely Fast

Posted by admin August 27, 2026
Posted inFeatured

๐ŸŒณ How B-Trees Help Databases Search Millions of Records Efficiently

Posted by admin August 26, 2026
Posted inFeatured

๐ŸŒธ How Bloom Filters Quickly Check Whether Data Probably Exists

Posted by admin August 25, 2026
Speeding Up The Traveling Salesman Using Dynamic Programming
Posted inAdvanced

Speeding Up The Traveling Salesman Using Dynamic Programming

Posted by admin July 20, 2021
Alarge part of what makes computer science hard is that it can be hard to…
Read More
A token of my affection (for my parser)
Posted inAdvanced

A token of my affection (for my parser)

Posted by admin July 20, 2021
If ambiguity is the root of all parse tree evil, then clarity is clearly the…
Read More
Parsing expressions like itโ€™s our job
Posted inAdvanced

Parsing expressions like itโ€™s our job

Posted by admin July 20, 2021
Okay, so we now know how to diagram and parse an English language sentence. But…
Read More
Grammatically Rooting Oneself With Parse Trees
Posted inAdvanced

Grammatically Rooting Oneself With Parse Trees

Posted by admin July 20, 2021
Thinking about all of the abstractions that surround us in the world of technology can…
Read More
Evaluating the important parts
Posted inAdvanced

Evaluating the important parts

Posted by admin July 20, 2021
Once weโ€™ve finished scanning our source text and identified our lexemes, weโ€™ll need to do…
Read More
Reading Code Right, With Some Help From The Lexer
Posted inAdvanced

Reading Code Right, With Some Help From The Lexer

Posted by admin July 20, 2021
Software is all about logic. Programming has garnered a reputation of being a field that…
Read More
Anatomy of an AST
Posted inAdvanced

Anatomy of an AST

Posted by admin July 20, 2021
Now that we know that the abstract syntax tree is important (but not necessarily intimidating!),…
Read More
Condensing one tree into another
Posted inAdvanced

Condensing one tree into another

Posted by admin July 20, 2021
Okay, so now we have two trees to keep straight in our heads. We already…
Read More
Leveling Up Oneโ€™s Parsing Game With ASTs
Posted inAdvanced

Leveling Up Oneโ€™s Parsing Game With ASTs

Posted by admin July 20, 2021
Before I started on this journey of trying to learn computer science, there were certain…
Read More
Two translators, both alike in dignity
Posted inAdvanced

Two translators, both alike in dignity

Posted by admin July 20, 2021
The differences between interpretation and compilation and their respective translators tells us a lot about…
Read More

Posts pagination

Previous page 1 … 25 26 27 28 29 … 40 Next page

Recent Posts

  • ๐Ÿง  How Skip Lists Provide Fast Searching Without Complex Balanced Trees
  • ๐ŸŒณ How Tries Make Autocomplete and Dictionary Search Extremely Fast
  • ๐ŸŒณ How B-Trees Help Databases Search Millions of Records Efficiently
  • ๐ŸŒธ How Bloom Filters Quickly Check Whether Data Probably Exists
  • ๐Ÿง  How Dynamic Programming Solves Complex Problems by Reusing Previous Results

Recent Comments

No comments to show.

Archives

  • August 2026
  • June 2025
  • April 2025
  • March 2025
  • February 2025
  • August 2023
  • January 2022
  • November 2021
  • October 2021
  • July 2021

Categories

  • Advanced
  • Algorithms
  • Artificial Intelligence
  • Basics
  • Cloud Computing
  • Compiler Design
  • Computer Hardware
  • Cyber Security
  • Distributed Systems
  • Featured
  • Internet Programming
  • Mobile Computing
  • Networking
  • Programming
  • Tech Reviews
  • Technology & Innovation
  • Uncategorized
You May Have Missed
Posted inFeatured

๐Ÿง  How Skip Lists Provide Fast Searching Without Complex Balanced Trees

Posted by admin August 27, 2026
Posted inFeatured

๐ŸŒณ How Tries Make Autocomplete and Dictionary Search Extremely Fast

Posted by admin August 27, 2026
Posted inFeatured

๐ŸŒณ How B-Trees Help Databases Search Millions of Records Efficiently

Posted by admin August 26, 2026
Posted inFeatured

๐ŸŒธ How Bloom Filters Quickly Check Whether Data Probably Exists

Posted by admin August 25, 2026
Copyright 2026 — Basic Computer Science. All rights reserved. Bloghash WordPress Theme
Scroll to Top