View source for Web Science/Part2: Emerging Web Properties/MoocIndex/Quizes

this is a collection of quiz questions for part 2 of the [[Web Science|Web Science MOOC]] until the part is not completely structured we need to collect the questions here.

__TOC__

== ideas for exercises ==
* generate small world graphs with 10, 100, 1000, 10000 and 100000 nodes and plot the diameter of them.
* plot the degree distribution on wikipedia
* plot the word distribution on wikipedia
* calculate different similarity measures on wikipedia articles
* fill out a diagram that has no description.

== reading diagrams ==
<quiz display=simple>
{Given this in-degree distribution:
{| class="wikitable"
|-
! 0 !! 1   !! 2 !! 3   !! 4  !! 5   !! 6  !! 7   !! 8  !! 9   !! 10 
|-
| 0 || 1 || 4  || 3 || 6 || 8 || 4  || 5 || 2  || 3 ||  0  
|}
How many nodes are in this network?
|type="[]"}
- 9
- 11
+ 36
||Correct answer: 0+1+4+3+6+8+4+5+2+3+0=36 nodes
- 55
- 184

{Given this in-degree distribution:
{| class="wikitable"
|-
! 0 !! 1   !! 2 !! 3   !! 4  !! 5   !! 6  !! 7   !! 8  !! 9   !! 10 
|-
| 0 || 1 || 4  || 3 || 6 || 8 || 4  || 5 || 2  || 3 ||  0  
|}
How many edges are in this network?
|type="[]"}
- 9
- 11
- 36
- 55
+ 184
||0*0+1*1+2*4+3*3+4*6+5*8+6*4+7*5+8*2+9*3+10*0 = 1+8+9+24+40+24+35+16+27 = 184 edges


{Why is an in-degree distribution of Web pages different from an out-degree distribution of Web pages?
|type="[]"}
- They are not different, but the same.
- Large numbers of out-degrees are less likely to occur than large numbers of in-degrees
+ Large numbers of in-degrees are less likely to occur than large numbers of out-degrees

{A logarithmic function, y=log x, appears as a straight line in...
|type="[]"}
- a standard diagramme
- a log plot
- a log-log plot
+ an exponential plot
- no kind of diagramme

{A complex polynom, e.g. y=3+x^1.5+x^7+x^11, appears as a straight line in... 
|type="[]"}
- a standard diagramme
- a log plot
+ a log-log plot
- an exponential plot
- no kind of diagramme

{Which of these statements are true?
|type="[]"}
- probabilities represent how often events have been observed in an experiment
+ a histogram represents how often events have been observed in an experiment
+ the values of a probability distribution add up to 1
- the values of a histogram add up to 1

{given a plot with a logarithmic y-axis which of the following is true?
|type="[]"}
- a curve that appears as a straight line in this plot represents a linear function
- a curve that appears as a straight line in this plot represents a logarithmic function
+ going from one numerical axis label to the next one can be achieved by multiplying the first label with a constant number
- going from one numerical axis label to the next one can be achieved by adding a constant number to the first label

{have a look at the following plot of functions <math>f</math> and <math>g</math>. Which of the following statements is true?
|type="[]"}
+ <math>g(x) = c * f(x)</math>
+ <math>g(x) = f(x) + f(x)</math>
- <math>g(x) = f(x)*f(x)</math>
- <math>g(x) = f(x) + c </math>




</quiz>

== modeling text in a vector space ==
<quiz display=simple>
{You have 10 documents consisting of 20 words how many base vectors do you need to represent the documents using TF-IDF scores?
|type="[]"}
- 10 (as many as documents)
+ 20 (as many as words)
- 30 (number of documents plus number of words)
- 200 (number of documents times number of words)

{map the following formulas to the metrics they represent
|type="[]"}
| Tanimoto Coefficient | Cosine Similarity
-- <math>\frac{A\cap B}{A \cup B}</math>
-- <math>\frac{A\cup B}{A \cap B}</math>
-+ <math>\frac{<\vec{a},\vec{b}>}{||\vec{a}||*||\vec{b}||}</math>
+- <math>\frac{|A\cap B|}{|A \cup B|}</math>
-- <math>\frac{|A\cup B|}{|A \cap B|}</math>
-+ <math>\frac{\sum_{i=1}^na_i b_i}{\sum_{i=1}^nb_ib_i\sum_{i=1}^na_ia_i}</math>

{given the following documents:  d1='''the web science class is the most interesting class at the university'''
d1='''we study web science all day long'''
map the following values
|type="[]"}
| tf(the) | df(the) | idf(the) | tf(web) | df(web) | idf(web) 
-----+ 1/2
------ 1/3
-++--- 1 
---++- 2
+----- 3

{Given the following Probabilities <math>P(a) = 0.1, P(b)=0.3, P(c) = 0.6</math> which of the following is true:
|type="[]"}
- '''a a a b b''' is more likely to occure than '''b b a a a'''
+ '''c c c b b''' is more likely to occure than '''b b a a a'''

{In the urn process for generating words the following words have been generated: a a b a b a a c which of the following statements is true:
|type="[]"}
- a new word '''d''' can be generated with a probability of 1/4
- a new word '''d''' can be generated with a probability of 1/8
+ a new word '''d''' can be generated with a probability of 1/9
- the probability of the next generated word to be '''a''' is 1 / 3 
- the probability of the next generated word to be '''a''' is 1 / 4 
+ the probability of the next generated word to be '''a''' is 2 / 3
- the probability of the next generated word to be '''a''' is 3 / 4
 
</quiz>

== properties of the web graph ==
resourcen: http://www9.org/w9cdrom/160/160.html graph structures on the web

<quiz display=simple>
{When modelling the world wide web as a graph what are the nodes?
|type="[]"}
+ a single Web page that can be retrieved via an http request
- a single Web site
- a single IP-address
+ every URL
- every URI

{Creating the adjacency matrix of the web graph what is true 
|type="[]"}
- the matrix is dense.
- the matrix is diagonalisable.
+ more than 95% of all entries in the matrix will be 0.
- Using the bellman ford algorithm we would not detect cycles.
- when squaring the matrix the amount of zero entries will increase.

{Which of the following statements are true about the Graph of Web pages
|type="[]"}
- pages are represented as edges
- the graph represents a scale free network
+ the strongly connected component represents a scale free network
- the degree distribution is similar to that from an Erdős–Rényi graph
- The Graph is connected
- Eventually every web page can be reached by clicking and following links
- The most central node can always be reached by clicking around
+ in consists of a bow tie structure.

{What is true for small world networks?
|type="[]"}
- Subway systems or the street system are important examples of small world networks.
- removing a random node decreases the average diameter of the network.
+ the diameter of the network grows proportional to the logarithm of the number of nodes.
- the diameter of the network grows proportional to the logarithm of of the logartighm of the number of nodes.
- if the graph has <math>N</math> nodes the average node degree is proportional to <math>Log N</math>
+ when picking two random nodes the path between them is about <math>log N</math>

{Which of the following is a definition of the diameter of a network?
|type="[]"}
- the average path length of the shortest path between two nodes is called the diameter.
+ the longest value from calculating the shortest path between all pairs of nodes is called the diameter.
- the highest node degree is called the diameter.
- the number of edges in the graph divided by the number of nodes is called the diameter.
- the average node degree is called the diameter.
</quiz>

== working with graphs ==
<quiz display=simple>
{You are given the adjecency matrix of the web graph. Which of the following statements holds true
|type="[]"}
+ the number of rows equals the number of columns
+ the number of rows equals the number of web pages
- the number of columns equals the number of links
- squaring the matrix has no effect
+ there will be as many non zero entries as there are links
- <math>a_{ij}=a_{ji}</math>
+ the matrix is not symmetric

{What is correct about the indegree and outdegree distribution of graphs
|type="[]"}
- the sum af all in degrees is smaller than the sum of all out degrees.
+ the sum of all in degrees equals the sum of all out degrees.
- the sum af all in degrees is bigger than the sum of all out degrees.
- the above statements depend on the kind data that are modeled in the graph.

{You are given the adjecency matrix A of the web graph. Which of the following statements about degree computations hold true?
|type="[]"}
+ <math>a_{ij}</math> encodes if there is a link from website <math>i</math> to web site <math>j</math>.
- <math>a_{ij}</math> is the indegree of <math>i</math> and the outdegree of web site <math>j</math>.
- <math>a_{ij}</math> is the indegree of <math>i</math> and the outdegree of web site <math>j</math>.
- <math>a_{ij}</math> encodes if there is a link from website <math>j</math> to web site <math>i</math>.
- none of the above.

{You are given the adjecency matrix A of the web graph. map the formulas to interpretations?
|type="[]"}
| <math>f_1=\sum_{i}a_{ij}</math> and | <math> f_2=\sum_{j}a_{ij}</math>
-+ gives the outdegree of website i
-- gives the outdegree of website j
-- gives the outdegree of website i
+- gives the indegree of website j
-- sum of entries in column i
+- sum of entries in column j
-+ sum of entries in row i
-- sum of entries in row j

{You are given the adjecency matrix A of the web graph. and let <math>\vec{e_i}</math> be the i-th base vector. What holds true?
|type="[]"}
+ <math>A\vec{e_i}</math> gives the <math>i</math>-th column
- <math>A\vec{e_i}</math> gives the <math>i</math>-th row
+ <math>A\vec{e_i}</math> encodes the pages linking to page <math>i</math>
- <math>A\vec{e_i}</math> encodes the pages page <math>i</math> links to.
- <math>\vec{e_i}^TA</math> gives the <math>i</math>-th colmn
+ <math>\vec{e_i}^TA</math> gives the <math>i</math>-th row
- <math>\vec{e_i}^TA</math> encodes the pages linking to page <math>i</math>
+ <math>\vec{e_i}^TA</math> encodes the pages page <math>i</math> links to.

{You are given the adjecency matrix A of the web graph. and let <math>\vec{e_i}</math> be the i-th base vector. Now you want to find websites that are similar to each other. Which of the following strategies would work?
|type="[]"}
- Using the Dijkstra Algorithm to calculate all shortest paths of length 2 starting from a given website and take them as similar.
- Using Breadth first search to calculate all shortest paths of length 2 starting from a given website and take them as similar.
- Using Bellman ford algorithm to calculate all shortest paths of length 2 starting from a given website and take them as similar.
+ for all pairs of rows interpret them as vectors and calculate the cosine similarity
+ for all pairs of colums interpret them as vectors and calculate the cosine similarity
+ use the following formula for all paris <math>i,j</math> of pages use <math>\frac{\sum_ka_{ki}a_{kj}}{(\sum_ka_{ki}a_{ki})(\sum_ka_{kj}a_{kj})}</math>
similarity measure when interpreting rows or colums as vectors and calculating the cosine similarity
- start from one website and do <math>k</math> random walks

File:Under_construction_icon-blue.svg


{Take the adjacency matrix of the largest strongly connected component of the web graph. Now you do a random walk starting at the page <math>i</math> which is encoded in your starting vector <math>\vec{v}</math>. Which of the following is true?
|type="[]"}
+ <math>\vec{v}=\vec{e_i}</math> where <math>\vec{e_i}</math> is the <math>i</math>-th base vector
+ <math>\vec{v}=\vec{e_i}</math> where <math>\vec{e_i}</math> encodes the <math>i</math>-th web page
- <math>(A^n\vec{v})_j</math> gives you the probability of being at page <math>j</math> after <math>n</math> steps in the random walk
|| no it is only proportional to the probability
- <math>(A^n\vec{v})</math> can be seen as being a probability distribution. Where each component is the probability to be at the page represented by this component after <math>n</math> steps in the random walk.
+ <math>/frac{(A^n\vec{v})}{||(A^n\vec{v})||}</math> can be seen as being a probability distribution. Where each component is the probability to be at the page represented by this component after <math>n</math> steps in the random walk.

{preferential attachment
|type="[]"}
+ cor

{eigenvalues
|type="[]"}
+ cor


</quiz>

== old questions ==
<quiz display=simple>
{Who has created the Web?
|type="[]"}
- Tim Berners-Lee
- Vint Cerf
- Al Gore
- W3C
- IEEE
+ Everyone
- Noone
</quiz>

<quiz display=simple>
{Which of the following items may constitute forces that might bring structure to the Web?
|type="[]"}
- Entropy
+ Collaborative work
+ Standards
+ Search engine behavior 
- Randomness of user behavior
+ Users imitating users
</quiz>

<quiz display=simple>
{Which of the following statements are true
|type="[]"}
- Descriptive models cannot predict the future
- Independent variables cannot be observed
+ The definition of dependent and independent variables depends on the creator of a model
- Predictive models describe causality
- observed correlations lead to good predictive models
</quiz>

<quiz display=simple>
{What do people produce on the Web and can be subject of scientific investigation and modelling?
|type="[]"}
+ Bookmarks
+ Classification
+ Colors
+ File extensions
+ Geolocations
+ Keywords, tags, hashtags
+ Likes
+ Metadata
+ Numbers
+ Playlists
+ Words
+ Other

{How can hyperlinks be reasonably modelled?
|type="[]"}
+ As a directed pair of two Web pages (links from .... to ...)
+ As a triplet of anchor text and two Web pages (using text for hyperlink ... links from ... to ... )
+ As a quadruplet of anchor text and two Web pages and target anchor name (using text for hyperlink ... links from ... to ... targeting anchor of name ...)
+ As a quintuplet of anchor text and two Web pages and target anchor name and link creator (using text for hyperlink ... links from ... to ... targeting anchor of name ... created by ...)
</quiz>

{{CourseCat}}