Professor in Computer Science Department. Teach many Computer Science subjects and written books on subjects like C, C++, Data Structure, Ja

Setu Maheshwari

It tells you why we need Link List, what it's memory arrangment, how algorithms for link list are created and later on how they can be converted to programs

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) Link List (It's Concept and Algorithms) For Engineering (CS)

Algorithms

CS & IT

GATE - CSIT, DSAI & Interview Preparation

GATE, ESE and IIT-JAM

Ace the toughest competitive and government exams in India 

Test Preparation

This lesson explains that what is the significance of having a Data Structure . It tells you how it is not possible to use computer without DS

What is Data Structures and Why It is Required (in Hindi)

Why to have Link List as a Data Structure, what are the benefits and how it saves huge memory wastage by stopping External Fragmentation will be covered under this lesson.

Why we need Link List (What are the limitations of Stack and Queue (in Hindi)

How Link List is organised in memory and how different data elements are connected to each other will be covered under this lesson and what are the set of Operations comes under Link List.

Link List Memory Arrangement and Set of Operations (in Hindi)

Link List Traversal, Concept and how to create an algorithm for Traversal Operation is the content of this lesson.

Traversal of Link List (in Hindi)

How to do Insertion in the Beginning, it's Concept and construction of algorithm is content of this lesson.

Insertion in the Beginning (in Hindi)

This lesson is dedicated to Insert an Element into the last of Link List. It contains Concept, Logic and Algorithm Construction.

Insertion at Last in Link List (in Hindi)

How to Insert a node after a node containing a specific data given by user can be learned in this lesson. Theory, concept and algorithm construction.

Insert After Specific Data (in Hindi)

Insert before a node containing a specific data or insert at a position given by user is explained in this lesson.
ALL THE BEST

Insert Before Given Data (in Hindi)

This lesson is dedicated to deletion operation. Delete from beginning, delete from last, delete at random positions, delete after or before data all cases are discussed deeply in this lesson.

Deletion in Link List (in Hindi)

Types of Link List- Circular, Doubly, Doubly Circular and their comparisons with each other, their drawbacks and benefits with respect to each other is discussed under this lesson.

Types of Link List and Their Comparison (in Hindi)

Want to outperform? I am there to help you out! I am a student of NIT Durgapur and an ardent follower of programming and Machine Learning

Abhishek Karn

This course is about Bit Manipulations. In my course Abhishek Karn will be teaching the concepts of bit manipulations and use them to solve some amazing problems with the help of those concepts. The topics learnt in this course will also help students to apply these concepts while solving programming contest's problems and will also prepare them for this topic for software companies' interviews.

Bit Manipulation

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

Shivangi Garg

Its about different binary trees, there properties, how to traverse them and many operations associated with binary tree.

Binary Tree

Currently pursuing  Btech in CSE from GGSIPU. Love coding, teaching and participating in many coding competitions. 

Nipun Vats

Covering the first topic "Asymptomatic Analysis of Algorithms" of the chapter "algorithms"

(Hindi) Asymptomatic Analysis of Algorithms for GATE/IES

Jyoti Jha

This course is for those students who are preparing for GATE and BSc in computer .

(Hindi) Data Structures and Algorithms: GATE

AWS Cloud Support Associate(Networking); B.Tech-IT from Maharaja Surajmal Institute of Technology.

Payal Gupta

Learning Sorting is a fundamental step in learning Algorithms. Here's your chance to learn how to perform: Introduction to Sorting Linear Search Binary Search Bubble Sort Insertion Sort Selection Sort Heap Sort Bucket Sort Radix Sort Count Sort Quick Sort

Sorting: GATE (CS and IT)

🌟 Bachelor’s degree in Computer engineering 🌟 CGPA 9.14 🌟 GATE qualified 🌟 Unacademy Verified Educator 🌟 Software engineer 🌟 CS Passionate 🌟

Nisha Sajnani

Understand Sorting algorithms using examples, find it's worst and best case complexity. Additionally we'll cover PYQs on Sorting

Lessons

10 lessons • 2h

Invalid Date

NaN

What is Data Structures and Why It is Required (in Hindi)

Invalid Date

NaN

Why we need Link List (What are the limitations of Stack and Queue (in Hindi)

Invalid Date

NaN

Link List Memory Arrangement and Set of Operations (in Hindi)

Invalid Date

NaN

Traversal of Link List (in Hindi)

Invalid Date

NaN

Insertion in the Beginning (in Hindi)

Invalid Date

NaN

Insertion at Last in Link List (in Hindi)

Invalid Date

NaN

Insert After Specific Data (in Hindi)

Invalid Date

NaN

Insert Before Given Data (in Hindi)

Invalid Date

NaN

Deletion in Link List (in Hindi)

Invalid Date

NaN

Types of Link List and Their Comparison (in Hindi)