ITM 207 exam UPDATED ACTUAL Questions and CORRECT
Answers
number of elements length of an array
reading from an array x <-- marks [1]
writing to an array (assigning a number to it) marks[3]<---18
field in which ordering is biased sort key
order the items in the collection based on the sort key sorting algorithms
instead of writing the value found on a second list, selection sort
exchange it wit the value currently in the position where
the crossed off item should go
starts with last listed element, compares successive pairs bubble sort
of elements swapping whenevr the bottom element of
the pair is smaller than the one above it
sorts the numbers in array in respect to one another insertion sort
other program that comes from the main program that subprogram
once it carries out is sent back to the main program
identifiers in ( ) beside subprogram parameters
identifiers in ( ) the subprogram calls arguments
ability of the subprogram to call itsself recursion
case in which we have to answer base case
algorithmic step containing unspecified details abstract step
algorithmic step in which all details are specified concrete step
the case that expresses the solution general case
the case to which we have to answer base case
names given to data identifiers
program that translates a high level language program compiler
into code
Answers
number of elements length of an array
reading from an array x <-- marks [1]
writing to an array (assigning a number to it) marks[3]<---18
field in which ordering is biased sort key
order the items in the collection based on the sort key sorting algorithms
instead of writing the value found on a second list, selection sort
exchange it wit the value currently in the position where
the crossed off item should go
starts with last listed element, compares successive pairs bubble sort
of elements swapping whenevr the bottom element of
the pair is smaller than the one above it
sorts the numbers in array in respect to one another insertion sort
other program that comes from the main program that subprogram
once it carries out is sent back to the main program
identifiers in ( ) beside subprogram parameters
identifiers in ( ) the subprogram calls arguments
ability of the subprogram to call itsself recursion
case in which we have to answer base case
algorithmic step containing unspecified details abstract step
algorithmic step in which all details are specified concrete step
the case that expresses the solution general case
the case to which we have to answer base case
names given to data identifiers
program that translates a high level language program compiler
into code
