Podcast
Questions and Answers
Part of ADT: data and operation
Part of ADT: data and operation
- External ADT (correct)
- Internal ADT
used for storing elements where each is separate object
used for storing elements where each is separate object
- Queue
- Stack
- Tree
- Linked List (correct)
algorithm must terminate after specified number of steps
algorithm must terminate after specified number of steps
- Uniqueness
- Terminate
- Finiteness (correct)
repeating action multiple times
repeating action multiple times
problem broken into smaller sub-problems
problem broken into smaller sub-problems
single call itself each time function runs
single call itself each time function runs
terminate when reached base case
terminate when reached base case
elements access in sequential order but stored unsystematically
elements access in sequential order but stored unsystematically
logical description on how data viewed
logical description on how data viewed
LIFO
LIFO
step by step instructions to be executed insequence for solving problem
step by step instructions to be executed insequence for solving problem
algorithm must have 1 or more results with specified relation to input
algorithm must have 1 or more results with specified relation to input
occurs when function calls itself once or multiple times to solve problem
occurs when function calls itself once or multiple times to solve problem
calls itself twice during course of execution
calls itself twice during course of execution
same with Divide and Conquer, except results of sub-problems reused for overlapping sub-problems
same with Divide and Conquer, except results of sub-problems reused for overlapping sub-problems
set of ordered pairs where elements called identifiers and values called content
set of ordered pairs where elements called identifiers and values called content
FIFO
FIFO
not main operation that defined ADT
not main operation that defined ADT
elements stored and accessed in non-sequential order
elements stored and accessed in non-sequential order
special format for storing and organizing data
special format for storing and organizing data
call is the last statement that is executed by function
call is the last statement that is executed by function
terminated condition if proven false
terminated condition if proven false
represents hierarchical nature of structure in graphical form
represents hierarchical nature of structure in graphical form
special type of queue elements processed by order
special type of queue elements processed by order
result of each step depends on input and result of previous step
result of each step depends on input and result of previous step
optimal approach is always chosen in solving problem
optimal approach is always chosen in solving problem
when divided into two functions that call each other
when divided into two functions that call each other
algorithm has zero or more well-defined data given before algorithm begins
algorithm has zero or more well-defined data given before algorithm begins
representation and implementation
representation and implementation
other term for external adt
other term for external adt
when method directly calls itself
when method directly calls itself
TRUE or FALSE: Each iteration doesn't require extra memory
TRUE or FALSE: Each iteration doesn't require extra memory
complete binary tree
complete binary tree
consist of vertices(nodes) and set of edges(relations) between pair of vertices
consist of vertices(nodes) and set of edges(relations) between pair of vertices
collection of elements where each item is unique
collection of elements where each item is unique
not part of wall of adt
not part of wall of adt
each instruction has to be clear and unambiguous
each instruction has to be clear and unambiguous
when method calls another method, eventually calling original method
when method calls another method, eventually calling original method
