Questions and information are in the attachment. There is a total of 4 questions to answer.First question is about Depth First Search algorithm.Second question is about Breadth First Search algorithm.The third question is about LCS.and also there is the fourth question.

cse310_2018s_hw05.pdf

Unformatted Attachment Preview

Don't use plagiarized sources. Get Your Custom Essay on

Data Structures and Algorithms

Just from $13/Page

CSE310 HW05, Thursday, 04/19/2018, Due: Thursday, 04/26/2018

Please note that you have to typeset your assignment using either LATEX or Microsoft

Word, and produce a PDF file for submission. Hand-written assignment (or photo of

it) will not be graded. You need to submit an electronic version (in PDF form) on the

blackboard. You should name your file using the format CSE310-HW05-LastNameFirstName.

1. (20 points) Figure 1 shows a directed graph G. Assume that the adjacency list lists the

edges in alphabetical order.

B

A

E

G

D

C

H

F

Figure 1: Graph for P1.

(a) Apply depth first search (DFS) to graph G, and show the discovery and finish times

of each vertex. In the main-loop of DFS, check the vertices in alphabetical

order. You can write the results on the graph in Figure 1.

(b) Draw the DFS tree obtained.

(c) Draw the transpose graph GT of the graph in Figure 1. The vertices are given for your

convenience.

B

A

E

G

D

C

F

1

H

(d) Apply DFS to GT to compute the strongly connected components. You need to show

the strongly connected components and indicate the order they are computed.

2. (10 points) This problem assumes an undirected graph obtained by ignoring the directions

of the graph in Figure 1. Assume that we perform breadth first search (BFS) on this graph,

starting at vertex A.

(a) Show the set of vertices L0 , L1 , L2 , L3 .

(b) Draw the resulting BFS tree.

3. (10 points) You are given two sequences X = AST U and Y = ASU T Z. Use dynamic

programming to compute the LCS of X and Y .

(a) Fill out the 20 entries in the following table. For each of the entries, you need to show

both the value and the arrow.

j

0

i

0

0

1

A

0

2

S

0

3

T

0

4

U

0

1

2

3

4

5

A

S

U

T

Z

0

0

0

0

0

(b) What is the LCS computed according to the table?

4. (10 points) We want to use dynamic programming to compute the optimal ordering for computing the chain of 6 matrices: A1 A2 A3 A4 A5 A6 , where Ai has pi-1 rows and pi columns.

Suppose that p0 = 10, p1 = 5, p2 = 20, p3 = 6, p4 = 30, p5 = 7, p6 = 100.

(a) Compute the entries m[i, j] and s[i, j] as shown in the lecture slides.

(b) Add parenthesise to show the optimal ordering.

2

…

Purchase answer to see full

attachment

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.

Professional and Experienced Academic Writers

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.

24/7 Customer Support

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!

How it works?

Follow these simple steps to get your paper done

Place your order

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

Proceed with the payment

Choose the payment system that suits you most.

Receive the final file

Once your paper is ready, we will email it to you.

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.

Essays

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.

Admissions

Admission Essays & Business Writing Help

An admission essay is an essay or other written statement by a candidate, often a potential student enrolling in a college, university, or graduate school. You can be rest assurred that through our service we will write the best admission essay for you.

Reviews

Editing Support

Our academic writers and editors make the necessary changes to your paper so that it is polished. We also format your document by correctly quoting the sources and creating reference lists in the formats APA, Harvard, MLA, Chicago / Turabian.

Reviews

Revision Support

If you think your paper could be improved, you can request a review. In this case, your paper will be checked by the writer or assigned to an editor. You can use this option as many times as you see fit. This is free because we want you to be completely satisfied with the service offered.