Final

Question 1

bubble sort

Answer 1

considers objects in pairs, swaps them if they’re in wrong order, largest unsorted item bubbles to top

Question 2

pros of bubble sort

Answer 2

simple to write, little memory is used, easy to understand

Question 3

cons of bubble sort

Answer 3

takes a very long time with large amounts of data, goes through list several times making it slow

Question 4

merge sort

Answer 4

divide and conquer, cuts list down into sublists

Question 5

pros of merge sort

Answer 5

faster for larger lists, has consistent running time

Question 6

cons of merge sort

Answer 6

uses more memory to store sublists, goes through entire process even if list is sorted

Question 7

selection sort

Answer 7

repeatedly finds minimum element from unsorted part and puts it at beginning

Question 8

pros of selection sort

Answer 8

performs well on small lists, does not require additional storage

Question 9

cons of selection sort

Answer 9

not efficient for large lists

Question 10

insertion sort

Answer 10

repeatedly scans lists of items, inserting the item into its correct position

Question 11

pros of insertion sort

Answer 11

simple, good for small lists, requires minimal storage

Question 12

cons of insertion sort

Answer 12

does not work well w/large lists, does not perform as well as other algorithms

Question 13

quick sort

Answer 13

divide and conquer, puts list into sublists

Question 14

pros of quick sort

Answer 14

efficient in dealing w/large lists, no additional storage necessary, sorts lists of any size easily

Question 15

cons of quick sort

Answer 15

its worst performance is similar to that of bubble sort, insertion, or selection

Question 16

counting sort

Answer 16

counts the number of objects having distinct key values, calculates position of each object in the output sequence

Question 17

pros of counting sort

Answer 17

easy to code, performs generally faster than other algorithms

Question 18

cons of counting sort

Answer 18

does not work on decimal values, ineffcient if range is very large

Question 19

radix sort

Answer 19

creates/distributes elements into buckets according to their radix

Question 20

pros of radix sort

Answer 20

fast when keys are short, stable bc it maintains relative order of elements w/equal values

Question 21

cons of radix sort

Answer 21

less flexible, takes up more space, slow if operations are inefficient

Question 22

binary search

Answer 22

search begins at middle of list, finds item or eliminates half of unexamined items, repeats until item is found, finding number in 7 tries example

Question 23

sequential search

Answer 23

starts at beginning of list searches the entire list until the item is found

Question 24

what shape starts and ends a flow chart?

Answer 24

oval

Question 25

what shape is used for input/output

Answer 25

parallelogram

Question 26

what shape is used for processing

Answer 26

rectangle

Question 27

what shape is used for decision making (IF condition)

Answer 27

diamond