Use LEFT and RIGHT arrow keys to navigate between flashcards;
Use UP and DOWN arrow keys to flip the card;
H to show hint;
A reads text to speech;
24 Cards in this Set
- Front
- Back
|
recursion |
a method that calls itslef |
|
|
direct |
A calls A |
|
|
indirect |
A calls B calls A |
|
|
base case |
case where recursion stops |
|
|
modular exponention |
b^n mod m where n>=0 |
|
|
Big Oh |
O(n) used for linear growth |
|
|
recurrence relation |
when recursive method is on both sides of equation |
|
|
bubble sort |
compares two values and switches them |
|
|
selection sort |
finds the max value and puts it at the end. |
|
|
insertion sort |
moves values left to insert an item. Recursion is at the beginning |
|
|
type |
a collection of values |
|
|
data type |
a type together with a collection of operations to manipulate the type |
|
|
data item |
member of the data type |
|
|
simple data item |
subparts |
|
|
aggregate data item |
may contain several pieces of information |
|
|
abstract data type |
defines a data type solely in terms of a type and operations on that type. Does not specify how the type is implemented. |
|
|
data structure |
physical implementation of an ADT in a programming language |
|
|
Abstractions allow us to |
choose an efficient representation of the data Choose efficient implementation of the operations Develop code that uses the ADT independently from the code that implements it |
|
|
bag |
unordered collection of items w duplicates permitted |
|
|
set |
unordered, but no duplicates |
|
|
sequence |
ordered, duplicates |
|
|
ordered set |
ordered, no duplicates |
|
|
Class Diagram |
contains name of class and methods |
|
|
Command Query Separation Principle |
operations should either be accessors or mutators, not both |
