Big Idea 3 - Algorithms and Programming

Question 1

Algorithm

Answer 1

A step-by-step procedure or set of rules for solving a specific problem or accomplishing a task within a finite number of steps.

Question 2

Application Program Interface (API)

Answer 2

A set of rules and protocols that allow different software applications to communicate with each other. It specifies how certain tasks can be performed, what data formats are accepted, and what responses are expected.

Question 3

Arguments

Answer 3

Values that are passed into a function when it is called. They allow us to provide input to the function and customize its behavior.

Question 4

Binary Search

Answer 4

An efficient algorithm used to find a specific value in a sorted list by repeatedly dividing the search space in half.

Question 5

Boolean value

Answer 5

A data type that can only have two possible values - true or false. It is often used in programming to make decisions and control the flow of a program.

Question 6

Data Abstraction

Answer 6

Refers to the process of simplifying complex real-world entities into manageable representations by focusing on their essential characteristics while hiding unnecessary details.

Question 7

Efficiency

Answer 7

Refers to how well a program or algorithm utilizes resources, such as time and memory. It measures the ability of a program to accomplish its task with minimal wasted resources.

Question 8

Heuristic

Answer 8

A problem-solving approach or algorithm that uses practical rules or guidelines to find a solution, even if it may not be the most optimal or guaranteed to be correct.

Question 9

Index

Answer 9

A data structure that allows for efficient searching and retrieval of specific values within a larger collection of data.

Question 10

Linear/Sequential Search

Answer 10

An algorithm used to find the position/index of an element within an unordered list by checking each element one by one until the desired element is found or all elements have been checked.

Question 11

Lists

Answer 11

Ordered collections of items in computer programming. They allow you to store multiple values under one variable name and access them using their position or index.

Question 12

MOD operator

Answer 12

A mathematical operation that returns the remainder when one number is divided by another.

Question 13

Modularity

Answer 13

An approach where complex systems are divided into smaller modules or components that can be developed independently but work together as part of the larger system.

Question 14

Nested Conditional Statements

Answer 14

Refer to the practice of placing one conditional statement inside another. This allows for more complex decision-making in a program by evaluating multiple conditions.

Question 15

Problem Instance

Answer 15

Refers to a specific example or input of a problem that needs to be solved. It includes all the necessary information and data required to find a solution.

Question 16

Procedural Abstraction

Answer 16

Refers to breaking down complex tasks into smaller, more manageable procedures or functions. It helps in organizing code and making it easier to understand and maintain.

Question 17

Procedures

Answer 17

Reusable blocks of code that perform specific tasks when called. They help organize code into smaller sections for better readability and maintainability.

Question 18

Pseudocode

Answer 18

A simplified programming language that uses plain English to outline the logic of a program. It helps programmers plan and organize their code before writing it in an actual programming language.

Question 19

Selection Statements

Answer 19

Used in programming to make decisions based on certain conditions. They allow the program to choose between different paths of execution depending on whether a condition is true or false.

Question 20

Sequencing

Answer 20

Refers to the order in which code statements are executed. It determines the flow of a program, with each statement being executed one after another.

Question 21

Simulation

Answer 21

Refers to the process of creating a model or representation of a real-world system or phenomenon on a computer. It allows users to observe and analyze the behavior of the system under different conditions without actually interacting with the real thing.

Question 22

Software Library

Answer 22

A collection of pre-written code and resources that can be used by developers to add specific functionality to their own programs. It provides reusable components and functions that save time and effort in coding.

Question 23

String Concatenation

Answer 23

Refers to combining two or more strings together to create a new string.

Question 24

Substring

Answer 24

A smaller portion of a larger string extracted based on its starting and ending positions within that string.

Question 25

Traverse

Answer 25

Means to go through each element or item in a collection, such as an array or linked list, and perform some operation on each item.

Question 26

Variables

Answer 26

Containers that hold values or data in a computer program. They can store different types of information such as numbers, text, or boolean values.

Question 27

While Loops

Answer 27

A type of control structure in programming that allows a set of instructions to be repeated as long as a certain condition is true.

Question 28

Arrays

Answer 28

A data structure that stores a fixed-size sequence of elements of the same type. They allow for efficient storage and retrieval of multiple values using a single variable.

Question 29

Arrow Symbol

Answer 29

Also known as the assignment operator, is used in programming to assign a value to a variable. It indicates that the value on the right side of the arrow should be stored in the variable on the left side.

Question 30

Booleans

Answer 30

Represent one of two possible values - True or False. They are often used for logical operations and decision-making in programming.

Question 31

Complex Numbers

Answer 31

Mathematical entities that consist of both real and imaginary parts. They are often used in scientific and engineering calculations.

Question 32

Data Types

Answer 32

Refer to the different categories or classifications of data that can be stored and manipulated in a computer program. Each data type has specific characteristics and operations associated with it.

Question 33

Float

Answer 33

A data type in programming that represents decimal numbers. It can store both whole and fractional values.

Question 34

int

Answer 34

A data type that represents whole numbers without any decimal points. It includes both positive and negative numbers, as well as zero.

Question 35

Quotation Marks

Answer 35

Punctuation marks used to indicate direct speech or quotations within a text. They enclose words or phrases spoken by someone else or taken from another source.

Question 36

Variable

Answer 36

A named storage location in computer memory that holds a value which can change during program execution. It allows programmers to store and manipulate different types of data throughout their code.

Question 37

List

Answer 37

A collection of elements that are ordered and can be accessed by their position. It is similar to a shopping list where items are listed in a specific order and can be referred to by their number.

Question 38

Strings

Answer 38

In programming, these are sequences of characters enclosed in quotation marks. They are used to represent text and allow manipulation of words, sentences, or any other textual information within a program.

Question 39

Arithmetic Operators

Answer 39

Symbols used in programming languages to perform mathematical calculations such as addition, subtraction, multiplication, division, and modulus (remainder).

Question 40

Iteration

Answer 40

Refers to the repetition of a set of instructions until a specific condition is met. It allows programs to perform tasks repeatedly without having to write repetitive code.

Question 41

Modulo operator

Answer 41

Represented by the symbol %, is a mathematical operation that returns the remainder when one number is divided by another.

Question 42

Selection

Answer 42

Refers to the process of making a decision based on a condition or criteria. It allows the program to choose between different paths of execution.

Question 43

Concatenation

Answer 43

Refers to combining two or more strings together to create a new, longer string.

Question 44

Conditional Statements

Answer 44

Programming constructs that allow the execution of different blocks of code based on certain conditions. They enable programs to make decisions and perform different actions depending on whether a condition is true or false.

Question 45

else statements

Answer 45

Used in programming to specify a block of code that should be executed if the condition of an if statement is false.

Question 46

AND Operator

Answer 46

A logical operator that returns true only if both operands are true; otherwise, it returns false.

Question 47

for… in range loop

Answer 47

A type of loop that repeats a block of code for a specific number of times. It iterates over a sequence of numbers defined by the range function.

Question 48

Infinite Loops

Answer 48

Loops that continue to repeat indefinitely because the condition controlling the loop is always true or there is no condition at all.

Question 49

Iterative Statements

Answer 49

Also known as loops, are programming constructs that allow a set of instructions to be repeated multiple times based on a specified condition. They help automate repetitive tasks and make programs more efficient.

Question 50

OR Operator

Answer 50

A logical operator that returns true if at least one of its operands is true; otherwise, it returns false.

Question 51

REPEAT UNTIL (condition) loop

Answer 51

A type of loop that repeats a block of code until a certain condition becomes true. It checks the condition after executing the code block, ensuring that it runs at least once.

Question 52

while loop

Answer 52

A type of conditional looping structure that repeatedly executes a block of code as long as its specified condition remains true. It checks the condition before executing the code block.

Question 53

Algorithms

Answer 53

Step-by-step instructions or procedures used to solve a problem or complete a task. They provide a clear set of instructions that can be followed to achieve a specific goal.

Question 54

Compressing Data

Answer 54

Refers to reducing its size by encoding it in a more efficient way. It eliminates redundant or unnecessary information, resulting in smaller file sizes that take up less storage space and can be transmitted more quickly.

Question 55

Debugging Process

Answer 55

Refers to identifying and fixing errors or bugs in a software program. It involves analyzing the code, locating the source of the problem, and making necessary changes to resolve it.

Question 56

Development and Testing Times

Answer 56

Refer to the amount of time spent on creating and refining software applications. Development time includes activities like coding, designing, and implementing features, while testing time involves checking for errors or bugs before releasing the software.

Question 57

Route-finding Algorithm

Answer 57

An algorithm used to determine the best path or route between two points on a map. It calculates the most efficient way to reach the destination while considering factors like distance, time, and obstacles.

Question 58

Sorting a List

Answer 58

Refers to the process of arranging the elements in a list in a specific order, such as ascending or descending. It involves comparing and rearranging the elements based on their values.

Question 59

Append

Answer 59

Adding an element at the end of an existing data structure or sequence.

Question 60

For Loop

Answer 60

A control flow statement that allows you to repeatedly execute a block of code based on a specified number of iterations. It consists of an initialization, condition, and increment/decrement.

Question 61

Insert

Answer 61

Refers to adding an element into an existing data structure at a specific position.

Question 62

Len (function)

Answer 62

Used in programming languages to determine the length or size of a data structure, such as a string or list.

Question 63

Linear Search

Answer 63

A simple searching algorithm that checks each element in a list or array one by one until the target value is found or the end of the list is reached.

Question 64

Loop

Answer 64

A programming construct that allows for repeated execution of code until certain conditions are met. It helps automate repetitive tasks and saves time and effort.

Question 65

Partial Traversal

Answer 65

Refers to the process of visiting only a portion of the nodes in a data structure, such as a tree or graph. It involves exploring some nodes while skipping others.

Question 66

Range (Function)

Answer 66

Generates an ordered sequence of numbers within specified boundaries. It can be used in loops to iterate over a sequence of numbers or to create lists.

Question 67

Remove

Answer 67

Refers to the action of deleting or taking out an element from a data structure, such as a list or set.

Question 68

Binary Search Algorithm

Answer 68

An efficient searching algorithm that repeatedly divides a sorted list into halves, eliminating half of the remaining elements at each step, until it finds the target value or determines it does not exist.

Question 69

Linear Search Algorithm

Answer 69

A simple searching algorithm that sequentially checks each element in a list until it finds the target value or reaches the end of the list.

Question 70

Sequential Search

Answer 70

Also known as linear search, is a simple searching algorithm that checks each element in a list one by one until the desired element is found or the end of the list is reached.

Question 71

Sorted Data Set

Answer 71

Refers to a collection of data arranged in ascending or descending order based on some criteria, such as numerical values or alphabetical order.

Question 72

Parameters

Answer 72

Variables that are used to pass values into a function. They act as placeholders for the actual values that will be provided when the function is called.

Question 73

Return Statement

Answer 73

Used in a function to specify the value that should be returned when the function is called. It allows the function to send a value back to the code that called it.

Question 74

Importing

Answer 74

Refers to the process of bringing in external code or modules into a program. It allows access to functions, classes, and variables defined in other files.

Question 75

Software Libraries

Answer 75

Collections of pre-written code that provide a set of functions and procedures for developers to use in their own programs. They help simplify the development process by providing ready-made solutions for common tasks.

Question 76

module

Answer 76

A module refers to a file containing reusable code that can be imported into other programs. Modules help organize code by separating functionality into distinct files.

Question 77

random.randint

Answer 77

A function in Python that generates random integers within a specified range. It takes two arguments - the lowest possible value and the highest possible value - and returns a randomly chosen integer between them.

Question 78

Simulations

Answer 78

Computer programs or models that imitate real-world scenarios or processes. They allow users to observe and interact with virtual environments to gain insights, test hypotheses, or make predictions.

Question 79

Abstraction

Answer 79

The process of simplifying complex systems by focusing on the essential details and hiding unnecessary complexities.

Question 80

Random Number Generators

Answer 80

Algorithms used in computer programs to generate sequences of numbers that appear random but are generated based on specific rules.

Question 81

Approximate Solution

Answer 81

A solution that is not exact or precise, but rather an estimation or close enough answer to a problem. It provides a reasonable and practical result without the need for complete accuracy.

Question 82

Computational Resources

Answer 82

Refer to the hardware and software components necessary for performing computations or running programs.

Question 83

Decision Problem

Answer 83

A computational problem that requires a yes or no answer, such as determining whether a given number is prime.

Question 84

Exponential Efficiency

Answer 84

Refers to an algorithm or function whose running time grows exponentially with respect to its input size. In other words, as the input gets larger, this type of algorithm experiences rapid growth in its execution time.

Question 85

Factorial Efficiency

Answer 85

Refers to an algorithm or function whose running time grows factorially with respect to its input size. In other words, as the input gets larger, this type of algorithm experiences extremely rapid growth in its execution time.

Question 86

Input Size

Answer 86

Refers to the amount of data provided as input to an algorithm or program.

Question 87

Instance

Answer 87

An instance refers to each individual occurrence or example within a larger set or class.

Question 88

Optimization Problem

Answer 88

Involves finding the best solution among many possible solutions, often by maximizing or minimizing an objective function.

Question 89

Polynomial Efficiency

Answer 89

Refers to an algorithm or function that has a time complexity that can be represented by a polynomial equation. This means that the running time of the algorithm grows at a rate proportional to some power of the input size.

Question 90

Prime Number

Answer 90

Any positive integer greater than 1 that has no divisors other than 1 and itself.

Question 91

Shortest Path

Answer 91

The shortest path refers to the route with the minimum total distance between two points in a graph or network.

Question 92

Sorting

Answer 92

Refers to arranging elements in ascending or descending order based on certain criteria, such as numerical value or alphabetical order.

Question 93

Alan Turing

Answer 93

Was a British mathematician, logician, and computer scientist who is widely considered the father of theoretical computer science and artificial intelligence. He made significant contributions to the development of modern computing by creating the concept of a universal machine, known as the “Turing machine,” which laid the foundation for modern computers.

Question 94

Decidable Problem

Answer 94

A computational problem for which there exists an algorithm that can determine whether a given input has a specific property or satisfies a certain condition.

Question 95

Halting Problem

Answer 95

Refers to the question of whether an arbitrary program will halt (terminate) or run forever when executed on some input.

Question 96

Undecidable Problem

Answer 96

A computational problem for which no algorithm can determine whether a given input has a specific property or satisfies a certain condition.