Review_Package_Solutions_W11

Seeds whatisadirectedgraph

Info iconThis preview shows page 1. Sign up to view the full content.

View Full Document Right Arrow Icon
This is the end of the preview. Sign up to access the rest of the document.

Unformatted text preview: 3: 4, 32, 70 Pg9; 4: 13, 31, 45, 68 Pg13; 4: 3, 10, 26, 51 Pg17; 3: 24, 28, 44 Pg19; 5: 9, 10, 32, 44, 76 Pg20; 2: 32, 45 Pg22; 3: 23, 30, 38 Pg27; 4: 4, 19, 32, 73 Pg29; 5: 10, 17, 24, 28, 44 Pg32; 3: 32, 44, 56 Provided the above information, find the resulting postings list when searching for all occurrences of the phrase “Computer Science Rocks” Computer Science Rocks 2 Pg 8 Pg 22 Given the following pages: Pg1 How much wood could a woodchuck chuck Pg2 If a woodchuck could chuck wood Pg3 He could chuck all the wood that Pg4 a woodchuck could chuck if a woodchuck Pg5 could chuck wood Make a postings list for the words wood, chuck, could, and woodchuck. Wood4 Chuck5 Could5 Woodchuck3 Pg1;1:3 Pg1:1:7 Pg1:1:4 Pg1:1:6 Pg2;1:6 Pg2;1:5 Pg2;1:4 Pg2;1:3 Pg3;1:6 Pg3;1:3 Pg3;1:2 Pg4;2:2,7 Pg5;1:3 Pg4;1:4 Pg4;1:3 Pg5;1:2 Pg5;1:1 Boolean Logic and Querying For the following Venn diagrams, give the query that would return the pages represented by the shaded areas: ((Bunny and Hamster) or Hedgehog) and not (Bunny and Hamster and Hedgehog) (Ninja or Assassin) and not ((Ninja and Assassin) and not Spy) ((Banana and Berries) and not PB) or ((Berries and PB) and not Banana) Using the Venn diagram below, name the corresponding segments that would be filled in by the following queries: a. (Daisy or Pansy or Lily) and not ((Daisy and Pansy) and not Lily) 1,3,4,5,6,7 b. (Daisy and Pansy and Lily) or (Lily and not (Daisy or Pansy)) 5,7 c. (Daisy and not (Pansy or Lily)) or ((Pansy and Lily) and not Daisy) 1,6 Crawling Answer the following questions: What do we call the pages on which web crawlers usually start on? Seeds What is a directed graph? A set of objects called nodes and a set of directed edges connecting two or more nodes Describe an Algorithm for Breadth First Traversal Put all seeds into Queue Prepare to keep a list of visited Nodes (initially empty) As long as the Queue is not empty: Remove the first node from the Queue Append that node to the list of visited nodes For each...
View Full Document

This document was uploaded on 04/01/2014.

Ask a homework question - tutors are online