Algorithm Analysis Courses and Certifications

NPTEL;  IIT Kharagpur

Fundamental Algorithms - Design and Analysis

This course provides an introduction to mathematical modeling of computational problems. It covers the common algorithms, algorithmic paradigms, and data structures used to solve these problems.

• YouTube
• 10 hours
• On-Demand
• Free Video

ADVANCED DATA STRUCTURES & ALGORITHMS IN JAVA

Master advanced data structures, algorithms, and abstract data types in Java. Develop ADTs, analyze complexity, and explore sorting, trees, graphs, and more.

• California Community Colleges System
• 11 weeks, 4-5 hours a week
• 23rd Sep, 2024
• Paid Course

ADVANCED DATA STRUCTURES & ALGORITHMS IN PYTHON

Master advanced Python data structures, algorithms, and software design for large-scale programs. Explore dynamic memory, inheritance, recursion, and complex data structures like trees and graphs.

• California Community Colleges System
• 11 weeks, 4-5 hours a week
• 23rd Sep, 2024
• Paid Course

Java Essential Training for Students

88 ratings at LinkedIn Learning

Taking a college-level programming course? Maximize your learning with these Java tutorials.

• LinkedIn Learning
• 3-4 hours
• On-Demand
• Free Trial Available

Chhattisgarh Swami Vivekanand Technical University;  IGNOU

Foundations of Algorithmic Problem-Solving A Comprehensive Approach

Comprehensive approach to algorithmic problem-solving, covering design techniques, analysis, and practical applications. Equips learners with essential skills for solving complex problems efficiently.

• Swayam
• 12 weeks
• On-Demand
• Free Online Course

Design And Analysis Of Algorithm

Master algorithm design and analysis through sorting, searching, dynamic programming, backtracking, and complexity theory. Learn practical problem-solving techniques and optimization strategies for efficient solutions.

• Swayam
• 12 weeks
• On-Demand
• Free Online Course

Learn about the usefulness and efficiency of computational sorting by implementing different sorting algorithms yourself.

• Codecademy
• 3 hours
• On-Demand
• Free Trial Available

Algorithms: Sorting and Searching Course (How To)

119-minute Computer Science course: This course will look at algorithms in two categories: sorting and searching. We'll implement well-known sortin...

• Treehouse
• 1 hour 59 minutes
• On-Demand
• Free Trial Available

Yannic Kilcher

Improving Intrinsic Exploration with Language Abstractions - Machine Learning Paper Explained

Explores using natural language to improve reinforcement learning agents' exploration in sparse-reward environments, demonstrating significant performance gains across challenging tasks in MiniGrid and MiniHack.

• YouTube
• 42 minutes
• On-Demand
• Free Video

Aleksa Gordić - The AI Epiphany

Graph SAGE - Inductive Representation Learning on Large Graphs - GNN Paper Explained

Deep dive into Graph SAGE, exploring its innovative approach to large-scale graph learning. Covers key concepts, training methods, aggregator functions, and comparisons with other graph neural networks.

• YouTube
• 44 minutes
• On-Demand
• Free Video

Big O Notation - Full Course

Comprehensive guide to Big O Notation, covering various time complexities, algorithms like binary search and merge sort, and space complexity, with practical coding examples.

• freeCodeCamp
• 1-2 hours
• On-Demand
• Free Video

Tech with Tim

BigO Notation and Time Complexity Tutorial - Code Efficiency and Algorithm Analysis

Learn to analyze algorithm efficiency using BigO notation and time complexity. Gain skills to write better code, choose optimal algorithms, and improve overall programming performance.

• YouTube
• 46 minutes
• On-Demand
• Free Video

Simons Institute

Finding Large Cliques in Random and Semi-Random Graphs

Explore algorithms for finding large cliques in graphs, including constructive arguments, polynomial-time proofs, and paradigms for tackling this NP-hard problem.

• YouTube
• 1 hour
• On-Demand
• Free Video

Simons Institute

Computational Barriers in Statistical Estimation and Learning

Explore statistical estimation challenges, information theory, and computational barriers in high-dimensional settings with Stanford's Andrea Montanari in this Richard M. Karp Distinguished Lecture.

• YouTube
• 1 hour 3 minutes
• On-Demand
• Free Video

Simple Snippets

Binary Search Tree Data Structure - How BST Has O(log N) Time Complexity for Searching? - DSA

Comprehensive exploration of Binary Search Trees, covering structure, time complexity analysis, and comparisons with linear data types. Ideal for understanding BST efficiency.

• YouTube
• 39 minutes
• On-Demand
• Free Video