Description

The course covers basic algorithmic techniques and ideas for computational problems arising frequently in practical applications: sorting and searching, divide and conquer, greedy algorithms, dynamic programming.

You will learn a lot of theory: how to sort data and how it helps for searching. How to break a large problem into pieces and solve them recursively and it makes sense to proceed greedily. 

This course contains of these below mentioned topic:

  • Recursion.
  • Algorithm run time analysis
  • Arrays
  • Stack
  • Linked list
  • Data Structure
  • Binary Tree
  • Binary Search Tree
  • AVL Tree
  • Heap tree
  • Queue
  • Sorting
  • Hash Table
  • Graph Theory
  • Magic Framework
  • Computer Programming
  • Dynamic Programming

Who this course is for:

  • Beginner who have little programming experience , willing to learn and pursue data science career.

Requirements

  • Basic computer programming
  • Basic Mathematics knowledge
Enroll Now

Leave a Reply