ISC 1057 Exam Review With 100%
Correct Answers
(T/F) If you have unsorted data to search then the Brute Force approach is as efficient as any
other method. - CORRECT ANSWER✔✔True
(T/F) If you have a set of unsorted data which will be searched continually by researchers over
the next year, then for efficiency you should sort the data first. - CORRECT ANSWER✔✔True
Which of the following numbers is (are) larger than N? Here N is a positive integer >1
a) Nlog(N) and N^2
b) Nlog(N) and log(N)
c) log(N) - CORRECT ANSWER✔✔a) Nlog(N) and N^2
Is the following inequality TRUE or FALSE? Here N is a positive integer > 1.
log(N) < N < N^2 < Nlog(N) - CORRECT ANSWER✔✔False
Which algorithm(s) typically take the least amount of work to sort a list of N items?
a) Merge Sort
b) Bubble Sort
c) Insertion Sort
d) Brute Force - CORRECT ANSWER✔✔a) Merge Sort
Suppose after one loop of Selection Sort you have the configuration
, sorted list: 1, 6, 8
unsorted list: 14, 11, 9
What is the unsorted list at the end of the next loop? - CORRECT ANSWER✔✔sorted list: 1, 6, 8,
9
unsorted list: 11, 14
Suppose after one step of Insertion Sort you have the configuration
sorted list: 1, 6, 8
unsorted list: 14, 11, 9
What is the sorted list at the end of the next step? - CORRECT ANSWER✔✔sorted list: 1, 6, 8, 11
unsorted list: 14, 9
Suppose you are doing Bubble Sort to sort a list of numbers from smallest to largest. At the end
of a loop of comparing adjacent items you have the list
5, 19, 7, 23, 11
What is the list at the end of the next loop? - CORRECT ANSWER✔✔5, 7, 19, 11, 23
If you are using Bubble Sort to sort the list of flowers
petunia, aster, dahlia, begonia, delphinium
what position is begonia in after the end of the first loop?
a) 3rd
b) 2nd
c) 4th - CORRECT ANSWER✔✔a) 3rd
(T/F) When you type words into a browser then the search engine searches an index of the web,
not the actual web. - CORRECT ANSWER✔✔True
Correct Answers
(T/F) If you have unsorted data to search then the Brute Force approach is as efficient as any
other method. - CORRECT ANSWER✔✔True
(T/F) If you have a set of unsorted data which will be searched continually by researchers over
the next year, then for efficiency you should sort the data first. - CORRECT ANSWER✔✔True
Which of the following numbers is (are) larger than N? Here N is a positive integer >1
a) Nlog(N) and N^2
b) Nlog(N) and log(N)
c) log(N) - CORRECT ANSWER✔✔a) Nlog(N) and N^2
Is the following inequality TRUE or FALSE? Here N is a positive integer > 1.
log(N) < N < N^2 < Nlog(N) - CORRECT ANSWER✔✔False
Which algorithm(s) typically take the least amount of work to sort a list of N items?
a) Merge Sort
b) Bubble Sort
c) Insertion Sort
d) Brute Force - CORRECT ANSWER✔✔a) Merge Sort
Suppose after one loop of Selection Sort you have the configuration
, sorted list: 1, 6, 8
unsorted list: 14, 11, 9
What is the unsorted list at the end of the next loop? - CORRECT ANSWER✔✔sorted list: 1, 6, 8,
9
unsorted list: 11, 14
Suppose after one step of Insertion Sort you have the configuration
sorted list: 1, 6, 8
unsorted list: 14, 11, 9
What is the sorted list at the end of the next step? - CORRECT ANSWER✔✔sorted list: 1, 6, 8, 11
unsorted list: 14, 9
Suppose you are doing Bubble Sort to sort a list of numbers from smallest to largest. At the end
of a loop of comparing adjacent items you have the list
5, 19, 7, 23, 11
What is the list at the end of the next loop? - CORRECT ANSWER✔✔5, 7, 19, 11, 23
If you are using Bubble Sort to sort the list of flowers
petunia, aster, dahlia, begonia, delphinium
what position is begonia in after the end of the first loop?
a) 3rd
b) 2nd
c) 4th - CORRECT ANSWER✔✔a) 3rd
(T/F) When you type words into a browser then the search engine searches an index of the web,
not the actual web. - CORRECT ANSWER✔✔True
