Short Course on Algorithms

  1. ​ Introduction to Python / C / C++ / Java

  2. Analysis of Algorithms

    • Asymptotic Analysis

    • Worst, Average and Best Cases

    • Space Complexity

  3. Data Structures in Brief

    • Arrays​

    • Stacks

    • Queue

    • Lists and Dictionaries

    • Linked Lists

    • Trees 

    • Graphs

  4. Recursion

    • Introduction​

    • Applications

    • Solving Recurrence Relations

  5. Searching and Sorting

    • Linear Search

    • Binary Search

    • Selection Sort

    • Bubble Sort

    • Insertion Sort

    • Merge Sort

    • Heap Sort

    • Quick Sort

    • Miscellaneous Problems ​

  6. Greedy Algorithms

    • Kruskal’s Minimum Spanning Tree Algorithm

    • Huffman Coding

    • Prim’s Minimum Spanning Tree Algorithm

    • Dijkstra’s Shortest Path Algorithm

    • Job Sequencing Problem

    • Knapsack Problem

    • Optimal Merge Patten

  7. Dynamic Programming

    • Fibonacci Series

    • Longest Common Subsequence

    • Matrix Chain Multiplication

    • 0/1 Knapsack

    • Sum of subsets

    • All pair shortest Path problem

    • Travelling Salesman Problem

    • Multistage Graph

  8. String Algorithms​​​

    • Anagram Problems

    • Palindrome Problems

  9. Backtracking

    • m Coloring Problem

    • Hamiltonian Cycle

  10. Divide and Conquer

    • Finding maximum and minimum element in an array​

    • Power of an element

    • Binary Search

    • Quick Sort

    • Merge Sort

    • Strassen's Matrix Multiplication

  11. Graph Algorithms

    • Graph and its representations

    • Breadth First Traversal and Depth First Traversal for a Graph​​

    • Minimum Spanning Tree

      • Prim’s Minimum Spanning Tree 

      • Kruskal’s Minimum Spanning Tree Algorithm

      • Applications

    • Shortest Path

      • Dijkstra’s shortest path algorithm

      • Bellman–Ford Algorithm

      • Floyd Warshall Algorithm

    • Connectivity​

      • Connectivity in a directed graph

      • Articulation Points (or Cut Vertices) in a Graph

      • Biconnected graph

      • Bridges in a graph

      • Eulerian path and circuit

    • Hard Problems:

      • Graph Coloring (Introduction and Applications)

      • Travelling Salesman Problem (Naive and Dynamic Programming)

      • Travelling Salesman Problem (Approximate using MST)

      • Hamiltonian Cycle

      • Vertex Cover Problem (Introduction and Approximate Algorithm)

      • K Centers Problem (Greedy Approximate Algorithm)

    • Maximum Flow:

      • Ford-Fulkerson Algorithm for Maximum Flow Problem

    • Miscellaneous Problems

  12. Branch and Bound

    • Introduction with 0/1 Knapsack

    • 8 puzzle Problem

    • Job Assignment Problem

    • N Queen Problem

    • Traveling Salesman Problem

  13. Miscellaneous Algorithms

© 2020 by tenbyten.io

  • LinkedIn Social Icon
  • Facebook Social Icon
  • Instagram Social Icon