data structures by neso

Introduction to Data Structures

11:18

Introduction to Data Structures
Types of Data Structures

4:28

Types of Data Structures
Queues | Chapter-7 | Data Structures | nesoacademy.org

1:28

Queues | Chapter-7 | Data Structures | nesoacademy.org
Introduction to Programming and Data Structures

9:52

Introduction to Programming and Data Structures
AVL Trees | Chapter-10 | Data Structures | nesoacademy.org

1:10

AVL Trees | Chapter-10 | Data Structures | nesoacademy.org
Introduction to Linked List

6:21

Introduction to Linked List
Linked List Implementation of Stacks (Part 1)

9:24

Linked List Implementation of Stacks (Part 1)
Basics of Asymptotic Analysis (Part 1)

6:32

Basics of Asymptotic Analysis (Part 1)
Introduction to Stacks

8:34

Introduction to Stacks
Structures and Functions (Part 1)

7:11

Structures and Functions (Part 1)
Creating a Single Linked List (Part 2)

7:00

Creating a Single Linked List (Part 2)
Creating the Node of a Single Linked List

6:00

Creating the Node of a Single Linked List
Introduction to Circular Linked List

4:29

Introduction to Circular Linked List
Stacks (Program 1) – Part 1

16:27

Stacks (Program 1) – Part 1
Array Implementation of Stacks (Part 1)

10:00

Array Implementation of Stacks (Part 1)
Creating a Single Linked List (Part 1)

4:37

Creating a Single Linked List (Part 1)
Array vs. Single Linked List (In Terms of Representation)

4:10

Array vs. Single Linked List (In Terms of Representation)
Basics of Asymptotic Analysis (Part 3)

9:50

Basics of Asymptotic Analysis (Part 3)
Array Implementation of Stacks (Part 2)

11:01

Array Implementation of Stacks (Part 2)
Introduction to Doubly Linked List

3:03

Introduction to Doubly Linked List
Linked List Implementation of Stacks (Part 2)

11:49

Linked List Implementation of Stacks (Part 2)
Basics of Dynamic Memory Allocation

4:18

Basics of Dynamic Memory Allocation
Data Structure Definition & Advantages

3:53

Data Structure Definition & Advantages
Introduction to Data Models

16:24

Introduction to Data Models
Introduction to Relational Data Model

6:53

Introduction to Relational Data Model
Array Implementation of Stacks (Part 4)

15:47

Array Implementation of Stacks (Part 4)
Database System Architecture - Part 1

14:33

Database System Architecture - Part 1
Asymptotic Analysis (Solved Problem 1)

7:23

Asymptotic Analysis (Solved Problem 1)
Basics of Asymptotic Analysis (Part 4)

7:44

Basics of Asymptotic Analysis (Part 4)
Data Types vs. Abstract Data Types

7:51

Data Types vs. Abstract Data Types
Binary Trees | Chapter-8 | Data Structures | nesoacademy.org

3:04

Binary Trees | Chapter-8 | Data Structures | nesoacademy.org
Linked List Implementation of Stacks (Part 3)

11:46

Linked List Implementation of Stacks (Part 3)
Database Design Process

11:20

Database Design Process
Introduction to Data Encryption Standard (DES)

8:18

Introduction to Data Encryption Standard (DES)
Application of Stacks (Infix to Postfix) - Part 6

18:49

Application of Stacks (Infix to Postfix) - Part 6
Stacks (Program 4) – Part 6

14:25

Stacks (Program 4) – Part 6
Inserting the Data at the Beginning of Single Linked List (2nd Method)

3:47

Inserting the Data at the Beginning of Single Linked List (2nd Method)
Application of Stacks (Infix to Postfix) - Part 1

10:33

Application of Stacks (Infix to Postfix) - Part 1
Guidelines for Asymptotic Analysis (Part 1)

5:04

Guidelines for Asymptotic Analysis (Part 1)
Single Linked List (Inserting a Node at a Certain Position)

6:52

Single Linked List (Inserting a Node at a Certain Position)
Basics of Asymptotic Analysis (Part 2)

3:10

Basics of Asymptotic Analysis (Part 2)
Traversing the List (Linked List vs. Arrays)

4:00

Traversing the List (Linked List vs. Arrays)
Understanding the Void Pointers

4:19

Understanding the Void Pointers
Application of Stacks (Infix to Postfix) - Part 2

13:42

Application of Stacks (Infix to Postfix) - Part 2
Single Linked List (Inserting a Node at the Beginning)

5:37

Single Linked List (Inserting a Node at the Beginning)
Dynamic Memory Allocation using realloc()

4:52

Dynamic Memory Allocation using realloc()
Dynamic Memory Allocation using calloc()

2:06

Dynamic Memory Allocation using calloc()
Application of Linked List (Addition of Two Polynomials)

17:29

Application of Linked List (Addition of Two Polynomials)
Application of Linked List (Polynomial Arithmetic) - Part 1

4:14

Application of Linked List (Polynomial Arithmetic) - Part 1
Application of Stacks (Nested Brackets) - Part 1

19:01

Application of Stacks (Nested Brackets) - Part 1
Binary Search Trees | Chapter-9 | Data Structures | nesoacademy.org

1:09

Binary Search Trees | Chapter-9 | Data Structures | nesoacademy.org
Introduction to Algorithms

6:54

Introduction to Algorithms
Basics of Asymptotic Analysis (Part 5)

12:15

Basics of Asymptotic Analysis (Part 5)
Fundamental Data Types − Integer (Part 1)

7:40

Fundamental Data Types − Integer (Part 1)
Application of Stacks (Infix to Postfix) - Part 4

11:47

Application of Stacks (Infix to Postfix) - Part 4
Stacks (Program 2) – Part 2

11:47

Stacks (Program 2) – Part 2
Stacks (Program 4) – Part 5

11:58

Stacks (Program 4) – Part 5
Self Referential Structures

6:20

Self Referential Structures
Insertion at the End (Linked List vs. Array) - Part 1

7:35

Insertion at the End (Linked List vs. Array) - Part 1
Introduction to Functions in C

5:22

Introduction to Functions in C