COMPSCI 1JC3 Study Guide - Midterm Guide: Vending Machine, Grayscale, Binary Logarithm
20 Nov 2014
School
Department
Course
Professor
Document Summary
Instead of calling parts of a tree nodes and calling connections between nodes edges, we call them places and ways . Knowing that a given piece of software will work. Can arise from design flaws in the software. Can predict whether or not a game will be interesting by studying the graph. A game graph is a special case of a state diagram graph. Game graphs are special cases of graphs, representing states in a game. We use graphs and edges to represent transitions/relationships between nodes. Compiler will not know if we have a wrong # of items in a list, but it will know that there can only be a set number of. Defining multiple functions func1, func2, func3, func4 funcn :: type. Defines all of the functions [1-n] as being of type type. State machines have to keep track of their internal states. Short-term memory in cpus is called a register.
