Finiteness - An algorithm must always terminate after a reasonable number of steps, Effectiveness - all of the operations to be performed in the algorithm must be sufficiently basic that they can be done exactly, problem - a situation that needs attention and needs to be dealt with or solved, CAPTSHA - Completely Automated Public Turing test to tell Computers and Humans Apart, algorithm - a series of unambiguous instructions designed in order to solve a problem and achieve a certain goal in a finite number of steps, flowchart - A formalized graphic representation method which avoids most issues of ambiguity., pseudocode - a generic artificial language that describes computer algorithms but does not use the syntax of any particular programming language., syntax - the rules that specify the correct combined sequence of symbols that can be used to form a correctly structured program using a given programming language, variable - a symbolic name given to an unknown quantity that permits the name to be used independent of the information it represents, integer - a data type used to represent real numbers that do not have fractional values,

Chapter 4 - OOP

โดย
สั่งพิมพ์
ฝัง

ลีดเดอร์บอร์ด

สไตล์ภาพ

ตัวเลือก

สลับแม่แบบ

คืนค่าการบันทึกอัตโนมัติ: ใช่ไหม