CSCI 1111 Lecture Notes - Lecture 1: Modulo Operation, Reserved Word, Binary Number
Document Summary
An algorithm is a finite, ordered sequence of: non ambiguous steps such that each step can be performed in a finite time. The algorithm solves not a single instance of the problem, but all the instances of the problem. Given a specific problem to solve, there are typically several algorithms to solve it: the best algorithm is the one with the fewest steps, given that they are all correct. A computer program consists of instructions that a computer executes: ex) multiplying numbers or printing a number to a screen. Main: a program starts by executing a method called main: where the program starts. Statement: a statement is a program instruction. Semicolon: every statement ends with a semicolon. Braces: the denote a list of statements (or instructions: anything in the braces will not be in the main. Code: the textual representation of a program.
