+91 9029006464

₹0 0

Go to Cart
Login | Signup

₹1500
~~₹3000~~
50% off

114 Lectures
15 Hrs videos

Data Structures and Applications-Dr Babasaheb Ambedkar Technological University-Information Technology Engineering-SEM IV

Amol Adhangale
0 viewers

Requirements

No Records To Display

What am I going to get from this course?

No Records To Display

Total Chapters : 10 114 Videos

Introduction to Data Structure in JAVA

Introduction to Subject

Preview

2.36

Data and Information

Preview

6.35

Preview

8.09

Classification of Data Structures

Preview

6.18

Data Information

3.13

Classification of Data structure Diagram

4.01

Abstract Data Types

5.57

Operations on Data Structure

Preview

3.37

4.01

Stack

Introduction to Stack

Preview

5.01

Preview

4.13

Stack Empty,Full And Size

6.19

Peek,Push Element

9.51

4.44

Status Of The Stack

5.5

Object Of Class ArrayStack

3.19

Stack Linked List

Preview

3.33

Set Link And Set Data

Preview

4.12

Get Link And Get Data

Preview

3.18

3.03

4.53

4.49

2.44

5.07

LinkedStack Implement

6.31

Queue

Introduction to Queue

Preview

2.13

Queue Using Array

Preview

4.56

Queue Empty and Full

Preview

6.17

Size and Front Of Queue

5.53

Insert and Remove From Queue

12.1

Status Of QueueArray

4.47

Queue Using Linked List

3.41

Set Link Data and Get Link Data

5.04

Constructor and Queue Empty

4.1

Size,Insert and Remove Element,Front

11.49

Status Of Queue LinkedList

Preview

3.58

Queue Operations

Preview

10.52

Inrtoduction To Circular Queue

Preview

1.34

Constructor Of Circular Queue

3.38

Push of Circular Queue

6.09

Pop of Circular Queue

3.29

Display of Circular Queue

2.4

Operations of Circular Queue

11.44

Preview

2.08

Task Constructor

Preview

4.2

Priority Queue Constructor and Clear

Preview

3.13

IsEmpty,IsFull and Size

3.43

Insert Priority Queue

4.54

Insert@Remove From Priority Queue

6.46

Linked List

Introduction to Linked List

Preview

2.46

Advantages,Disadvantages and Applications of Linked List

Preview

3.59

Representation of Linked List

3.02

Simply Linked List Insert and Deletion

Preview

32.08

Display singly Linked List

Preview

5.13

Print and Reverse Linked List

Preview

32.08

Intro to circular Linked List

Preview

5.43

Set Function Get Link

5.12

Checking If List Is Empty

Preview

6.22

Insert At Beginning

8.28

5.05

Insert At Position

9.53

11.41

Display Circular Linked List

Preview

10.55

Intro To Doubly Linked List

5.58

Set and Get Link

5.28

Check If List Is Empty

5.21

Insert At Beginning

Preview

5.48

4.42

Insert At Position

7.34

Preview

10.32

Display Doubly Linked List

11.38

Intro To Addition Of Polynomials

Preview

5.42

Insert At Last And Empty

4.35

3.21

Add Function Of Polynomials

8.16

Polynomial Main Class

6.02

Tree

Introduction to Tree

Preview

2.21

Tree Details Terms

Preview

4.17

Traversal of Binary Tree

20.23

Traversal of Binary Search Tree

19.18

Introduction to Binary Search Tree

27.45

Advanced Tree Structure

Introduction to Red Black Tree

Preview

11.39

Reorientation of Red Black Tree

Preview

13.58

Traversal of Red Black Tree

10.38

Introduction to AVL Tree

9.26

Reorientation of AVL Tree

9.39

Traversal of AVL Tree

5.35

Graph

Introduction to Graph

Preview

8.24

Graph Terminology

Preview

9.56

Adjencency Matix

25.41

Adjacency List or Linked Representation of Graph

29.17

GraphTraversal-DFS ALGO

Preview

9.05

GraphTraversal-DFS PROGRAM

12.02

Applications of the Graph

1.37

Shortest Path Problem Dijkstra's Algorithm

3.45

Spanning Trees(Prims Algorithm)

20.02

Spanning Trees(Kruskal Algorithm)

28.44

Shortest Path Problem Dijkstra's Algorithm

4.24

Graph Represenatation

23.53

Searching

Sequentical Search

14.11

12.59

Hashing Techniques

Preview

5.44

Common hashing functions

Preview

6.16

Collision resolution

9.5

18.48

Quadratic Probing

28.47

29.51

Sorting

Introduction to Sorting

Preview

0.56

Preview

8.31

Preview

3.57

3.43

6.41

8.01

6.56

Frequently bought together

Microprocessors and Microcontrollers Dr Babasaheb Ambedkar Technological University - Information Technology Engineering - SEM IV

5.0
10, 000
1500.00 ~~3000~~

About the Instructor

Amol Adhangale

Instructor and teacher

Ekeeda is India's leading online technical educational platform. We work with Technical students and Professional to impart technical knowledge anytime, anywhere.

₹1500