Scribd Logo
Importer

Bienvenue sur Scribd !

  • Algorithms Design and Analysis (Part 2)

    Transféré par

    andryalfred94
    19 vues1 page
    Alfred Andry successfully completed an online course through Coursera provided by Stanford University titled "Algorithms: Design and Analysis, Part 2" taught by Tim Roughgarden. The course covered greedy algorithms, dynamic programming applications, and exact and approximation algorithms for NP-complete problems. This statement of accomplishment does not confer a Stanford University grade, credit, or degree.

    Description originale:

    Certifications

    Copyright

    © © All Rights Reserved

    Formats disponibles

    PDF, TXT ou lisez en ligne sur Scribd

    Avez-vous trouvé ce document utile ?

    Ce contenu est-il inapproprié ?

    Signaler ce document
    Alfred Andry successfully completed an online course through Coursera provided by Stanford University titled "Algorithms: Design and Analysis, Part 2" taught by Tim Roughgarden. The course covered greedy algorithms, dynamic programming applications, and exact and approximation algorithms for NP-complete problems. This statement of accomplishment does not confer a Stanford University grade, credit, or degree.

    Droits d'auteur :

    © All Rights Reserved
    Téléchargez comme PDF, TXT ou lisez en ligne sur Scribd
    Signaler comme contenu inapproprié
    19 vues1 page

    Algorithms Design and Analysis (Part 2)

    Transféré par

    andryalfred94
    Alfred Andry successfully completed an online course through Coursera provided by Stanford University titled "Algorithms: Design and Analysis, Part 2" taught by Tim Roughgarden. The course covered greedy algorithms, dynamic programming applications, and exact and approximation algorithms for NP-complete problems. This statement of accomplishment does not confer a Stanford University grade, credit, or degree.

    Droits d'auteur :

    © All Rights Reserved
    Téléchargez comme PDF, TXT ou lisez en ligne sur Scribd
    Signaler comme contenu inapproprié
    sur 1

    FEBRUARY 16, 2013

    Online Course Statement of Accomplishment

    ALFRED ANDRY
    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 covered 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.

    Vous aimerez peut-être aussi