I am pursuing my B.Tech in the field of computer science at Gayatri Vidya Parishad college of engineering for women.

Hari Priya Kodela

This course discusses all the non-primitive data structures and the operations performed on them with examples and algorithms. The course also takes you through the searching and sorting techniques.

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 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

Overview of the course data structures and the operations that can be performed on the non primitive data structures.

Introduction (in Hindi)

Basics of arrays where you can learn how to declare and initialize an array and reading the input of an array from keyboard and a code to read and print the elements of an array.

Arrays (in Hindi)

Traversing , inserting  and searching operations on arrays with algorithms and examples.

Operations on Arrays: Part 1 (in Hindi)

Deleting , Merging and sorting operations on arrays and also the applications on arrays.

Operations on Arrays: Part 2(in Hindi)

Linked list , maintaining linked lists in memory ,  memory allocation and deallocation and differences between linked list and arrays.

Linked list (in Hindi)

Singly linked list , traversing and searching operations on singly linked list with examples and algorithms.

Singly linled list

Insertions on singly linked list with algorithms and examples.

Singly linked list

Deletions on singly linked list with algorithms and examples.

Circular linked list and insertion operation on it with algorithms and examples.

Circular linked list (part 1)

Deletions on circular linked list with algorithms and examples.

Circular linked list (part 2)

Doubly linked list and insertion operation on them with algorithms and examples.

Doubly linked list

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

11 lessons • 2h 20m

Invalid Date

NaN

Introduction (in Hindi)

Invalid Date

NaN

Arrays (in Hindi)

Invalid Date

NaN

Operations on Arrays: Part 1 (in Hindi)

Invalid Date

NaN

Operations on Arrays: Part 2(in Hindi)

Invalid Date

NaN

Linked list (in Hindi)

Invalid Date

NaN

Singly linled list

Invalid Date

NaN

Singly linked list

Invalid Date

NaN

Singly linked list

Invalid Date

NaN

Circular linked list (part 1)

Invalid Date

NaN

Circular linked list (part 2)

+ See all lessons