This preview shows page 1. Sign up to view the full content.
Unformatted text preview: n nodes has exactly n-1 number of arcs. 6. What is your level of knowledge on Greedy algorithms (in a scale of 1-5, low to high)? 7. Do you know of any Dynamic programming algorithm? (If yes name it.) 8. Do you know of any algorithm for finding Minimum spanning tree in a graph? (If yes name it.) 9. Are you familiar with any Divide and conquer algorithm? (If yes describe it briefly.) 10. Describe the significance of an NP-hard problem? Name: E-mail:...
View Full Document
This note was uploaded on 02/10/2012 for the course CSE 5211 taught by Professor Dmitra during the Spring '12 term at FIT.
- Spring '12