Latest Courses
Snowflake[A-Z] Zero to Hero Masterclass(Core+SQL+API+Visual)Check course
Accelerate Freight Broker Training By Shayla MooreCheck course
Learn Multithreading in C++Check course
Double Your Donations & Succeed at FundraisingCheck course
Facebook Authorization with NodeCheck course
Build a Math Quiz iOS Game, no coding, source code includedCheck course
Java Reflection - Master ClassCheck course
Learn How to Make an Ecommerce Website with WordpressCheck course
SAP MDG - Data Replication Framework (DRF) for beginnersCheck course
Matplotlib for Data Visualization with PythonCheck course
Snowflake[A-Z] Zero to Hero Masterclass(Core+SQL+API+Visual)Check course
Accelerate Freight Broker Training By Shayla MooreCheck course
Learn Multithreading in C++Check course
Double Your Donations & Succeed at FundraisingCheck course
Facebook Authorization with NodeCheck course
Algorithm Design and Analysis

Algorithm Design and Analysis

FREE

Add your review
Add to wishlistAdded to wishlistRemoved from wishlist 0
Add to compare
8.2/10 (Our Score)
Product is rated as #62 in category Data Structures and Algorithms

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. After completing this course you will be able to design efficient and correct algorithms using sophisticated data structures for complex computational tasks.

Instructor Details

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. In his work on massive data set algorithms, Sampath explores what can be computed efficiently, and what is not computable. He is also interested in program checking, a paradigm for ensuring the correctness of a program by observing its behavior at run-time, and in algorithmic problems in computational biology, particularly the problem of reconstructing the evolutionary history of a set of species from phenotypic and molecular sequence observations.

Specification: Algorithm Design and Analysis

Duration 28 hours
Year 2020
Level Intermediate
Certificate Yes
Quizzes No

1 review for Algorithm Design and Analysis

4.0 out of 5
0
1
0
0
0
Write a review
Show all Most Helpful Highest Rating Lowest Rating
  1. Avatar

    Anonymous

    I am a Ph.D student. And I want to developed myself.I am a Ph.D student. And I want to developed myself.I am a Ph.D student. And I want to developed myself.I am a Ph.D student. And I want to developed myself.I am a Ph.D student. And I want to developed myself.I am a Ph.D student. And I want to developed myself.I am a Ph.D student. And I want to developed myself.I am a Ph.D student. And I want to developed myself.I am a Ph.D student. And I want to developed myself.I am a Ph.D student. And I want to developed myself.I am a Ph.D student. And I want to developed myself.

    Helpful(0) Unhelpful(0)You have already voted this

    Add a review

    Your email address will not be published. Required fields are marked *

    This site uses Akismet to reduce spam. Learn how your comment data is processed.

    Price tracking

    Register New Account
    Reset Password
    Compare items
    • Total (0)
    Compare