ISC 1057 - Exam #3 Prep
Suppose after one step if Insertion Sort you have the configuration Sorted List: 1, 6, 8 Unsorted List: 14, 11, 9 What is the sorted list as the end of the next step?
1, 6, 8, 11
If you are sorting 10 bookshelves of 50 books each using Bubble sort, then approximately how many comparisons (or how much work) does it take?
10 x 50^2
Which number is the largest
100^2
if we want to sort 100 items using a sorting algorithm which is quadratic in work, which of the following gives the amount of work required?
100^2
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?
11, 14
If we are using Insertion Sort (which combines Selection & Bubble Sort) to sort a list of numbers from smallest to largest and at one point we have the lists Sorted: { 5, 8, 10 } Unsorted: { 21, 13, 11} then what number do we move to the sorted list next
13
In the given word map, what is the shortest number of steps needed to go from CAKE to SAGE
2
Use the index below for 3 web pages to answer the following question. How many words are in the title of web page 1? Do not count the HTML commands
2
If you have the sorted list of 9 numbers { 2, 5, 8, 9, 13, 17, 18, 19,20 } and are searching for the number 18, then the first step of Binary Search discards the numbers
2, 5, 8, 9, 13
Consider the list { 4, 2, 9, 1, 6, 3, } At the end of the first loop of Merge Sort, how many sorted lists of two numbers each will there be?
3
If you have the sorted list of 9 numbers { 2, 5, 8, 9, 13, 17, 18, 19, 20 } then what is the maximum number of comparisons that it can take to find any number using Binary Force
3
In the given word map, what is the shortest number of steps needed to go from CORE to POLL
3
In the room maze below suppose we start in room B and mark it with a "0" and mark its neighbors with a "1", etc. Then what do we mark room J with?
3
Suppose at the end of a loop of Bubble Sort to sort a list from smallest to largest you have the list {2, 14, 16, 21, 5} How many more loops will it take to get 5 to its correct position?
3
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
3rd
Consider the list { 4, 2, 9, 1, 6, 3, 5, } At the end of the first loop of Merge Sort, how many sorted lists of two numbers each will there be?
4
If COULD can be converted to WARM using doublets, what is the smallest distance possible
4
Suppose we have a list of 16 numbers that we want to sort using Merge Sort. How many loops of the algorithm will it take to get one sorted list with 16 numbers? Assume that initially each number is in its own sublit, i.e., 16 sublits to start and in the first loop we merge lists with 1 item each
4
In the given word map, what is the shortest number of steps needed to go from CAGE to FAIL
5
Suppose you are doing Bubble Sort to sort a list of numbers from smallest to largest. At the end of a loop comparing adjacent items you have the list 5, 19, 7, 23, 11 What is the list at the end of the next loop?
5, 7, 19, 11, 23
What is the largest number?
500^2
if we have 50 items to sort using Bubble sort then it takes approximately how many units of work
50^2
if we have 50 items to sort using Selection sort then it takes approximately how many units of work
50^2
Suppose we want to merge 2 sorted lists each containing 4 numbers. What is the maximum number of comparisons that we need to do?
7
If you have the sorted list of 9 numbers { 2, 5, 8, 9, 13, 17, 18, 19, 20 } then what is the maximum number of comparisons that it can take to find any number using Brute Force?
9
What is the missing word in the following Word Latter? BARD - CARD - ???? - CORE
CARE
Suppose you have the word latter: Change COLD to WARM. At the first step you see the choices COLD- FOLD COLD - CORD COLD-GOLD Based on our heuristic rules, which would be the best choice?
CORD
Suppose we are trying to change MAN into APE, and we have the intermediate word EAR where we started at MAN. We are considering three choices; FAR, ERR, and CAR. Based upon our heuristic rule for vowel/consonant change, what is our best guess?
ERR
Use the index below for 3 web pages to determine if the following statement is TRUE or FALSE The word SAT is adjacent to the word CAT but not to the word DOG.
FALSE
A Browser and a Search engine are essentially the same
False
A Brute Force approach to solving a doublet which can be solved by a Greedy strategy at each step requires no back tracking.
False
A search engine searches every page if each side on the WWW to determine matches.
False
A spider or a crawler is an electronic robot which is inside your computer
False
After a search engine has searched an index of the web, it provides the user with the results in alphabetical order.
False
Any four letter word can be transformed into any other four letter word using doublets
False
Currently yahoo is the most popular search engine
False
If we are using Insertion Sort to sort 100 bookshelves of 50 books each, then this takes 100 x 50 comparisons.
False
If we using Selection Sort to sort 10 bookshelves of 50 books each, then this takes 500^2 comparisons.
False
In general, an algorithm which requires linear work takes more time than an algorithm that takes quadratic work.
False
Is the following inequality TRUE or FALSE? Here N is a positive integer > 1
False
Links FROM a web page give more authority to the page than links TO the web page
False
Sorting a list of 100 items requires twice as much work as sorting a list of 50 items
False
The Authority and Hyperlink Tricks are enough to rank a web page.
False
The Merge Sort algorithm takes approximately (1000) ^2 comparisons to sort a list of length 1000
False
The idea of giving a website its ranking based solely on the number of other sites which link to it is a foolproof method for assigning the site authority ranking.
False
The internet and the World Wide Web were developed at the same time
False
To create a sorted list by merging two sorted lists of 10 items each takes the same amount fo time as creating a sorted list by merging two unsorted listed of 10 items each
False
Use the index below for 3 web pages to determine if the following statement is TRUE or FALSE The word MAT occurs on all three web pages
False
When you type in keywords in a browser, then the search engine checks every word of every web page and returns result
False
sorting a bookshelf with 100 books take the same amount of work as sorting ten bookshelves with 10 books each
False
At the first step of Bubble Sort for sorting books alphabetically by author for the list of authors {MacCormick, Fix, Strang, Dahlquist} we
Interchange Fix and MacCormick
In the room maze below suppose we start in room B and mark it with a "0" and mark its neighbors with a "1", etc. Then which rooms are marked with a "7"
L & E
Which algorithm typically takes the least amount of work to sort a list of size N?
Merge Sort
Which algorithm(s) typically take the least amount if work to sort a list of N items?
Merge Sort
Which of the following algorithms don't keep 2 lists - sorted and unsorted?
Merge Sort
Which of the following numbers is (are) larger than N? Here N is a positive integer > 1
N log(N) and N^2
Use the index below for 3 web pages to answer the following question. What page does the bigram PETS SAT occur?
Never occurs
Is the following a valid doublet? By Valid I mean that is follows all the rules of word ladders/ doublets ARMS - RAMS- MARS- MAPS
No
In the room maze below suppose we start in room B and mark it with a "0" and mark its neighbors with a "1", etc. Then which rooms are marked with a "4"
P & G
Suppose you have the word ladder: Change MAN to APE and so far you have MAN - MAY- PAY- PAT- PIT - ??? Based upon our heuristic rules which of the following is the best choice for the next word? PAT, NIT, PIE, or POT
PIE
Use the index below for 3 web pages to answer the following question. What page does the bigram SAT ON occur?
Page 1
Use the index below for 3 web pages to answer the following question. What page(s) is the word stood on?
Pages 2 &3
Which of the following sorts take the LEAST amount of work?
Sorting 10 bookshelves of 10 books each
In the doublet HEAD - HEAL- ???? - TELL - TALL- TAIL What is the missing word?
TEAL
A Search Engine such as the one Orbitz uses to help book flights & hotels is typically a lot simpler than one for searching the Web.
True
A hyperlink on a web page allows the user to jump from one web address to another without actually knowing the address of the second.
True
A spider typically starts its web search at a server
True
A web page which has the search words in the title is probably more important than one which doesn't.
True
Assume you are using Selection Sort to order a list of numbers from smallest to largest. When you have only one number left in the unsorted list then is will be the largest number in the original list.
True
Google Chrome is a browser
True
Google's PageMatch & PageRank algorithms propelled Google to be the most used search engine.
True
If there is a doublet that transforms HIT to COG, then there must be a doublet that transforms COG to HIT
True
If we are using Bubble sort to sort 20 bookshelves of 50 books each, then this takes 20 x (50^2) comparisons.
True
If we have used a maze map to determine the distance from A to all the other rooms, then to find the shortest path from room A to room W, we start a room W and work backwards
True
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
True
If you have unsorted data to search then the Brute Force approach is as efficient as any other method
True
If you want to search a list many times then it is more efficient to sort the list first
True
In a maze map, the shortest path is always the one that through the fewest number of rooms.
True
It is possible to rank objects without actually understanding their content.
True
Links on a web page provide a bridge to other web pages
True
One of the first uses of sorting information by the U.S government was for census data.
True
The PageRank algorithm uses an index of the WWW to rank pages.
True
The Random Surfer Trick is added to the Page Rank algorithm to avoid getting in an endless cycle of determining a web pages's rank.
True
The Word Latter MATS - BATS - BARS - BARN- BORN Is an example in which every step is a Greedy step
True
The following Word Latter was solved by using a Greedy step at each letter change. PAT - PIT - PIE - DIE
True
The insertion Sort algorithm which combines ideas from both Selection & Bubble sort ends when there is only one number in the unsorted list.
True
The three sorting algorithms -- selection, bubble, and insertion - all take approximately N^2 comparison to sort a list of length N.
True
There are no standard sorting algorithms which are linear in the amount of work required to sort a list of length N
True
Use the index below for 3 web pages to determine if the following statement is TRUE or FALSE The word MY only occurs in the title of the pages and not in the body.
True
Use the index below for 3 web pages to determine if the following statement is TRUE or FALSE The word PETS is on only one of the three pages
True
You have to use a browser to get to a search engine
True
in making an index of the web every distinct word on a page and its location is listed.
True
At the first step of Selection Sort for sorting books alphabetically by author for the list of authors {MacCormick, Fix, Strang, Dahlquist} we
interchange the books by Dahlquist and MacCormick
Which number is the smallest
log(100)
Suppose you are sorting the list of numbers { 14, 21, 4, 51, 16 } from the smallest to the largest. At the end of the first loop of Bubble Sort what does the list look like? Recall that at each loop we compare adjacent items.
{ 14, 4, 21, 16, 51}
Suppose you are sorting the list of numbers { 14, 21, 4, 51, 16 } from the smallest to the largest. At the end of the first step of Selection sort what is the unsorted list?
{ 21, 14, 51, 16 }
Assume you are using Bubble sort to alphabetize a list of animals. At the end of a loop you have the following { antelope, giraffe, zebra, elephant, lion } What is the list at the end of the next loop? Recall that in a loop of Bubble sort we compare all adjacent items starting at the beginning of the list.
{ antelope, giraffe, elephant, lion, zebra, }
Suppose you are using Selection Sort to alphabetize a list of birds and at the end of a loop you have the following: Sorted list: { cardinal, finch } Unsorted list: { wren, jay, vulture, grosbeak } Then at the end of the next loop what is your sorted list?
{ cardinal, finch, grosbeak }
Suppose you are using Insertion Sort to alphabetize a list of birds and at the end of a loop you have the following: Sorted list: { cardinal, jay } Unsorted list: { wren, grosbeak, vulture, finch } Then at the end of the next loop what is your sorted list?
{ cardinal, grosbeak, jay }
Suppose you are using Bubble Sort to alphabetize a list of birds and at the end of a loop you have the following list: { cardinal, jay, wren, grosbeak, vulture, finch } What is the list after you complete another loop? (That is, you go through all the items in the list).
{ cardinal, jay, grosbeak, vulture, finch, wren }
