CMPT 120 Study Guide - Final Guide: Well-Order, Prolog, Formal Language

• School: Simon Fraser University
• Department: Computing Science
• Course: CMPT 120
• Professor: Steven Pearce

Document Summary

Well-ordered as in a proper sequence or control structure. Effectively computable operations as in no logic bugs, does as told. Produces a result as in reaches end goal. Halts as in program does not loop infinitely. Definition: a well-ordered collection of unambiguous and effectively computable operations that, when executed, produces a result and halts at a finite amount of time. Think of as: a recipe / method that the computer follows to complete tasks instructed in order to produce desired result or solve a problem. Representation: concrete, symbolic encoding of information e. g. ) numbers, words, names. Transformation: the steps (programming algorithm) used to calculate a specific result. Grammar, specifies form of a language by describing possible combination of symbols. Meaning, specifics what is being conveyed by the language. Coding means translating requirements into programming language and programming means to provide computer with a set of instructions to execute the same.