The University of Pennsylvania is offering free online course on Algorithm Design and Analysis. In this four week course; applicants will learn about the core principles of computer science: algorithmic thinking and computational problem-solving.
After completing this course you will be able to design efficient and correct algorithms using sophisticated data structures for complex computational tasks. The course will start on July 24, 2017.
Course At A Glance
Length: 4 weeks
Effort: 6-8 hours pw
Subject: Computer Science
Institution: University of Pennsylvania and edx
Certificate Available: Yes, Add a Verified Certificate for $149
Session: Course Starts on July 24, 2017
The University of Pennsylvania is an Ivy League institution with 12 undergraduate, graduate and professional schools in Philadelphia, serving a diverse community of more than 20,000 students from around the world. Ranked consistently among the top ten universities in the United States, Penn dates its founding to 1740 and is often considered the first university to offer both graduate and undergraduate studies.
About This Course
How do you optimally encode a text file? How do you find shortest paths in a map? How do you design a communication network? How do you route data in a network? What are the limits of efficient computation?
This course, part of the Computer Science Essentials for Software Development Professional Certificate program, is an introduction to design and analysis of algorithms, and answers along the way these and many other interesting computational questions.
You will learn about algorithms that operate on common data structures, for instance sorting and searching; advanced design and analysis techniques such as dynamic programming and greedy algorithms; advanced graph algorithms such as minimum spanning trees and shortest paths; NP-completeness theory; and approximation algorithms.
Why Take This Course?
After completing this course you will be able to design efficient and correct algorithms using sophisticated data structures for complex computational tasks.
- How to represent data in ways that allow you to access it efficiently in the ways you need to
- How to analyze the efficiency of algorithms
- How to bootstrap solutions on small inputs into algorithmic solutions on bigger inputs
- Solutions to several classic optimization problems
- How to critically analyze whether a locally optimal approach (greedy) can provide a globally optimal solution to a problem
Sampath is the Henry Salvatori Professor and Department Chair in the Department of Computer and Information Science at the University of Pennsylvania. Sampath’s research spans several subfields in algorithms.
- Discrete Mathematics – sets, functions, relations; proofs, and proofs by induction; Boolean logic
- Basic probability
- Basic knowledge of computer programming (variables, functions, control flow)
How To Join This Course
- Go to the course website link
- Create an edX account to SignUp
- Choose “Register Now” to get started.
- EdX offers honor code certificates of achievement, verified certificates of achievement, and XSeries certificates of achievement. Currently, verified certificates are only available in some courses.
- Once applicant sign up for a course and activate their account, click on the Log In button on the edx.org homepage and type in their email address and edX password. This will take them to the dashboard, with access to each of their active courses. (Before a course begins, it will be listed on their dashboard but will not yet have a “view course” option.)