Find Flashcards
Why It Works
More
Educators
Businesses
Academy
About

Brainscape's Knowledge Genome^TM

Browse over 1 million classes created by top students, professors, publishers, and experts.

Entrance Exams
Professional Certifications
Foreign Languages
Medical & Nursing
Science
English
Humanities & Social Studies
Mathematics
Law
Vocations
Health & Fitness
Business & Finance
Technology & Engineering
Food & Beverage
Fine Arts
Random Knowledge

See full index

INFT1004 introduction to programming (Python) > chpt 3.2 (math functions) > Flashcards

chpt 3.2 (math functions) Flashcards

INFT1004 introduction to programming (Python) (85 decks)

Glossary Chpt 1

Glossary Chpt 2

Glossary Chpt 3

Glossary Chpt 4

Glossary Chpt 5

Glossary Chpt 6

Glossary Chpt 7

Glossary Chpt 8

Glossary Chpt 9

Glossary Chpt 10

chpt 1.1 (what is a program)

Chpt 1.2 (Running Python)

Chpt 1.3 (the first program)

chpt 1.4 (arithmetic operators)

chpt 1.5 (values & types)

chpt 1.6 (natural & formal languages)

chpt 1.7 (debugging)

chpt 2.1 (assignment statements)

chpt 2.2 (variable names)

chpt 2.3 (expressions & statements)

chpt 2.4 (script mode)

chpt 2.5 (order of operations)

chpt 2.6 (string operations)

chpt 2.7 (comments)

chpt 2.8 (debugging)

chpt 3.1 (function calls)

chpt 3.2 (math functions)

chpt 3.3 (composition)

chpt 3.4 (adding new functions)

chpt 3.5 (definitions and uses)

chpt 3.6 (flow of execution)

chpt 3.7 (parameters and arguments)

chpt 3.8 (variables and parameters are local)

chpt 3.9 (stack diagrams)

chpt 3.10 (fruitfull functions / void functions)

chpt 3.11 (why functions)

chpt 3.12 (debugging)

chpt 4.1 (the turtle module)

chpt 4.2 (simple repetition)

chpt 4.4 (encapsulation)

chpt 4.5 (generalisation)

chpt 4.6 (interface design)

chpt 4.7 (refactoring)

chpt 4.8 (a development plan)

chpt 4.9 (docstring)

chpt 4.10 (debugging)

chpt 5.1 (floor devision & modules)

chpt 5.2 (boolean expressions)

chpt 5.3 (logical operators)

chpt 5.4 (conditional execution)

chpt 5.5 (alternative execution)

chapt 5.6 (chained conditionals)

chpt 5.7 (nested conditionals)

chpt 5.8 (recursion)

chpt 5.9 (stack diagrams for recursion functions)

chpt 5.10 (infinite recursion)

chpt 5.11 (keyboard input)

chpt 5.12 (debugging)

chpt 6.1 (return values)

chpt 6.2 (incremental development)

chpt 6.3 (composition)

chpt 6.4 (boolean functions)

chpt 6.5 (more recursion)

chpt 6.6 (leap of faith)

chpt 6.7 (one more example)

chpt 6.8 (checking types)

chpt 6.9 (debugging)

chpt 7.1 (reassignment)

chpt 7.2 (updating variables)

chpt 7.3 (the while statement)

chpt 7.4 (break)

chpt 7.5 (square roots)

chpt 7.6 (algorithms)

chpt 7.7 (debugging)

chpt 8.1 (a string is a sequence)

chpt 8.3 (traversal with a for loop)

chpt 8.4 (string slices)

chpt 8.5 (strings are immutable)

chpt 8.6 (searchings)

chpt 8.7 (looping and counting)

chpt 8.8 (string methods)

chpt 8.9 (the in operator)

chpt 8.10 (string comparision)

chpt 8.11 (debugging)

Key Links
Subjects
Company
- About Us
- Earn Money!
- Academy
- Swag Shop
- Contact
- Terms
- Podcasts
Find Us

Brainscape helps you reach your goals faster, through stronger study habits.
© 2024 Bold Learning Solutions. Terms and Conditions