data structures by neso academy

Introduction to Data Structures

11:18

Introduction to Data Structures
Types of Data Structures

4:28

Types of Data Structures
Binary Search Trees | Chapter-9 | Data Structures | nesoacademy.org

1:09

Binary Search Trees | Chapter-9 | Data Structures | nesoacademy.org
Queues | Chapter-7 | Data Structures | nesoacademy.org

1:28

Queues | Chapter-7 | Data Structures | nesoacademy.org
Introduction to Linked List

6:21

Introduction to Linked List
Binary Trees | Chapter-8 | Data Structures | nesoacademy.org

3:04

Binary Trees | Chapter-8 | Data Structures | nesoacademy.org
Introduction to Programming and Data Structures

9:52

Introduction to Programming and Data Structures
Basics of Asymptotic Analysis (Part 1)

6:32

Basics of Asymptotic Analysis (Part 1)
Creating a Single Linked List (Part 2)

7:00

Creating a Single Linked List (Part 2)
Introduction to Stacks

8:34

Introduction to Stacks
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)
Application of Stacks (Infix to Postfix) - Part 1

10:33

Application of Stacks (Infix to Postfix) - Part 1
Linked List Implementation of Stacks (Part 1)

9:24

Linked List Implementation of Stacks (Part 1)
Data Types vs. Abstract Data Types

7:51

Data Types vs. Abstract Data Types
Creating a Single Linked List (Part 1)

4:37

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

6:00

Creating the Node of a Single Linked List
Array vs. Single Linked List (In Terms of Representation)

4:10

Array vs. Single Linked List (In Terms of Representation)
Introduction to Database Management Systems

11:03

Introduction to Database Management Systems
Introduction to Data Encryption Standard (DES)

8:18

Introduction to Data Encryption Standard (DES)
Linked List Implementation of Stacks (Part 2)

11:49

Linked List Implementation of Stacks (Part 2)
Application of Stacks (Infix to Postfix) - Part 6

18:49

Application of Stacks (Infix to Postfix) - Part 6
Array Implementation of Stacks (Part 2)

11:01

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

4:29

Introduction to Circular Linked List
Application of Stacks (Infix to Postfix) - Part 2

13:42

Application of Stacks (Infix to Postfix) - Part 2
Application of Linked List (Multiplication of Two Polynomials)

14:00

Application of Linked List (Multiplication of Two Polynomials)
The TCP/IP Protocol Suite

10:09

The TCP/IP Protocol Suite
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
Creating an Entire Doubly Linked List

7:01

Creating an Entire Doubly Linked List
Introduction to Doubly Linked List

3:03

Introduction to Doubly Linked List
Application of Stacks (Infix to Postfix) - Part 7

28:02

Application of Stacks (Infix to Postfix) - Part 7
Array Implementation of Stacks (Part 4)

15:47

Array Implementation of Stacks (Part 4)
Structures and Functions (Part 1)

7:11

Structures and Functions (Part 1)
Application of Linked List (Addition of Two Polynomials)

17:29

Application of Linked List (Addition of Two Polynomials)
Circular Singly Linked List (Insertion at the Beginning)

5:28

Circular Singly Linked List (Insertion at the Beginning)
Database Design Process

11:20

Database Design Process
Array Implementation of Stacks (Part 3)

10:08

Array Implementation of Stacks (Part 3)
Application of Stacks (Infix to Postfix) - Part 4

11:47

Application of Stacks (Infix to Postfix) - Part 4
Self Referential Structures

6:20

Self Referential Structures
Stacks (Program 4) – Part 1

10:22

Stacks (Program 4) – Part 1
Database System Architecture - Part 1

14:33

Database System Architecture - Part 1
Introduction to Data Models

16:24

Introduction to Data Models
C Programming – Features & The First C Program

14:58

C Programming – Features & The First C Program
Doubly Linked List (Insertion at the Beginning)

3:43

Doubly Linked List (Insertion at the Beginning)
Structures and Functions (Part 3)

2:48

Structures and Functions (Part 3)
Understanding the Void Pointers

4:19

Understanding the Void Pointers
Database Schema

8:39

Database Schema
Data Structure Definition & Advantages

3:53

Data Structure Definition & Advantages
Single Linked List (Inserting a Node at the Beginning)

5:37

Single Linked List (Inserting a Node at the Beginning)
AVL Trees | Chapter-10 | Data Structures | nesoacademy.org

1:10

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

6:54

Introduction to Algorithms
Stacks (Program 3)

12:32

Stacks (Program 3)
Dynamic Memory Allocation using realloc()

4:52

Dynamic Memory Allocation using realloc()
Fundamentals of Database Systems

6:25

Fundamentals of Database Systems
Dynamic Memory Allocation using calloc()

2:06

Dynamic Memory Allocation using calloc()
Basics of Dynamic Memory Allocation

4:18

Basics of Dynamic Memory Allocation
Stacks (Important Questions) – Set 1

6:23

Stacks (Important Questions) – Set 1
Single Linked List (Inserting a Node at the End)

5:48

Single Linked List (Inserting a Node at the End)
Database Languages and Software

12:14

Database Languages and Software