Docsity
Log inSign up
Docsity
Prepare for your exams
Prepare for your exams

Study with the several resources on Docsity

Earn points to download
Earn points to download

Earn points by helping other students or get them with a premium plan

Guidelines and tips
Guidelines and tips
Sell on Docsity
Sell on Docsity
Docsity AI
Docsity AI
Log inSign up

Prepare for your exams

Study with the several resources on Docsity

Find documents

Prepare for your exams with the study notes shared by other students like you on Docsity

Search for your university

Find the specific documents for your university's exams

Docsity AINEW

Summarize your documents, ask them questions, convert them into quizzes and concept maps

Explore questions

Clear up your doubts by reading the answers to questions asked by your fellow students

Earn points to download

Earn points by helping other students or get them with a premium plan

Share documents
download point icon20 Points

For each uploaded document

Answer questions
download point icon5 Points

For each given answer (max 1 per day)

All the ways to get free points
Get points immediately

Choose a premium plan with all the points you need

Study Opportunities

Choose your next study program

Get in touch with the best universities in the world. Search through thousands of universities and official partners

Community

Ask the community

Ask the community for help and clear up your study doubts

Free resources

Our save-the-student-ebooks!

Download our free guides on studying techniques, anxiety management strategies, and thesis advice from Docsity tutors

Directed Graph, Tree Edges-Fundamentals of Algorithms-Assignment, Exercises of Algorithms and Programming

Baddi University of Emerging Sciences and TechnologiesAlgorithms and Programming

I am student at Baddi University of Emerging Sciences and Technologies. To help my friends in other universities, I am uploading my assignments of different courses. Its for Advanced Fundamentals of Algorithms course. Other can see if they are searching following: Fundamental, Algorithms, Directed, Graph, Vertex, Source, Tree, Edges, Adjacency, List

Typology: Exercises

2011/2012

Uploaded on 08/01/2012

parmitaaaaa
parmitaaaaa 🇮🇳

4.2

(111)

173 documents

1 / 1

Toggle sidebar

This page cannot be seen from the preview

Don't miss anything!

bg1
CS 502 Fundamental of Algorithms
Assignment # 04
Spring 2012 Total Marks = 20
Deadline
Your assignment must be uploaded / submitted before or on June 19, 2012
Upload Instructions
Please view the assignment submission process document provided to you by the
Virtual University.
Rules for Marking
Please note that your assignment will not be graded if:
• It is submitted after due date
• The file you uploaded does not open
• The file you uploaded is copied from someone else or from internet
• It is in some format other than .doc
Note: Material that is an exact copy from handouts or internet would be graded
Zero marks. Your solution should consist of the material found through
different sources and written in your own words.
Assignment Statements:
Question:
Give an example of a directed graph G = (V, E), a source
vertex s V, and a set of tree edges Eπ ⊆ E such that for each
vertex v V, the unique path in the graph (V, Eπ) from s to v is
a shortest path in G, yet the set of edges Eπ cannot be
produced by running BFS on G, no matter how the vertices
are ordered in each adjacency list.
docsity.com

Partial preview of the text

Download Directed Graph, Tree Edges-Fundamentals of Algorithms-Assignment and more Exercises Algorithms and Programming in PDF only on Docsity!

CS 502 Fundamental of Algorithms

Assignment # 04

Spring 2012

Total Marks = 20

Deadline

Your assignment must be uploaded / submitted before or on June 19, 2012

Upload Instructions

Please view the assignment submission process document provided to you by the Virtual University.

Rules for Marking

Please note that your assignment will not be graded if:

  • It is submitted after due date
  • The file you uploaded does not open
  • The file you uploaded is copied from someone else or from internet
  • It is in some format other than .doc

Note: Material that is an exact copy from handouts or internet would be graded Zero marks. Your solution should consist of the material found through different sources and written in your own words.

Assignment Statements:

Question:

Give an example of a directed graph G = (V, E), a source vertex s V, and a set of tree edges E π ⊆ E such that for each vertex v V, the unique path in the graph (V, E π ) from s to v is a shortest path in G, yet the set of edges E π cannot be produced by running BFS on G, no matter how the vertices are ordered in each adjacency list.

docsity.com