ITM 207 exam
Study online at https://quizlet.com/_1ajlsb
1. number of elements: length of an array
2. reading from an array: x <-- marks [1]
3. writing to an array (assigning a number to it): marks[3]<---18
4. �eld in which ordering is biased: sort key
5. order the items in the collection based on the sort key: sorting algorithms
6. instead of writing the value found on a second list, exchange it wit the value
currently in the position where the crossed o item should go: selection sort
7. starts with last listed element, compares successive pairs of elements swap-
ping whenevr the bottom element of the pair is smaller than the one above
it: bubble sort
8. sorts the numbers in array in respect to one another: insertion sort
9. other program that comes from the main program that once it carries out is
sent back to the main program: subprogram
10. identi�ers in ( ) beside subprogram: parameters
11. identi�ers in ( ) the subprogram calls: arguments
12. ability of the subprogram to call itsself: recursion
13. case in which we have to answer: base case
14. algorithmic step containing unspeci�ed details: abstract step
15. algorithmic step in which all details are speci�ed: concrete step
16. the case that expresses the solution: general case
17. the case to which we have to answer: base case
18. names given to data: identi�ers
19. program that translates a high level language program into code: compiler
20. program that translates and executes the statements into sequence: interpreter
21. ability of a program to be ran on di erent machines: portability
22. imperative
declarative: program language paradigms
23. hiding the details of a module with the goal of controlling access to it: informa-
tion hiding
24. complex system that only includes the details essential to the viewer: abstraction
25. problem solving with spontaneous ideas from all members of group: brain-
storming
1/3
Study online at https://quizlet.com/_1ajlsb
1. number of elements: length of an array
2. reading from an array: x <-- marks [1]
3. writing to an array (assigning a number to it): marks[3]<---18
4. �eld in which ordering is biased: sort key
5. order the items in the collection based on the sort key: sorting algorithms
6. instead of writing the value found on a second list, exchange it wit the value
currently in the position where the crossed o item should go: selection sort
7. starts with last listed element, compares successive pairs of elements swap-
ping whenevr the bottom element of the pair is smaller than the one above
it: bubble sort
8. sorts the numbers in array in respect to one another: insertion sort
9. other program that comes from the main program that once it carries out is
sent back to the main program: subprogram
10. identi�ers in ( ) beside subprogram: parameters
11. identi�ers in ( ) the subprogram calls: arguments
12. ability of the subprogram to call itsself: recursion
13. case in which we have to answer: base case
14. algorithmic step containing unspeci�ed details: abstract step
15. algorithmic step in which all details are speci�ed: concrete step
16. the case that expresses the solution: general case
17. the case to which we have to answer: base case
18. names given to data: identi�ers
19. program that translates a high level language program into code: compiler
20. program that translates and executes the statements into sequence: interpreter
21. ability of a program to be ran on di erent machines: portability
22. imperative
declarative: program language paradigms
23. hiding the details of a module with the goal of controlling access to it: informa-
tion hiding
24. complex system that only includes the details essential to the viewer: abstraction
25. problem solving with spontaneous ideas from all members of group: brain-
storming
1/3
