Course details

Essential Algorithms for IT professionals

A brief summary

This course will go through commonly used algorithms and their usage. It will provide general idea about these algorithms and will provide examples to understand them better. It will also discuss how to convert problems into an algorithm task and finally it will give overview on how to solve algorithm problems in programming contest websites.

Course highlight

  • A complete course for learning Algorithm & Problem solving
  • Covers data structure, number theory and geometry as well
  • Tutorial on how to solve problem in contest websites
  • Practical example and exercise to learn the concepts

What you will learn

You will learn what is algorithm and what is their usefulness. You will learn about basic and advance algorithms as well as useful number theory, geometry and data data structure concepts that is used in conjunction with various algorithm problems. You will also learn about algorithm problem solving in programming contest websites and how to improve in these platforms.


01

Introduction to Algorithm

In this section we will learn what is algorithm and why it is useful. We will also learn about time & space complexity, control structure etc.

02

Sorting Algorithms

In this section we will check sorting algorithms in detail and we will go through Bubble Sort, Selection Sort, Insertion Sort, Counting Sort, Merge Sort, Quick Sort, Heap Sort

03

Searching Algorithms

We will about various search techniques such as Linear search, Binary search, Ternary search and we will see where we can apply then to solve algorithm problems.

04

Basic Number Theory

In conjunction to algorithms, we most of the time need to apply the concepts of number theory so solve our problem efficiently. Here will learn about some of such number theories such as: Prime number and Sieve, Prime Factorization, Number of divisors and Sum of divisors, GCD, LCM, Modulo arithmetic, Big Mod, Euler Phi etc.

05

Important Basic Data Structures and STL

In this section we will learn about Link List, Stack, Queue, Deque, Graph, Tree, Hash table, Segment-tree, Histogram problem, STL etc and learn their application.

06

Graph Algorithms

We will see some important graph algorithms such as : BFS, DFS, Shortest Path algorithms, MST and practice these on example.

07

Basic recursion and dynamic programming

In this lesson we will learn about Factorial and Fibonacci series with recursion, Permutation and combinations, Coin Change DP, LIS and LCS

08

Greedy algorithms

Here we will learn some greedy algorithms such as: a. Introduction to different greedy algorithms, Activity Selection Problem, Interval Partitioning Problem with examples.

09

Basic Geometry

We will also check some basic geometry concepts that we might need such as : Line, Triangle, Circle


Next Batches

No upcoming batches available.
Back to top