Scripting and Programming Foundations - D278
questions with verified answers
Abstract data type (ADT) Ans✓✓✓-a data type whose creation and update are
constrained to specific well-defined operations
A class can be used to implement an ADT
Abstraction Ans✓✓✓-To have a user interact with an item at a high-level, with
lower-level internal details hidden from the user/
Also called information hiding or encapsulation
Activity diagram Ans✓✓✓-A flow chart used to describe the flow of an activity or
set of activities
Agile approach Ans✓✓✓-Building program by doing small amounts of SDLC
phases in sequences and then repeating
Also called spiral approach
Algorithm best case Ans✓✓✓-The scenario where the algorithm does the
minimum possible number of operations
Algorithm Ans✓✓✓-A sequence of instructions that solves a problem
,Algorithm efficiency Ans✓✓✓-typically measured by the algorithm's
computational complexity
Algorithm worst case Ans✓✓✓-The scenario where the algorithm does the
maximum possible number of operations
Input data size must remain a variable.
Analysis phase Ans✓✓✓-Part of SDLC
Defines a program's goals
Arguements Ans✓✓✓-Any function input values, appear within ( ); separated by
commas if more than one
Argument Ans✓✓✓-A value provided to a function's parameter during a function
call.
Array Ans✓✓✓-A special variable having one name, but storing a list of data
items with each item being directly accessible (also called a Vector)
Must be an integer type, cannot be floating-point
ASCII Ans✓✓✓-A popular code for characters
Assignment statement Ans✓✓✓-Assigns a variable with a value; and keeps that
value during subsequent statement until X is assigned again.
, Assignment's left side must be a variable (ex. x=5)
Auxillary Space Complexity Ans✓✓✓-The space complexity not including the
input data
Ex.) S(N) = k
Behavioral diagram Ans✓✓✓-visualizes dynamic behavior of software, such as
the flow of an algorithm
Binary search Ans✓✓✓-a search algorithm that starts at the middle of a sorted
set of numbers and removes half of the data; this process repeats until the
desired value is found or all elements have been eliminated.
Bit Ans✓✓✓-A single unit of binary consisting of only one place whose value can
be 0 or 1.
Boolean Ans✓✓✓-A type that has just two values : true or false
Branch Ans✓✓✓-Sequence of statements only executed under a certain
condition
Bug Ans✓✓✓-A problem's cause in a program
Byte Ans✓✓✓-8 bits
questions with verified answers
Abstract data type (ADT) Ans✓✓✓-a data type whose creation and update are
constrained to specific well-defined operations
A class can be used to implement an ADT
Abstraction Ans✓✓✓-To have a user interact with an item at a high-level, with
lower-level internal details hidden from the user/
Also called information hiding or encapsulation
Activity diagram Ans✓✓✓-A flow chart used to describe the flow of an activity or
set of activities
Agile approach Ans✓✓✓-Building program by doing small amounts of SDLC
phases in sequences and then repeating
Also called spiral approach
Algorithm best case Ans✓✓✓-The scenario where the algorithm does the
minimum possible number of operations
Algorithm Ans✓✓✓-A sequence of instructions that solves a problem
,Algorithm efficiency Ans✓✓✓-typically measured by the algorithm's
computational complexity
Algorithm worst case Ans✓✓✓-The scenario where the algorithm does the
maximum possible number of operations
Input data size must remain a variable.
Analysis phase Ans✓✓✓-Part of SDLC
Defines a program's goals
Arguements Ans✓✓✓-Any function input values, appear within ( ); separated by
commas if more than one
Argument Ans✓✓✓-A value provided to a function's parameter during a function
call.
Array Ans✓✓✓-A special variable having one name, but storing a list of data
items with each item being directly accessible (also called a Vector)
Must be an integer type, cannot be floating-point
ASCII Ans✓✓✓-A popular code for characters
Assignment statement Ans✓✓✓-Assigns a variable with a value; and keeps that
value during subsequent statement until X is assigned again.
, Assignment's left side must be a variable (ex. x=5)
Auxillary Space Complexity Ans✓✓✓-The space complexity not including the
input data
Ex.) S(N) = k
Behavioral diagram Ans✓✓✓-visualizes dynamic behavior of software, such as
the flow of an algorithm
Binary search Ans✓✓✓-a search algorithm that starts at the middle of a sorted
set of numbers and removes half of the data; this process repeats until the
desired value is found or all elements have been eliminated.
Bit Ans✓✓✓-A single unit of binary consisting of only one place whose value can
be 0 or 1.
Boolean Ans✓✓✓-A type that has just two values : true or false
Branch Ans✓✓✓-Sequence of statements only executed under a certain
condition
Bug Ans✓✓✓-A problem's cause in a program
Byte Ans✓✓✓-8 bits
