MyPage is a personalized page based on your interests.The page is customized to help you to find content that matters you the most.


I'm not curious

Comprehensive Algorithms

Course Summary

This course provides a comprehensive overview of the concepts of algorithm analysis and development.


  • +

    Course Syllabus

    • Introduction to Algorithms
      • Course Overview
      • Growth of Functions
    • Sorting Algorithms
      • Insertion Sort
      • Counting Sort
      • Radix Sort
      • Merge Sort
    • Abstract Data Structures
      • Stacks
      • Queues
    • Binary Search Trees
      • Binary Search Tree Introduction
      • Searching Through a Binary Search Tree
      • How to Construct a Binary Search Tree
      • How to Delete a Node from a Binary Search Tree
      • Preorder Binary Tree Traversal
      • Postorder Binary Tree Traversal
    • Red Black Trees
      • Properties of Red Black Trees
      • Red Black Tree Traversal
      • How to Rotate a Red Black Tree Data Structure
      • How to Delete a Node from a Red Black Tree
    • Graph Algorithms
      • Hamiltonian vs Euler Paths
      • Prim's Algorithm
      • Breadth First Search
      • Depth First Search
    • Advanced Algorithms
      • Huffman Codes
      • Introduction to Greedy Algorithms
      • Greedy Algorithm for Shortest Path Problem
      • How to Develop a Good Hash Function


Course Fee:
USD 29

Course Type:

Self-Study

Course Status:

Active

Workload:

1 - 4 hours / week

Attended this course?

Back to Top

Awards & Accolades for MyTechLogy
Winner of
REDHERRING
Top 100 Asia
Finalist at SiTF Awards 2014 under the category Best Social & Community Product
Finalist at HR Vendor of the Year 2015 Awards under the category Best Learning Management System
Finalist at HR Vendor of the Year 2015 Awards under the category Best Talent Management Software
Hidden Image Url

Back to Top