cs502 assignment no 3 spring 2020

Please read the following instructions carefully before solving & submitting assignment:

It should be clear that your assignment will not get any credit  if:

·         The assignment is submitted after due date.

·         The submitted assignment does not open or file corrupt.

·         The assignment is full or partially copied from (other student or ditto copy from handouts or internet).

·         Student ID is not mentioned in the assignment File or name of file is other than student ID.

·         The assignment is not submitted in .doc or .docx format.

Uploading instructions

Your submission must include: 

·         Assignment should be in .doc or .docx format.

·         Save your assignment with your ID (e.g. bx180200786.doc).

Assignment submission through email is NOT acceptable

Objective

The objective of this assignment is

• To build an understanding of relationship between Graphs and algorithms.
• To develop the understanding of DFS algorithm application on a directed graph for computing shortest path.

Note:

Your answer must follow the below given specifications.

·          Font style: “Times New Roman”

·          Font color: “Black”

·          Font size: “12”

·          Bold for heading only.

·          Font in Italic is not allowed at all.

·          No formatting or bullets are allowed to use.

·         Your answer should be precise and to the point, avoid irrelevant detail.

Lectures Covered: This assignment covers Lecture # 23-30

Deadline

Your assignment must be uploaded/submitted at or before 03/08/2020.

Assignment Statement:

Consider the following directed graph and answer the questions.