SophiaPretty

(5)

$14/per page/Negotiable

About SophiaPretty

Levels Tought:
Elementary,Middle School,High School,College,University,PHD

Expertise:
Accounting,Algebra See all
Accounting,Algebra,Applied Sciences,Architecture and Design,Art & Design,Biology,Business & Finance,Calculus,Chemistry,Communications,Computer Science,Economics,Engineering,English,Environmental science,Essay writing Hide all
Teaching Since: Jul 2017
Last Sign in: 304 Weeks Ago, 2 Days Ago
Questions Answered: 15833
Tutorials Posted: 15827

Education

  • MBA,PHD, Juris Doctor
    Strayer,Devery,Harvard University
    Mar-1995 - Mar-2002

Experience

  • Manager Planning
    WalMart
    Mar-2001 - Feb-2009

Category > Computer Science Posted 04 Dec 2017 My Price 8.00

Napster servers, as discussed in lecture, do not store

Homework 3

14 questions

1.

Napster servers, as discussed in lecture, do not store which of

the following? (1 point)

1

point

Files

File pointers, i.e., (????lename, peer address) pairs

Addresses of other Napster servers

Addresses of some of the peers (clients)

Homework 3 | Coursera https://www.coursera.org/learn/cloud-computing/...

1 of 10 09/27/2016 03:34 PM

2.

Which of the following Gnutella messages is reverse-routed? (1

point)

1

point

QueryHit

Ping

Giv

Pull

3.

In BitTorrent, a new leecher is downloading a ????le with 5 blocks

(B1 through B5). The leecher has 3 neighbors X, Y, and Z. These

neighbor peers have the following blocks: X: (B1, B2, B3, B4). Y:

(B1, B3, B4, B5). Z: (B1, B3, B5). Which of the following blocks

does the leecher prefer downloading ????rst? (1 point)

1

point

B2

B5

B4

B1

Homework 3 | Coursera https://www.coursera.org/learn/cloud-computing/...

2 of 10 09/27/2016 03:34 PM

4.

A Pastry DHT has a peer P with the following neighbors. P

currently has to route a query to key 101001011010. Which of

the following neighbors is the best next-hop for this query? (1

point)

1

point

101101011010

101001011000

101001011111

111001011010

5.

In a Pastry DHT that is locality-aware, the path of a query is

very likely to: (1 point)

1

point

Take equal-sized network jumps in its early hops and

in its later hops

Take short network jumps in its early hops and long

network jumps in later hops.

None of the above.

Take random-sized network jumps throughout its

path

1

point

Homework 3 | Coursera https://www.coursera.org/learn/cloud-computing/...

3 of 10 09/27/2016 03:34 PM

6.

A Gnutella topology looks like a balanced ternary tree with 5

levels of nodes, i.e., peers. Thus, there is 1 root at Level 1,

which has 3 children at Level 2, which each have 3 children at

Level 3, which in turn each have 3 children at Level 4, which in

turn each have 3 children at Level 5 – thus, there are a total of

121 nodes.

If the root node (Level 1) sends a Query message with TTL=3,

then what are the number of nodes receiving the Query

message, not including the originating node? Enter your

answer as a numeric value in the text box below. (1 point)

Enter answer here

7.

1

point

Answers

SophiaPretty
(5)
Status NEW Posted 04 Dec 2017 02:12 PM My Price 8.00

-----------  ----------- H-----------ell-----------o S-----------ir/-----------Mad-----------am ----------- Th-----------ank----------- yo-----------u f-----------or -----------you-----------r i-----------nte-----------res-----------t a-----------nd -----------buy-----------ing----------- my----------- po-----------ste-----------d s-----------olu-----------tio-----------n. -----------Ple-----------ase----------- pi-----------ng -----------me -----------on -----------cha-----------t I----------- am----------- on-----------lin-----------e o-----------r i-----------nbo-----------x m-----------e a----------- me-----------ssa-----------ge -----------I w-----------ill----------- be----------- qu-----------ick-----------ly

Not Rated(0)