APCSP Unit 4 Vocab List

  1. Append (Re: Lists)

    1. Added an elements to the end of a list 

  2. Arguments (Re: Parameters)

    1. specifies the values of the parameters when a procedure is called 

  3. Index (Re: Lists)

    1. A data structure within a list that gives each element value and position (making it easier to locate it within the index) 

  4. Insert (Re: Lists)

    1. To add an element to a data structure that already exists (such as an index or list) and assign to a position and value to a specific place (not automatically brought to top or bottom) 

  5. Length (Re: Lists)

    1. How many elements are in a list

  6. parallel lists

    1. Two different lists that organize the same information in different ways and categories (but to the same elements) 

  7. Parameters

    1. input variables for a procedure.

  8. binary search

    1. a search algorithm that repeatedly divides a sorted list to narrow in on the searched-for item

  9. decidable problems

    1. problems in which an algorithm can be constructed to answer 'yes' or 'no' for all inputs

  10. distributed computing

    1. a computational model in which multiple networked computers are used to run a program

  11. Efficiency (Re: algorithms)

    1. how well an algorithm uses time and memory/space resources, CPU and RAM 

  12. heuristic algorithm

    1. finds an approximate solution for a hard problem; helpful for finding a solution in a reasonable amount of time 

  13. linear or sequential search

    1.  an algorithm that checks every element in a list from the start to the end of the list to find an item.

  14. parallel computing

    1. a computational model where a problem/program is broken into multiple smaller sequential computing operations some of which are performed simultaneously in parallel (on multiple processors or computers)

  15. sequential computing

    1. a computational model in which operations are performed in order, one at a time on one processor or computer

  16. Bubble Sort

    1. One item from the list is compared with the rest until an item that is greater than it replaces it (goes on until list is sorted)  

  17. Bucket Sorting

    1. Algorithm in which lists are divided into smaller, specialized categories, and by merged together into a specific ordered list 

  18. Merge Sort

    1. Lists are split into pair and compared as to which is great (eventually the pairs are compared with each other until it becomes one list) 

  19. undecidable problems

    1. have no algorithm that can be constructed that always leads to a correct yes-or-no answer

  20. brute force

    1. solve by trial and error; trying every possible option

  21. Intractable

    1. (used to describe a  problem) not easily uncontrolled and has many factors, therefore there is not efficient way to solve it (usually solved by brute force) 

  22. intractable problems

    1. practically impossible to solve in a < b

  23. The Halting Problem

    1. The undecidable problem of determining whether a computer program will produce an answer at some point or loop forever on a given input

  24. The Traveling Salesman Problem

    1. Given a list of cities and the distances between them, find the shortest path visiting each city once and returning to the start.