Mediaspace scheduled maintenance: Aug 25, 2026 07:00 - 12:00 AM. During this time, videos will be temporarily unavailable. Check status updates.

Lecture

Introduction to Conditional Statements

Description

This lecture is the second part of the course, where the instructor guides you through using conditional statements to make your programs interactive in Scratch. You will learn how to handle bugs and develop strategies to solve problems while creating an interactive story.

Official source

Related concepts (13)

Time complexity

In computer science, the time complexity is the computational complexity that describes the amount of computer time it takes to run an algorithm. Time complexity is commonly estimated by counting the number of elementary operations performed by the algorithm, supposing that each elementary operation takes a fixed amount of time to perform. Thus, the amount of time taken and the number of elementary operations performed by the algorithm are taken to be related by a constant factor.

Computational complexity

In computer science, the computational complexity or simply complexity of an algorithm is the amount of resources required to run it. Particular focus is given to computation time (generally measured by the number of needed elementary operations) and memory storage requirements. The complexity of a problem is the complexity of the best algorithms that allow solving the problem. The study of the complexity of explicitly given algorithms is called analysis of algorithms, while the study of the complexity of problems is called computational complexity theory.

Randomized algorithm

A randomized algorithm is an algorithm that employs a degree of randomness as part of its logic or procedure. The algorithm typically uses uniformly random bits as an auxiliary input to guide its behavior, in the hope of achieving good performance in the "average case" over all possible choices of random determined by the random bits; thus either the running time, or the output (or both) are random variables.

Computational complexity theory

In theoretical computer science and mathematics, computational complexity theory focuses on classifying computational problems according to their resource usage, and relating these classes to each other. A computational problem is a task solved by a computer. A computation problem is solvable by mechanical application of mathematical steps, such as an algorithm. A problem is regarded as inherently difficult if its solution requires significant resources, whatever the algorithm used.

Parameterized complexity

In computer science, parameterized complexity is a branch of computational complexity theory that focuses on classifying computational problems according to their inherent difficulty with respect to multiple parameters of the input or output. The complexity of a problem is then measured as a function of those parameters. This allows the classification of NP-hard problems on a finer scale than in the classical setting, where the complexity of a problem is only measured as a function of the number of bits in the input.

Related lectures (45)

Algorithmic Complexity: Travel Time Analysis

Covers algorithmic complexity and travel time analysis, focusing on measuring the time taken by algorithms and evaluating their performance.

Algorithmic Complexity: Definition and Examples

Explores algorithm correctness, worst-case complexity analysis, and efficiency comparison based on input size.

Complexity of Algorithms: Big-O Notation

Explores algorithm complexity, big-O notation, induction, recursion, and analysis of running times, covering NP problems and complexity classes.

Complexity of Algorithms

Explores algorithm complexity, analyzing efficiency and worst-case scenarios of sorting algorithms.

Complexity of Algorithms: Growth of Functions