[qdeck] Click ‘Check answer’ to see the answer
Click ‘Need more practice,’ and that card will go to the bottom of the stack so you can practice it again.
If you know it, click ‘Got it.’
‘Shuffle’ lets you shuffle the deck.

[start] [q] Class [a] Blueprint from which individual objects are created [q] Variable [a] Stores single values of a specified data type. [q] Array [a] Stores a set of data in a single object. [q] Reserved words [a] Part of the syntax of the language and may not be used to name variables, classes, etc. [q] Class method [a] A shared method, defined within one Class, that can be used by other classes [q] Reference data types [a] Data type based on a class [q] Primitive data types [a] 8 basic types [q] Boolean [a] Value is true or false [q] Char [a] Represents Unicode characters [q] Byte [a] Value is an 8-bit whole number [q] Short [a] Value is a 16-bit whole number [q] Int [a] Value is a 32-bit whole number [q] Long [a] Value is a 64-bit whole number [q] Enum [a] Creates a newly defined a group of values that a variable can have [q] Float [a] Value is a 32-bit number with one or more digits after the decimal point [q] Double [a] Value is a 64-bit number with one or more digits after the decimal point [q] Void [a] Method doesn’t return a value. [/qdeck]

[qdeck] Click ‘Check answer’ to see the answer
Click ‘Need more practice,’ and that card will go to the bottom of the stack so you can practice it again.
If you know it, click ‘Got it.’
‘Shuffle’ lets you shuffle the deck.

[start] [q] Permutation [a] Order does matter [q] Combination [a] Order does not matters [q] Ordered pair of vertices [a] Endpoints [q] Parallel edges [a] Two distinct edges with the same set of end points [q] Degree of node [a] The number of arc ends [q] Path [a] A walk without repeated edges [q] Algorithm [a] Step-by-step method for solving all problems of a given type. [q] Full binary tree [a] A binary tree in which each parents has exactly 2 children [q] Binary tree [a] Every parent has at most 2 children [q] Linear function [a] Function whose graph in rectangular coordinates is a straight line [q] Inclusion/Exclusion principle [a] Counting technique that relates information about the number of elements in a set, its subsets, and the intersections of those subsets [q] Rates of change of functions [a] Refers to the amount the function's output increases or decreases for each unit of change in the input. [q] Coordinate Pair [a] An ordered pair of real numbers, usually used in describing a point on the plane [q] Recursive algorithm [a] One that calls or makes use of itself. An important part of a recursive algorithm is a termination condition that, once it is met, will cause the algorithm to cease calling itself and stop. [q] Exhaustive algorithm [a] Algorithms that are designed to examine systematically every possibility in search of a solution. [q] Planar [a] A graph is planar if it can be drawn so that none of its edges intersect except at vertices. [/qdeck]