Unit 3 Vocabulary
- Variables
- Data Types
- Assignment Operators
- Managing Complexity with Variables
- Algorithms
- Sequence
- Selection
- Iteration
- Expressions
- Comparison Operators
- Booleans Expressions and Selection
- Booleans Expressions and Iteration
- Truth Tables
- Characters
- Strings
- Length
- Concatenation
- Upper
- Lower
- Traversing Strings
- Python If, Elif, Else conditionals
- Python For
- While loops
- Combining loops with conditionals to Break, Continue
- Procedural Abstraction
- Python Def procedures
- Parameters
- Return Values
| Big Idea 1 | Big Idea 2 | Big Idea 3 | Big Idea 4 | Big Idea 5 | Miscellaneous |
Variables
Data Types
Assignment Operators
Managing Complexity with Variables
Lists
2D Lists
Dictionaries
Class
Algorithms
An algorithm in computer science is a sequence of instructions that are followed in a specific order to perform a specific task or solve a particular problem. An algorithm is a set of well-defined steps that can be followed by a computer or other computational device to achieve a desired result. Algorithms are an essential part of computer science because they allow computers to perform complex tasks and make decisions based on the data they are given. An algorithm can be as simple as a set of instructions for carrying out a basic mathematical operation, such as adding two numbers together, or it can be more complex, such as a set of steps for sorting a large dataset.
Example
def find_largest_number(numbers):
# Set a variable to store the largest number
largest_number = numbers[0]
# Iterate through the list of numbers
for number in numbers:
# If the current number is larger than the largest number,
# update the largest number
if number > largest_number:
largest_number = number
# Return the largest number
return largest_number
# Test the function with a list of numbers
print(find_largest_number([1, 3, 2, 5, 4])) # should print 5
This algorithm finds the