Homework 3 Solutions 2019
First-page document preview for Homework 3 Solutions 2019 in CS 521: Data Structures and Algorithms I at Drexel University (Drexel). Inspect the first page below or request the complete PDF study document for free.
Independent study archive Learn more
Materials are uploaded by users for self-study purposes. PwnHero is an independent platform, not affiliated with, sponsored by, or endorsed by any university or institution.
University
Drexel University (Drexel)
Course
CS 521: Data Structures and Algorithms I
Format
Homework
Year
2019
📄 Page 1 Preview
Page 1 Key Topics & Excerpt
🔍 Text Transcript
First page excerpt for quick study reference. Complete formulas, diagrams, and subsequent pages are available in the full document.
PwnHero
CS 521: Data Structures and Algorithms I
Fall 2019 (Homework 3)
1. (15 Pts.) Give an algorithm that determines whether or not a given undi-
rected graph G = (V, E) contains a cycle, your algorithm should run in
O(|V |) time, independent of |E|.
Solution: Run a modified version of DFS where…