currently working as a Software engineer in an IT company, has completed M. Tech in cyber security and have a keen interest to step to the w

Geethika S Gireesh

Notion of algorithm, fundamentals of algorithmic problem solving, important problem types, fundamental data structures.

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

Design and Analysis of Algorithm

Algorithms

CS & IT

GATE - CSIT, DSAI & Interview Preparation

GATE, ESE and IIT-JAM

Ace the toughest competitive and government exams in India 

Test Preparation

The Need to study algorithm, Notion of algorithm, example and questions to do.

Introduction To Design And Analysis Of Algorithm

Fundamentals of algorithmic problem solving which includes the eight steps required to solve the problem appropriately and to design an algorithm well.

Fundamentals Of Algorithmic Problem Solving

This consist of seven common and most important problems that arise in design and analysis of algorithm.

Important Problem Types For Design And Analysis Of Algorithm

Basic data structures used array, linked list, stack queue in algorithm design in a nutshell.

Fundamental Data Structures

Types and representations of a graph and trees.

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

5 lessons • 1h 3m

Invalid Date

NaN

Introduction To Design And Analysis Of Algorithm

Invalid Date

NaN

Fundamentals Of Algorithmic Problem Solving

Invalid Date

NaN

Important Problem Types For Design And Analysis Of Algorithm

Invalid Date

NaN

Fundamental Data Structures

Invalid Date

NaN

Important Problem Types For Design And Analysis Of Algorithm