• Application Deadline
  • 28 days
    Duration

About

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?

The Algorithm Design and Analysis course, part of the Computer Science Essentials for Software Development Professional Certificate program from University of Pennsylvania - PennX, is an introduction to design and analysis of algorithms, and answers along the way these and many other interesting computational questions.

What you'll learn:

  • 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

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.

After completing this course you will be able to design efficient and correct algorithms using sophisticated data structures for complex computational tasks.

Detailed Programme Facts

  • Deadline and start date Application deadline and start date were not specified by the programme.
  • Programme intensity Part-time
    • Average part-time duration 28 days
    • Intensity 8 hrs/week
    • Part-time variant
      Flexible
    • Duration description
      4 weeks; 6-8 hours per week
  • Languages
    • English
  • Delivery mode
    Online
  • More information Go to the programme website

Programme Structure

Courses include:

  • Mathematical Preliminaries; Asymptotic analysis and recurrence relations; Sorting and Searching; Heaps and Binary Search Trees
  • Algorithm Design Paradigms - Divide-and-Conquer algorithms, Dynamic Programming, Greedy Algorithms
  • Graphs and graph traversals; minimum spanning trees; shortest paths

English Language Requirements

This programme may require students to demonstrate proficiency in English.

Academic Requirements

  • Discrete Mathematics - sets, functions, relations; proofs, and proofs by induction; Boolean logic
  • Basic probability
  • Basic knowledge of Java

Tuition Fee

  • International

    149 USD/full
    Tuition Fee
    Based on the original amount of 149 USD for the full programme and a duration of 28 days.
  • National

    149 USD/full
    Tuition Fee
    Based on the original amount of 149 USD for the full programme and a duration of 28 days.
We've labeled the tuition fee that applies to you because we think you are from and prefer over other currencies.
5% discount coupon: Z7LZNQ4TN3B2JTWU valid for any free course + certificate upgrade

Funding

Check the programme website for information about funding options.

StudyPortals Tip: Students can search online for independent or external scholarships that can help fund their studies. Check the scholarships to see whether you are eligible to apply. Many scholarships are either merit-based or needs-based.

The Global Study Awards: get funded with up to £10,000 to study abroad

Together with the ISIC Association and British Council IELTS, Studyportals offers you the chance to receive up to £10000 to expand your horizon and study abroad. We want to ultimately encourage you to study abroad in order to experience and explore new countries, cultures and languages.