Software Developer| Share knowledge to gain knowledge




Shraddha S K

It has a detailed description of many important concepts of data structures like graphs trees etc

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

Introduction to Data Structures

Algorithms

CS & IT

GATE - CSIT, DSAI & Interview Preparation

GATE, ESE and IIT-JAM

Ace the toughest competitive and government exams in India 

Test Preparation

It contains a brief description about classification of data structures

Classification of Data Structures

Detailed description about stacks and queues

Stacks and Queues

Non-Linear Data Structure - Trees

Non-Linear Data Structures: Graphs

Brief description about arrays and linked lists

Arrays and Linked Lists

Contains a detailed description about push and pop operations using an example

Push() and pop examples

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

6 lessons • 42m

Invalid Date

NaN

Classification of Data Structures

Invalid Date

NaN

Stacks and Queues

Invalid Date

NaN

Non-Linear Data Structure - Trees

Invalid Date

NaN

Non-Linear Data Structures: Graphs

Invalid Date

NaN

Arrays and Linked Lists

Invalid Date

NaN

Push() and pop examples