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
Code Optimization
Posted inCompiler Design

Code Optimization

Posted by admin July 20, 2021
Optimization is a program transformation technique, which tries to improve the code by making it…
Read More
Peephole Optimization
Posted inCompiler Design

Peephole Optimization

Posted by admin July 20, 2021
1 Eliminating Redundant Loads and Stores 2 Eliminating Unreachable Code 3 Flow-of-Control Optimizations 4 Algebraic…
Read More
Issues in the Design of a Code Generator
Posted inCompiler Design

Issues in the Design of a Code Generator

Posted by admin July 20, 2021
Β 1 Input to the Code Generator 2 The Target Program 3 Instruction Selection 4 Register…
Read More
Code Generation
Posted inCompiler Design

Code Generation

Posted by admin July 20, 2021
Code generation can be considered as the final phase of compilation. Through post code generation,…
Read More
Access to Nonlocal Data on the Stack
Posted inCompiler Design

Access to Nonlocal Data on the Stack

Posted by admin July 20, 2021
1 Data Access Without Nested Procedures 2 Issues With Nested Procedures 3 A Language With…
Read More
Stack Allocation of Space
Posted inCompiler Design

Stack Allocation of Space

Posted by admin July 20, 2021
1 Activation Trees 2 Activation Records 3 Calling Sequences 4 Variable-Length Data on the Stack…
Read More
Storage Organization
Posted inCompiler Design

Storage Organization

Posted by admin July 20, 2021
From the perspective of the compiler writer, the executing target program runs in its own…
Read More
Translation of Expressions
Posted inCompiler Design

Translation of Expressions

Posted by admin July 20, 2021
Β 1 Operations Within Expressions Β 2 Incremental Translation Β 3 Addressing Array Elements Β 4 Translation of Array…
Read More
Declarations
Posted inCompiler Design

Declarations

Posted by admin July 20, 2021
When we encounter declarations, we need to lay out storage for the declared variables. For…
Read More
YACC
Posted inCompiler Design

YACC

Posted by admin July 20, 2021
YACC stands forΒ Yet Another Compiler Compiler. YACC provides a tool to produce a parser for…
Read More

Posts pagination

Previous page 1 … 14 15 16 17 18 … 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