(Solved Homework): A social network graph (SNG) is a graph where each vertex is a person and each edge represents an acquaintance. In…

Don't use plagiarized sources. Get Your Custom Essay on
(Solved Homework): A social network graph (SNG) is a graph where each vertex is a person and each edge represents an acquaintance. In…
Get an essay WRITTEN FOR YOU, Plagiarism free, and by an EXPERT!

A social network graph (SNG) is a graph where each vertex is a person and each edge represents an acquaintance. In other words, an SNG is a graph showing who knows who. For example, in the graph shown on Figure 2, George knows Mary and John, Mary knows Christine, Peter and George, John knows Christine, Helen and George, Christine knows Mary and John, Helen knows John, Peter knows Mary. The degrees of separation measure how closely connected two people are in the graph. For example, John has 0 degrees of separation from himself, 1 degree of separation from Christine, 2 degrees of separation from Mary, and 3 degrees of separation from Peter. i. From among breadth-first search, depth-first search, iterative deepening search, and uniform cost search, which one(s) guarantee finding the correct number of degrees of separation between any two people in the graph? ii. For the SNG shown in Figure 2, draw the first three levels of the search tree, with John as the starting point (the first level of the tree is the root). Is there a one- to-one correspondence between nodes in the search tree and vertices in the SNG? Why, or why not? In your answer here, you should assume that the search algorithm does not try to avoid revisiting the same state. iii. Draw an SNG containing exactly 5 people, where at least two people have 4 degrees of separation between them. iv. Draw an SNG containing exactly 5 people, where all people have 1 degree of separation between them. v. CSE 5360 Only (5 point EC for CSE 4308): In an implementation of breadth-first search for finding degrees of separation, suppose that every node in the search tree takes 1KB of memory. Suppose that the SNG contains one million people. Outline (briefly but precisely) how to make sure that the memory required to store search tree nodes will not exceed 1GB (the correct answer can be described in one-two lines of text). In your answer here you are free to enhance/modify the breadth-first search implementation as you wish, as long as it remains breadth-first (a modification that, for example, converts breadth-first search into depth-first search or iterative deepening search is not allowed).

a) Breadth first search is the algorithm which gaurantees us in finding the correct number of degrees of separation between any two people in a SNG.

b)

john

|

———————————-

|                      |                   |

George     Christine      Helen

|                      |                   |

Mary           Mary

|

Peter

Yes, the tree is in one one correspondance with the diagram.

c)

Simply remove the helen as it is connected to John and connect it to Peter. Hence the degree between John and Helen will become 4.

Pages (550 words)
Approximate price: -

Why Work with Us

Top Quality and Well-Researched Papers

We always make sure that writers follow all your instructions precisely. You can choose your academic level: high school, college/university or professional, and we will assign a writer who has a respective degree.

We have a team of professional writers with experience in academic and business writing. Many are native speakers and able to perform any task for which you need help.

Free Unlimited Revisions

If you think we missed something, send your order for a free revision. You have 10 days to submit the order for review after you have received the final document. You can do this yourself after logging into your personal account or by contacting our support.

Prompt Delivery and 100% Money-Back-Guarantee

All papers are always delivered on time. In case we need more time to master your paper, we may contact you regarding the deadline extension. In case you cannot provide us with more time, a 100% refund is guaranteed.

Original & Confidential

We use several writing tools checks to ensure that all documents you receive are free from plagiarism. Our editors carefully review all quotations in the text. We also promise maximum confidentiality in all of our services.

Our support agents are available 24 hours a day 7 days a week and committed to providing you with the best customer experience. Get in touch whenever you need any assistance.

Try it now!

Calculate the price of your order

Total price:
\$0.00

How it works?

Fill in the order form and provide all details of your assignment.

Proceed with the payment

Choose the payment system that suits you most.

Our Services

No need to work on your paper at night. Sleep tight, we will cover your back. We offer all kinds of writing services.

Essay Writing Service

No matter what kind of academic paper you need and how urgent you need it, you are welcome to choose your academic level and the type of your paper at an affordable price. We take care of all your paper needs and give a 24/7 customer care support system.