Computer Science

Intermediate

Computer science is the study of computation, information, and automation. At its core, it investigates what problems can be solved algorithmically, how efficiently they can be solved, and how to represent and manipulate data to accomplish useful tasks. The discipline spans theoretical foundations such as the theory of computation and formal languages, which explore the mathematical limits of what computers can and cannot do, alongside practical domains like algorithm design, data structures, and software engineering that turn abstract ideas into working systems used by billions of people every day.

The field encompasses an extraordinarily broad range of subdomains. Data structures and algorithms form the backbone of efficient software, enabling everything from search engines to social networks. Operating systems manage hardware resources and provide the platform on which applications run. Computer networking connects devices across the globe, while database systems organize and retrieve vast amounts of information. Artificial intelligence and machine learning have emerged as transformative areas, enabling computers to recognize speech, translate languages, drive vehicles, and generate creative content by learning patterns from data rather than following explicit instructions.

Software engineering applies disciplined engineering principles to the design, development, testing, and maintenance of software systems. Combined with areas like cybersecurity, human-computer interaction, and distributed computing, computer science touches virtually every aspect of modern life. Whether you are interested in building mobile applications, designing intelligent systems, analyzing massive datasets, or understanding the theoretical limits of computation, computer science provides the conceptual tools and practical skills to shape the future of technology.

Practice a little. See where you stand.

Ready to practice?5 minutes. No pressure.

Take the Quiz Learn First

Quiz

Reveal what you know — and what needs work

Adaptive Learn

Responds to how you reason, with real-time hints

Start here

Flashcards

Build recall through spaced, active review

Cheat Sheet

The essentials at a glance — exam-ready

Glossary

Master the vocabulary that unlocks understanding

Learning Roadmap

A structured path from foundations to mastery

Book

Deep-dive guide with worked examples

Key Concepts

An algorithm is a finite, well-defined sequence of instructions for solving a problem or performing a computation. Algorithms are the heart of computer science and can be analyzed for their correctness, efficiency, and resource usage. Common categories include sorting algorithms, search algorithms, graph algorithms, and dynamic programming approaches.

Example

Binary search is an algorithm that finds a target value in a sorted array by repeatedly halving the search space. It runs in $O(\log n)$ time, compared to $O(n)$ for a linear search.

A data structure is a specialized format for organizing, storing, and accessing data efficiently. Choosing the right data structure is critical because it directly affects the performance of algorithms that operate on the data. Common data structures include arrays, linked lists, stacks, queues, hash tables, trees, and graphs.

Example

A hash table (or hash map) stores key-value pairs and provides average-case $O(1)$ lookup time. Python dictionaries and JavaScript objects are implemented using hash tables.

Big O notation is a mathematical notation used to describe the upper bound of an algorithm's time or space complexity as the input size grows. It abstracts away constant factors and lower-order terms to focus on the dominant growth rate, allowing developers to compare algorithms and predict scalability.

Example

An algorithm that checks every pair of elements in a list has $O(n^2)$ complexity. Merge sort has $O(n \log n)$ complexity, making it far more efficient for large datasets than bubble sort's $O(n^2)$.

Object-oriented programming (OOP) is a programming paradigm based on the concept of objects, which bundle data (attributes) and behavior (methods) together. OOP relies on four key principles: encapsulation, abstraction, inheritance, and polymorphism. These principles promote modular, reusable, and maintainable code.

Example

In a game, you might define a base class Character with attributes like health and methods like attack(), then create subclasses Warrior and Mage that inherit from Character but override attack() with specialized behavior.

Recursion is a technique where a function calls itself to solve smaller instances of the same problem until it reaches a base case. It is a natural fit for problems that have a self-similar structure, such as tree traversal, factorial computation, and divide-and-conquer algorithms. Every recursive solution must have at least one base case to prevent infinite recursion.

Example

The factorial function: $n! = n \cdot (n-1)!$, with base case $0! = 1$. So $5! = 5 \cdot 4 \cdot 3 \cdot 2 \cdot 1 = 120$.

A database is an organized collection of structured data managed by a database management system (DBMS). Relational databases use tables with rows and columns and are queried using SQL, while NoSQL databases use flexible schemas such as documents, key-value pairs, or graphs. Databases ensure data integrity, support concurrent access, and enable efficient querying of large datasets.

Example

A relational database for an e-commerce site might have a Customers table and an Orders table linked by a foreign key customer_id, allowing a SQL query like SELECT * FROM Orders WHERE customer_id = 42.

An operating system (OS) is software that manages computer hardware and provides services for application programs. It handles process scheduling, memory management, file systems, device drivers, and security. The OS acts as an intermediary between users and hardware, enabling multiple programs to run concurrently and share resources safely.

Example

When you open multiple browser tabs and a music player simultaneously, the operating system's scheduler allocates CPU time to each process and the memory manager ensures they do not overwrite each other's data.

Computer networking is the practice of connecting computers and devices to share resources and communicate. Networks operate using layered protocol models such as TCP/IP, where each layer handles a specific responsibility from physical transmission to application-level communication. Key concepts include IP addressing, routing, DNS, HTTP, and encryption.

Example

When you visit a website, your browser uses DNS to resolve the domain name to an IP address, establishes a TCP connection, sends an HTTP request, and receives the HTML response, all happening in milliseconds.

Machine learning is a subfield of artificial intelligence where systems learn patterns from data rather than being explicitly programmed. Supervised learning uses labeled training data to make predictions, unsupervised learning finds hidden structure in unlabeled data, and reinforcement learning trains agents through trial-and-error with rewards. Models are evaluated on their ability to generalize to unseen data.

Example

A spam filter trained with supervised learning analyzes thousands of labeled emails (spam vs. not spam) and learns features like keyword frequency and sender reputation to classify new incoming emails.

Software engineering is the systematic application of engineering principles to the design, development, testing, deployment, and maintenance of software. It encompasses methodologies like Agile and Waterfall, practices such as version control, code review, and continuous integration, and architectural patterns that help teams build reliable, scalable systems. The goal is to produce high-quality software efficiently and predictably.

Example

A development team using Agile methodology works in two-week sprints, writing user stories, implementing features in branches, reviewing pull requests, running automated tests via CI/CD, and deploying to production incrementally.

One concept at a time.

Explore your way

Choose a different way to engage with this topic — no grading, just richer thinking.

Explore your way — choose one:

Explore with AI →

Curriculum alignment— Standards-aligned

Grade level

Grades 9-12College+Adult / Professional

Learning objectives

•Identify the foundational concepts of computer science including algorithms, data structures, and computational complexity
•Apply algorithmic problem-solving strategies including divide-and-conquer, dynamic programming, and graph traversal
•Analyze the time and space complexity of algorithms to select efficient solutions for computational problems
•Design software systems that integrate appropriate data structures, algorithms, and architectural patterns for scalability

Recommended Resources

This page contains affiliate links. We may earn a commission at no extra cost to you.

Books

Introduction to Algorithms

by Thomas H. Cormen, Charles E. Leiserson, Ronald L. Rivest, Clifford Stein

Structure and Interpretation of Computer Programs

by Harold Abelson, Gerald Jay Sussman

Clean Code: A Handbook of Agile Software Craftsmanship

by Robert C. Martin

Computer Science: An Overview

by J. Glenn Brookshear, Dennis Brylow

Courses

CS50: Introduction to Computer Science

edXEnroll

Algorithms Specialization

CourseraEnroll

My Progress Focus Mode

Tech & Computing

Software Engineering

The systematic application of engineering principles to software design, development, testing, and maintenance, encompassing methodologies like Agile, design patterns, DevOps, and quality assurance practices.

Intermediate

Tech & Computing

Artificial Intelligence

Artificial Intelligence is the field of computer science focused on building systems that can perform tasks requiring human-like intelligence, including learning, reasoning, perception, and decision-making.

Intermediate

Tech & Computing

Data Science

An interdisciplinary field combining statistics, programming, and machine learning to extract insights and build predictive models from data for real-world decision-making.

Intermediate

Tech & Computing

Machine Learning

Machine learning is a subfield of artificial intelligence focused on building systems that learn from data to make predictions and decisions, encompassing techniques from simple regression models to complex deep neural networks.

Advanced

Tech & Computing

Cybersecurity

The practice of protecting systems, networks, and data from digital attacks, covering threat analysis, defense strategies, encryption, and incident response.

Intermediate

STEM & Engineering

Mathematics

The study of numbers, quantities, shapes, and patterns using logical reasoning and abstract structures, serving as the foundational language of science and technology.

Intermediate

Computer Science

Quiz

Adaptive Learn

Flashcards

Cheat Sheet

Glossary

Learning Roadmap

Book

Key Concepts

Algorithms

Data Structures

Big O Notation

Object-Oriented Programming

Recursion

Databases

Operating Systems

Computer Networking

Machine Learning Basics

Software Engineering

Explore your way

Grade level

Learning objectives

Recommended Resources

Books

Introduction to Algorithms

Structure and Interpretation of Computer Programs

Clean Code: A Handbook of Agile Software Craftsmanship

Computer Science: An Overview

Courses

CS50: Introduction to Computer Science

Algorithms Specialization

Related Topics

Software Engineering

Artificial Intelligence

Data Science

Machine Learning

Cybersecurity

Mathematics