Scribd
Upload
157 views1 page

Stanford Algorithms Course Completion

Steven Ward successfully completed a free online course provided by Stanford University through Coursera titled "Algorithms: Design and Analysis, Part 1". The course covered topics like asymptotic analysis, divide and conquer algorithms, sorting and searching, basic randomized algorithms, graph search, shortest paths, heaps, search trees, and hash tables. The course was associated with Stanford University and taught by Associate Professor of Computer Science Tim Roughgarden, but was an online course and not equivalent to an on-campus course from Stanford.

Uploaded by

sgw67
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
157 views1 page

Stanford Algorithms Course Completion

Steven Ward successfully completed a free online course provided by Stanford University through Coursera titled "Algorithms: Design and Analysis, Part 1". The course covered topics like asymptotic analysis, divide and conquer algorithms, sorting and searching, basic randomized algorithms, graph search, shortest paths, heaps, search trees, and hash tables. The course was associated with Stanford University and taught by Associate Professor of Computer Science Tim Roughgarden, but was an online course and not equivalent to an on-campus course from Stanford.

Uploaded by

sgw67
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd

MARCH 26, 2013

Online Course
Statement of Accomplishment

STEVEN WARD
HAS SUCCESSFULLY COMPLETED A FREE ONLINE OFFERING OF THE FOLLOWING COURSE
PROVIDED BY STANFORD UNIVERSITY THROUGH COURSERA INC.

Algorithms: Design and Analysis,


Part 1
This is an undergraduate course on the design and analysis of
algorithms. The main topics are: asymptotic analysis, divide and
conquer algorithms, sorting and searching, basic randomized
algorithms, graph search, shortest paths, heaps, search trees, and
hash tables.

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.

You might also like