Active educationalist and advocate of value based education system.Has Earned B.E, M.Tech in CSE, NET, has 10+ Years of Teaching Experience

Prof  Abdul Majeed K M

In this course, the educator explain about basic Data Structures like Arrays, Structures, Pointers,and introductions of Stack,Queeus,linked lists,trees etc ,
This course also includes the Classifications, Uses, Operation and Applications of 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

Data Structures - A Revision Tour

Algorithms

CS & IT

GATE - CSIT, DSAI & Interview Preparation

GATE, ESE and IIT-JAM

Ace the toughest competitive and government exams in India 

Test Preparation

What is Data Structures? Explain the Classification of Data Structures

Overview and Classification of Data Structures

What is arrays? How to declare and initialize arrays? Demonstrate how to read and display the content of arrays and matrix.

Arrays

What is Structures? How to declare and define structures? Discuss with an example.
Compare Arrays and Structures

Structures

What is pointers?Why it is used? How to declare and initialize pointer. Explain with an example

Pointers

Explain Dynamic Memory Management functions like malloc(),calloc() realloc() and free() with an example. Demonstrate the Implementation of Dynamic Arrays.

Dynamic memory Management Functions and Dynamic Arrays

What is nested structures and Array of structure.Explain with an example

Array of Structure

What is union? Why it is used? How to declare and initialize union? Explain with an example.
Compare Structure and Union

Union

Definition and applications of Stack, Queues,linked list and Tree

Overview of Stack,Queues,linked list 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

8 lessons • 1h 37m

Invalid Date

NaN

Overview and Classification of Data Structures

Invalid Date

NaN

Arrays

Invalid Date

NaN

Structures

Invalid Date

NaN

Pointers

Invalid Date

NaN

Dynamic memory Management Functions and Dynamic Arrays

Invalid Date

NaN

Array of Structure

Invalid Date

NaN

Union

Invalid Date

NaN

Overview of Stack,Queues,linked list and Trees