BTEC Level 3 Nationals in Computing - Unit 1: Principles of Computer Science

These flashcards cover key concepts and terminology from the BTEC Level 3 Nationals in Computing, focusing on the principles of computer science.

Decomposition

The process of breaking down a complex problem into smaller, more manageable parts.

Pattern recognition

Identifying common elements or features in problems to solve them more efficiently.

Abstraction

The act of filtering out unnecessary details to focus on essential features of a problem.

Algorithm

A step-by-step strategy or procedure to solve a specific problem.

Pseudocode

An informal way of programming that uses structured English to describe algorithms without strict syntax.

Flowchart

A diagram that represents the flow of an algorithm or process, using various symbols to denote steps.

Control structures

Blocks of code that control the flow of execution based on conditions (e.g., IF, WHILE, FOR).

Variable

A named storage location in a program that can hold different values during the program's execution.

Array

A collection of elements, all of the same type, stored in a contiguous memory location.

Object-oriented programming (OOP)

A programming paradigm based on the concept of 'objects', which contain data and methods.

Inheritance

A mechanism in OOP that allows one class to inherit attributes and methods from another class.

Encapsulation

The bundling of data and methods that operate on the data within one unit, often a class.

Polymorphism

The ability in OOP for a method to do different things based on the object it is acting on.

Event-driven programming

A programming paradigm where the flow of the program is determined by events such as user actions.

API (Application Programming Interface)

A set of functions and procedures allowing the creation of applications that access features of an operating system or service.

Client-side scripting

Scripts that run in the user's browser to provide immediate feedback and interaction.

Server-side scripting

Scripts that run on the server and generate dynamic content sent to the client's browser.

Linear search

A search algorithm that checks each element in a list sequentially until the desired element is found.

Binary search

A search algorithm that finds the position of a target value within a sorted array by dividing the search interval in half.

Sorting algorithms

Methods for arranging data in a specific order (e.g., Bubble sort, Quick sort, Insertion sort).

Data validation

The process of ensuring that input data is correct and within the desired range before processing.

Stack

A data structure that follows the Last In, First Out (LIFO) principle.

Queue

A data structure that follows the First In, First Out (FIFO) principle.

Recursion

A programming technique where a function calls itself directly or indirectly.