CS502 Assignment 3 Solution
#1

CS502 Design and Analysis of Algorithms
Assignment 3 Solution - Spring 2017

Question. 1  Consider the following Directed Acyclic Graph.
[Image: dvLRV2c.jpg]

Run BFS on this graph by taking node ‘1’ as source node and list the vertices in order while running BFS.
 
Note: Write a list of vertices only, no need to show the intermediate steps.

Answer: 1, 3, 4, 8

Question. 2
 
Two directed graphs are given below Graph (A) & Graph (B), You are required to answer the following questions
1.      Is “Graph (A)” a connected graph? State Yes / No with valid reason
2.      Is “Graph (B)” contains a Hamiltonian cycle? State Yes / No with valid reason
 
 [Image: w3zvPmJ.png][Image: yAxKbmk.png]

                        Graph (A)                                                                                Graph (B)


Answer:

  1. No, because 1 is not connected with 5 directly and also 5 is not connected with 3 directly.
  2. Yes, 1, 2, 3, 4, 1 creates a Hamiltonian cycle.
Reply
#2

Dove Comprare Priligy Originale
Reply
#3

<a href=https://buypropeciaon.com/>Propecia</a>
Reply
#4

3 Clomid Depuis Mois Deja
Reply
#5

Online Pharmacy Europ No Prescription
Reply
#6

http://buypriligyhop.com/ - Priligy
Reply


Possibly Related Threads…
Thread / Author Replies Views Last Post
Last Post by Priligy
Yesterday, 03:16 AM
Last Post by reewmella
09-18-2021, 11:22 PM
Last Post by Plaquenil
09-17-2021, 03:22 PM
Last Post by Ambusasob
09-09-2021, 03:21 AM



Users browsing this thread: 1 Guest(s)