CSE student ,Engineer by passion, learner by skills and education is power for me.


Nishant Balayan

This course is based is on second year undergraduate computer science course.
In this course we are going to look at basic Algorithms used in computer science like greedy algorithms, dynamic programming....  We are going to look at algorithm design, application of our algorithm, and implementation in CPP but these algorithms can also be implemented in other programming languages with little or no effort. Each and every algorithm is presented with examples.

GATE (Graduate Aptitude Test in Engineering) 2020 & 2021 complete preparation with best educators. Know about the detailed syllabus, best books, exam pattern and dates, previous year question papers a

GATE - Iconic Pro

English

Algorithms

CS & IT

GATE - CSIT, DSAI & Interview Preparation

GATE, ESE and IIT-JAM

Ace the toughest competitive and government exams in India 

Test Preparation

This is course overview video.
This video will make you familiar with course syllabus.

Introduction to Course

In this lesson we are going to look at binary search algorithm.

Binary Search

In this lesson we will look at merge sort algorithm.

Merge Sort Algorithm

In this lesson we will look at Quick sort Algorithm

Quick Sort

In this lesson we will look at Finding minimum and maximum elements of a given array and then we will look at finding minimum distance of closest pair of points

Finding Minimum and Maximum, Closest Pair of Points

In this lesson we are going to look at Huffman coding...This encoding is also used by ZIP and other compression tools.

Huffmann Coding

In this lesson we are going to look at fractional knapsack (greedy approach).

Knapsack (Fractional) Knapsack

In this lesson we will look at what is Dynamic Programming approach. How we classify a problem as Dynamic Programming problem and how to solve a dynamic programming problem.

Dynamic programming

In this lesson we will look at Generating permutations of a given string.

Generating Permutations

In this lesson we will look at N Queens Problem.

N Queens problem

Code HELLOSONU01 | 8+ Years Teaching Exp. in GATE CS IT & GATE DS AI on Unacademy | Mentored 2 Lakh+ Students | Produced Rankers Under 500

Sweta Kumari

This course will cover Artificial Neural Networks in just 60 Minutes with full package.

(Hindi) Artificial Neural Networks in 60 Minutes

This course has discussed Sorting Algorithms with Complexities, working and some FAQs. The course will be beneficial for Engineering students and GATE aspirants.

(Hindi) Short Tricks to Remember Complexities of Sorting Algorithms

This course will cover dynamic Programming solution for Matrix Chain Multiplication and Longest Common Subsequence.

(Hindi) Dynamic Programming : MCM & LCS

This course will cover Asymptotic Analysis Of Algorithms with short notes targeted for GATE Aspirants.

(Hindi) Asymptotic Analysis Of Algorithms in 40 Minutes - GATE 2019

This course will cover Searching Algorithms Like Linear , Binary & Interpolation Search for  GATE CS/IT.

(Hindi) Searching Algorithms : Linear , Binary & Interpolation Search - GATE CS/IT

This course will cover 100 Short Tricks To Learn Complexities of Algorithms Easily. This Course is beneficial for  GATE (CS and IT) aspirants.

Lessons

10 lessons • 1h 27m

Invalid Date

NaN

Introduction to Course

Invalid Date

NaN

Binary Search

Invalid Date

NaN

Merge Sort Algorithm

Invalid Date

NaN

Quick Sort

Invalid Date

NaN

Finding Minimum and Maximum, Closest Pair of Points

Invalid Date

NaN

Huffmann Coding

Invalid Date

NaN

Knapsack (Fractional) Knapsack

Invalid Date

NaN

Dynamic programming

Invalid Date

NaN

Generating Permutations

Invalid Date

NaN

N Queens problem