Information Technology
Star icon
Most Popular
Hands on Training icon
Hands On Training
Star icon
Hands on Training icon

Shortest Paths Revisited, NP-Complete Problems and What To Do About Them

Course Cover
compare button icon

Course Features

icon

Duration

14 hours

icon

Delivery Method

Online

icon

Available on

Limited Access

icon

Accessibility

Mobile, Desktop, Laptop

icon

Language

English

icon

Subtitles

English

icon

Level

Intermediate

icon

Teaching Type

Self Paced

icon

Video Content

14 hours

Course Description

This section of the specialization focuses on the shortest paths (Bellman Ford, Floyd-Warshall and Johnson), NP-completeness (and what it means to the algorithm designer) and strategies for coping computationally difficult problems (analysis and heuristics and local search).

Course Overview

projects-img

Hands-On Training,Instructor-Moderated Discussions

projects-img

Case Studies, Captstone Projects

Skills You Will Gain

What You Will Learn

You will gain knowledge on Algorithms

You will gain knowledge on Data Structure

You will gain knowledge on Dynamic Programming

You will gain knowledge on Np-Completeness

Course Cover