ITM 207 Exam – Questions With Comprehensive
Solutions
Save
Practice questions for this set
Learn 1 /7 Study with Learn
general case
Choose an answer
1 number of elements 2 case in which we have to answer
order the items in the collection based
3 4 the case that expresses the solution
on the sort key
Don't know?
Terms in this set (60)
number of elements length of an array
reading from an array x <-- marks [1]
writing to an array marks[3]<---18
(assigning a number to it)
field in which ordering is sort key
biased
, order the items in the sorting algorithms
collection based on the
sort key
instead of writing the value selection sort
found on a second list,
exchange it wit the value
currently in the position
where the crossed off item
should go
starts with last listed bubble sort
element, compares
successive pairs of
elements swapping
whenevr the bottom
element of the pair is
smaller than the one above
it
sorts the numbers in array insertion sort
in respect to one another
other program that comes subprogram
from the main program that
once it carries out is sent
back to the main program
identifiers in ( ) beside parameters
subprogram
identifiers in ( ) the arguments
subprogram calls
ability of the subprogram recursion
to call itsself
case in which we have to base case
answer
algorithmic step containing abstract step
unspecified details
algorithmic step in which all concrete step
details are specified
the case that expresses the general case
solution
Solutions
Save
Practice questions for this set
Learn 1 /7 Study with Learn
general case
Choose an answer
1 number of elements 2 case in which we have to answer
order the items in the collection based
3 4 the case that expresses the solution
on the sort key
Don't know?
Terms in this set (60)
number of elements length of an array
reading from an array x <-- marks [1]
writing to an array marks[3]<---18
(assigning a number to it)
field in which ordering is sort key
biased
, order the items in the sorting algorithms
collection based on the
sort key
instead of writing the value selection sort
found on a second list,
exchange it wit the value
currently in the position
where the crossed off item
should go
starts with last listed bubble sort
element, compares
successive pairs of
elements swapping
whenevr the bottom
element of the pair is
smaller than the one above
it
sorts the numbers in array insertion sort
in respect to one another
other program that comes subprogram
from the main program that
once it carries out is sent
back to the main program
identifiers in ( ) beside parameters
subprogram
identifiers in ( ) the arguments
subprogram calls
ability of the subprogram recursion
to call itsself
case in which we have to base case
answer
algorithmic step containing abstract step
unspecified details
algorithmic step in which all concrete step
details are specified
the case that expresses the general case
solution
