Karteikarten
Week 1: Intro to Algorithms & Python
Karten in diesem Stapel (4)
- 1Algorithm- Sequence of unambiguous instructions for solving a problem
- Obtain a required output for any legitimate input in a finite amount of time - 2Properties of an algorithm1. Input: zero or more
2. Output: one or more
3. Finiteness: must always terminate
4. Definiteness: each step well-defined
5. Effectiveness: each step can be performed by the agent - 3Computational problem- An infinite collection of questions, together with (at least) one answer for every question
- E.g. addition is a computational problem, and 17+4 is an instance/question of the computational problem - 4MethodsFunctions “attached” to a value
Informationen
- Beschreibung
- Computer Science (FIT1045: Algorithms & Programming Fundamentals in Python) Karteikarten am Week 1: Intro to Algorithms & Python, erstellt von Melina Mackey am 02/09/2019.
- Erstellt von
- Melina Mackey
- Aufrufe
- 1
- Bewertung