Scripting and Programming Foundations - D278
questions with verified answers
!= Ans✓✓✓-not equal
"on the order" of N things Ans✓✓✓-linear search requires at most N
comparisons...
= Ans✓✓✓-symbol that puts a value into the variable; assignment in
programming
0-1 knapsack problem Ans✓✓✓-problem with the quantity of each item limited
to 1
abstract data type Ans✓✓✓-ADT; data type whose creation and update are
constrained to specific well-defined operations
abstraction Ans✓✓✓-user interacts with an item at a high-level, with lower-level
internal details hidden from the user (information hiding or encapsulation) [e.g.
when you use an oven, you turn a knob or hit some buttons...you are not dealing
with internal parts of oven)
activity diagram Ans✓✓✓-A diagram that resembles a horizontal flowchart that
shows the actions and events as they occur. Activity diagrams show the order in
which actions take place and identify the outcome; implementation phase
agile approach Ans✓✓✓-aka spiral approach; program built in small amounts and
then repeats
,Algorithm Ans✓✓✓-A sequence of instructions that solves a problem
algorithm efficiency Ans✓✓✓-is measured by algorithm runtime; more efficient
is less runtime; measured in computational complexity
algorithm time efficiency Ans✓✓✓-number of calculations it takes to solve a
problem in an algorithm
American Standard Code for Information Interchange (ASCII) Ans✓✓✓-ASCII;
uses 7 bits per code and has codes for 128 characters; 1963
an argument Ans✓✓✓-value provided to a function's parameter during a
function call; e.g. a pizza area function might be called PizzaArea(12.0) or
PizzaArea(16.0)
analysis phase Ans✓✓✓-phase that identifies a program's goals
Arguments Ans✓✓✓-The values that the programmer provides in the function
call.
array Ans✓✓✓-ordered list of items of a given data type
assignment statement Ans✓✓✓-assigns a variable with a value, such as x = 5
, asymmetric test Ans✓✓✓-Yes = validates but no = does not invalidate, or vice
versa; e.g. hearing a broken bulb validates its broken, but not hearing it does not
mean it isn't broken in another way; generally quicker than symmetric tests but
not as thorough
auxiliary space complexity Ans✓✓✓-space complexity not including the input
data (essentially removes the N from the equation)
Basic instruction types Ans✓✓✓-input, process, output
behavioral diagram Ans✓✓✓-diagram that visualizes dynamic behavior of
software, such as the flow of an algorithm
best case Ans✓✓✓-scenario where the algorithm does the minimum possible
number of operations (can not be zero, though)
binary Ans✓✓✓-type of algorithm that checks range's middle; if value is greater,
will search in upper half and vice versa; essentially looking at half the data not all
of it; can be faster than linear (e.g. used with search engines)
binary numbers Ans✓✓✓-Represents values using 0 and 1
binary search Ans✓✓✓-divides an item into two halves, runs a test to decide in
which half something lies, and repeats the binary search on that half
bit Ans✓✓✓-single 0 or a single 1
questions with verified answers
!= Ans✓✓✓-not equal
"on the order" of N things Ans✓✓✓-linear search requires at most N
comparisons...
= Ans✓✓✓-symbol that puts a value into the variable; assignment in
programming
0-1 knapsack problem Ans✓✓✓-problem with the quantity of each item limited
to 1
abstract data type Ans✓✓✓-ADT; data type whose creation and update are
constrained to specific well-defined operations
abstraction Ans✓✓✓-user interacts with an item at a high-level, with lower-level
internal details hidden from the user (information hiding or encapsulation) [e.g.
when you use an oven, you turn a knob or hit some buttons...you are not dealing
with internal parts of oven)
activity diagram Ans✓✓✓-A diagram that resembles a horizontal flowchart that
shows the actions and events as they occur. Activity diagrams show the order in
which actions take place and identify the outcome; implementation phase
agile approach Ans✓✓✓-aka spiral approach; program built in small amounts and
then repeats
,Algorithm Ans✓✓✓-A sequence of instructions that solves a problem
algorithm efficiency Ans✓✓✓-is measured by algorithm runtime; more efficient
is less runtime; measured in computational complexity
algorithm time efficiency Ans✓✓✓-number of calculations it takes to solve a
problem in an algorithm
American Standard Code for Information Interchange (ASCII) Ans✓✓✓-ASCII;
uses 7 bits per code and has codes for 128 characters; 1963
an argument Ans✓✓✓-value provided to a function's parameter during a
function call; e.g. a pizza area function might be called PizzaArea(12.0) or
PizzaArea(16.0)
analysis phase Ans✓✓✓-phase that identifies a program's goals
Arguments Ans✓✓✓-The values that the programmer provides in the function
call.
array Ans✓✓✓-ordered list of items of a given data type
assignment statement Ans✓✓✓-assigns a variable with a value, such as x = 5
, asymmetric test Ans✓✓✓-Yes = validates but no = does not invalidate, or vice
versa; e.g. hearing a broken bulb validates its broken, but not hearing it does not
mean it isn't broken in another way; generally quicker than symmetric tests but
not as thorough
auxiliary space complexity Ans✓✓✓-space complexity not including the input
data (essentially removes the N from the equation)
Basic instruction types Ans✓✓✓-input, process, output
behavioral diagram Ans✓✓✓-diagram that visualizes dynamic behavior of
software, such as the flow of an algorithm
best case Ans✓✓✓-scenario where the algorithm does the minimum possible
number of operations (can not be zero, though)
binary Ans✓✓✓-type of algorithm that checks range's middle; if value is greater,
will search in upper half and vice versa; essentially looking at half the data not all
of it; can be faster than linear (e.g. used with search engines)
binary numbers Ans✓✓✓-Represents values using 0 and 1
binary search Ans✓✓✓-divides an item into two halves, runs a test to decide in
which half something lies, and repeats the binary search on that half
bit Ans✓✓✓-single 0 or a single 1
