Certificate - Algorithms: Design and Analysis, Part 2
0 likes364 views
Feng Guo successfully completed an online course through Coursera titled "Algorithms: Design and Analysis, Part 2" provided by Stanford University. The course covered topics like greedy algorithms, dynamic programming, and exact and approximation algorithms for NP-complete problems. It was associated with Stanford University professor Tim Roughgarden but did not confer academic credit from Stanford.
1 of 1
Certificate - Algorithms: Design and Analysis, Part 2
- 1. NOVEMBER 02, 2013 Online Course Statement of Accomplishment FENG GUO HAS SUCCESSFULLY COMPLETED A FREE ONLINE OFFERING OF THE FOLLOWING COURSE PROVIDED BY STANFORD UNIVERSITY THROUGH COURSERA INC. Algorithms: Design and Analysis, Part 2 This course covers greedy algorithms, including applications to minimum spanning trees and Huffman codes; dynamic programming, including applications to sequence alignment and shortest-path problems; and exact and approximation algorithms for NP-complete problems. TIM ROUGHGARDEN ASSOCIATE PROFESSOR OF COMPUTER SCIENCE STANFORD UNIVERSITY PLEASE NOTE: SOME ONLINE COURSES MAY DRAW ON MATERIAL FROM COURSES TAUGHT ON CAMPUS BUT THEY ARE NOT EQUIVALENT TO ON-CAMPUS COURSES. THIS STATEMENT DOES NOT AFFIRM THAT THIS STUDENT WAS ENROLLED AS A STUDENT AT STANFORD UNIVERSITY IN ANY WAY. IT DOES NOT CONFER A STANFORD UNIVERSITY GRADE, COURSE CREDIT OR DEGREE, AND IT DOES NOT VERIFY THE IDENTITY OF THE STUDENT.