StudyBrixFree worksheets, study guides and courses

Computer science · Grades 9–12

Advanced computing concepts

20 key concepts, retrieval questions and a learning checkpoint.

Make a worksheet

Start here

An algorithm’s complexity describes growth, not its exact runtime on every computer. Binary search requires an appropriate ordered collection.

Build your vocabulary

Binary search

A search that repeatedly halves an ordered search interval.

Linear search

A search that examines elements sequentially until a match or the end.

Recursion

A technique in which a function solves a problem using calls to itself on smaller cases.

Base case

A condition that stops recursive expansion.

Stack

A collection commonly operated with last-in, first-out access.

Queue

A collection commonly operated with first-in, first-out access.

Hash table

A data structure that uses a hash function to locate storage associated with keys.

Time complexity

A description of how an algorithm's operation count grows with input size.

Space complexity

A description of how memory use grows with input size.

Abstraction

Focusing on relevant features while hiding unnecessary implementation details.

Encapsulation

Grouping related state and behaviour behind a defined interface.

Database

An organized collection of data managed for access and updates.

Primary key

A field or field combination that uniquely identifies a relational-table row.

Foreign key

A field or field combination that refers to a key in a related table.

Normalization

Organizing relational data to reduce certain redundancies and update anomalies.

Packet

A formatted unit of data transmitted through a network.

Protocol

An agreed set of rules for communication or interaction.

Encryption

Transforming data into a form readable only with the appropriate key or method.

Authentication

Checking that an entity is who or what it claims to be.

Authorization

Determining which actions an authenticated or identified entity is permitted to perform.

Test your recall

  1. Advanced computing concepts: which term fits this description? A search that repeatedly halves an ordered search interval.

    1. Binary search
    2. Stack
    3. Encapsulation
    4. Time complexity

  2. Advanced computing concepts: which term fits this description? A search that examines elements sequentially until a match or the end.

    1. Normalization
    2. Linear search
    3. Time complexity
    4. Binary search

  3. Advanced computing concepts: which term fits this description? A technique in which a function solves a problem using calls to itself on smaller cases.

    1. Primary key
    2. Encapsulation
    3. Stack
    4. Recursion

Check and explain

Answers and marking notes
  1. Binary search

    Binary search: A search that repeatedly halves an ordered search interval.

  2. Linear search

    Linear search: A search that examines elements sequentially until a match or the end.

  3. Recursion

    Recursion: A technique in which a function solves a problem using calls to itself on smaller cases.

Learning preview · teacher review required. Grade bands are approximate, not official curriculum alignment.