Engineer | Computer Science | Keeping things simple - O(1)

Shivangi Garg

In this course, Shivangi Garg discusses data structures like stacks, queue, tree etc. He takes you through the different derived types.

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

Hindi

(Hindi) Learn Derived Types

Algorithms

CS & IT

GATE - CSIT, DSAI & Interview Preparation

GATE, ESE and IIT-JAM

Ace the toughest competitive and government exams in India 

Test Preparation

Overview (in Hindi)

How to declare, define and initialize a structure. Memory representation of structure.

Structure Part-1 (in Hindi)

How to access structure with pointer and without pointer.

Structure Part-2 (in Hindi)

Structure Part-3 (in Hindi)

What are self referrential structure and unions.

Self Referential Structure/ Unions (in Hindi)

Different types of data structure and operation it can perform.

Introduction to Data Structure (in Hindi)

Three operation of stack, add, delete and display.

Stacks (Hindi)

Queues (Hindi)

Drawback of linear queue and trees and its traversing.

Circular queue / Trees (Hindi)

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

9 lessons • 1h 17m

Invalid Date

NaN

Overview (in Hindi)

Invalid Date

NaN

Structure Part-1 (in Hindi)

Invalid Date

NaN

Structure Part-2 (in Hindi)

Invalid Date

NaN

Structure Part-3 (in Hindi)

Invalid Date

NaN

Self Referential Structure/ Unions (in Hindi)

Invalid Date

NaN

Introduction to Data Structure (in Hindi)

Invalid Date

NaN

Stacks (Hindi)

Invalid Date

NaN

Queues (Hindi)

Invalid Date

NaN

Circular queue / Trees (Hindi)