Description

Type

Training
Level

Intermediate
Methodology

Online
Class hours

30h
Duration

Flexible

Start date

Different dates available
Online campus

Yes
Delivery of study materials

Yes
Support service

Yes
Virtual classes

Yes

Introduction to fundamental techniques for designing and analyzing algorithms, includes;
Asymptotic complexity, O() notation
Sorting and search
Algorithms on graphs: exploration, connectivity, shortest paths, directed acyclic graphs, spanning trees
Design techniques: divide and conquer, greedy, dynamic programming
Data structures: heaps, union of disjoint sets, search trees.

Facilities

Online

Start date

Different dates availableEnrolment now open

Questions & Answers

Add your question

Our advisors and other users will be able to reply to you

Who would you like to address this question to?

All
Students
Centre

Fill in your details to get a reply

We will only publish your name and question

Reviews

Subjects

Algorithms
Professional
Management
Analysis
Computer
Analytical
Quantitative
Project
Assignments
Dynamic programming
Exploration
Connectivity

Course programme

LIFETIME ACCESS TO RECORDINGS OF SESSIONS
REAL-TIME PROJECTS & ASSIGNMENTS
CERTIFICATE & BADGE OF COURSE COMPLETION

See related categories

Contact us

ALGORITHMS

Questions & Answers

Reviews

Subjects

Course programme

Add similar courses
and compare them to help you choose.

ALGORITHMS

Questions & Answers

Reviews

Subjects

Course programme

Add similar coursesand compare them to help you choose.

Add similar courses
and compare them to help you choose.