There are no items in your cart

Add More

Add More

Item Details | Price |
---|

**Prerequisites for this Course**

- Basic Knowledge of Computer
- Access to Smart Phone / Computer
- Good Internet Speed (Wifi/3G/4G)
- Good Quality Earphones / Speakers
- Basic Understanding of English & Hindi
- Knowledge of JAVA programming language

Instructor: Expert WsCube Tech Team

Language: Bilingual (Hindi + English)

Validity Period: Lifetime

₹3999 75% OFF

## ₹999
including 18% GST

**About the Course**

Algorithms and Data Structure are two of the most fundamentals and important topics from Computer Science which is used everywhere in software development. DSA helps to crack coding interviews of top companies like Google, Microsoft, Amazon, Face book, and Apple so consideration on this scenario, DSA using JAVA course has been designed by WsCube Tech. The course focuses on depth learning on each and every topic of DSA and implements all data structures using JAVA programming language. The course has been designed by experts keeping in mind that all topics must be explained in detailed way and simple way. The expert will provide you with the right guidance and strategies to learn Data structure concepts with the help of JAVA Programming Language.

**What will you get?**

- Total 100+ Sessions in this course
- 40+ Theory Sessions and 80+ Practical Sessions
- Total Hours :- 21+
- Top MCQ Questions with explanation:- 100
- Topic wise Quiz with Solution :- 100+
- Top 50 interview questions
- Helping to build a Mini Project
- Videos explain everything in minute details
- Delivery of all sessions by Expert Faculty
- Use the source code examples to learn step-by-step

**Why take this Course?**

- 21+ Hours of Class
- Total 200+ Top rated MCQ’s
- Interview Preparation
- Top Quality test after every session
- Highly Experience Faculty for this course
- Accessible on Mobile Phone

Overview of Data Structures and Algorithms | |||

Introduction to Data Structure & Algorithms 15:00 | |||

Types of Data Structure 17:00 | |||

Asymptotic Notation in Data Structure 29:00 | |||

Array in DSA | |||

Array in DSA (Row Major and Column order) 20:00 | |||

Java Program to perform traversing of 1-d array 7:00 | |||

Java Program to perform linear searching in 1-d array 11:00 | |||

Java Program to perform Binary searching in 1-d array 12:00 | |||

Java Program to insert a new element at user specified position in 1-d array 11:00 | |||

Java Program to delete an element at user specified position in 1-d array 12:00 | |||

How to Merge Two Arrays in Java 7:00 | |||

How to Sort an Array in Java 11:00 | |||

Java Program to copy all elements of one array into another array 6:00 | |||

Program to print the largest element in an array 3:00 | |||

Program to find Third Largest Number in an Array 7:00 | |||

Java Program to right rotate the elements of an array 10:00 | |||

Java Program to add two matrices 11:00 | |||

Java Program to perform multiplication of two matrices and print the resultant matrix 16:00 | |||

Java Program to determine whether a given matrix is a sparse matrix 8:00 | |||

Java Program to find the sum of each row and each column of a matrix 8:00 | |||

Java program to add two polynomials 15:00 | |||

Java Program to display the upper or lower triangular matrix 11:00 | |||

Linked List in DSA | |||

Singly Linked List and Array vs Linked List 19:00 | |||

Circular Linked List 9:00 | |||

Doubly Linked List 12:00 | |||

Java Program to create and display a singly linked list 13:00 | |||

Java Program to create a singly linked list of n nodes and count the number of nodes 7:00 | |||

Java Program to create a singly linked list of n nodes and display it in reverse order 9:00 | |||

Java Program to insert a new node at the beginning of the singly linked list 6:00 | |||

Program to insert a new node at the middle of the singly linked list 11:00 | |||

Java Program to insert a new node at the end of the singly linked list 5:00 | |||

Java Program to find the maximum and minimum value node from a linked list 6:00 | |||

Java Program to search an element in a singly linked list 10:00 | |||

Java Program to delete a node from the beginning of the singly linked list 7:00 | |||

Java Program to delete a node from the middle of the singly linked list 11:00 | |||

Program to delete a node from the end of the singly linked list 8:00 | |||

Java Program to create and display a Circular Linked List 13:00 | |||

Java Program to create a Circular Linked List of N nodes and count the number of nodes 5:00 | |||

Java Program to create a Circular Linked List of n nodes and display it in reverse order 7:00 | |||

Java Program to find the maximum and minimum value node from a circular linked list 7:00 | |||

Java Program to insert a new node at the beginning of the Circular Linked List 9:00 | |||

Java Program to insert a new node at the middle of the Circular Linked List 7:00 | |||

Java Program to insert a new node at the end of the Circular Linked List 7:00 | |||

Java Program to search an element in a Circular Linked List 8:00 | |||

Java Program to sort the elements of the Circular Linked List 8:00 | |||

Java Program to delete a node from the beginning of the Circular Linked List 4:00 | |||

Java Program to delete a node from the middle of the Circular Linked List 10:00 | |||

Program to delete a node from the end of the Circular Linked List 6:00 | |||

Java Program to create and display a doubly linked list 16:00 | |||

Java Program to create a doubly linked list of n nodes and count the number of nodes 5:00 | |||

Java Program to create a doubly linked list of n nodes and display it in reverse order 7:00 | |||

Java Program to find the maximum and minimum value node from a doubly linked list 7:00 | |||

Java program to search an element in a doubly linked list 8:00 | |||

Java program to sort the elements of the doubly linked list 7:00 | |||

Java program to insert a new node at the middle of the Doubly Linked List 11:00 | |||

Java program to insert a new node at the end of the Doubly Linked List 7:00 | |||

Java program to delete a node from the beginning of the doubly linked list 5:00 | |||

Java program to delete a node from the middle of the doubly linked list 10:00 | |||

Java program to delete a node from the end of the doubly linked list 5:00 | |||

Java program to remove duplicate elements from a Doubly Linked List 6:00 | |||

Java program to rotate doubly linked list by N nodes 8:00 | |||

Java Program to create a Linked List using Collections Framework 22:00 | |||

Java Program to Traverse or Print Linked List using Collections Framework 8:00 | |||

Java Program to Removing elements from a LinkedList using Collections Framework 8:00 | |||

Java Program to Reverse Linked List using Collections Framework 7:00 | |||

Java Program to search Linked List using Collections Framework 8:00 | |||

Stack in DSA | |||

Concept of Stack 24:00 | |||

Implementation of Stack using Linked List 13:00 | |||

Tower of Hanoi 13:00 | |||

Evaluation of postfix and Prefix Expression using stack 16:00 | |||

Infix to Postfix Expression Conversion Part-1 13:00 | |||

Infix to Postfix Expression Conversion Part-2 13:00 | |||

Java program to Implement a stack using singly linked list 27:00 | |||

Java Program to Implement Stack using Two Queues 27:00 | |||

Java Program to Implement Queue using Two Stacks 21:00 | |||

Java Program to Solve Tower of Hanoi Problem using Stacks 12:00 | |||

Java Program to Check for balanced parenthesis by using Stacks 8:00 | |||

Java Program to Evaluate an Expression using Stacks 17:00 | |||

Queue in DSA | |||

Concept of Queue 13:00 | |||

Implementation of Circular Queue 14:00 | |||

Implementation of Queue using Linked List 11:00 | |||

Java Program to Implement Queue using Linked List 23:00 | |||

Java Program to Implement Double Ended Queue 36:00 | |||

Tree in DSA | |||

Introduction to Tree and Tree Terminology 23:00 | |||

Binary Tree and its Types in DSA 12:00 | |||

Representation of Binary Tree 13:00 | |||

Preorder Traversals of Binary Tree 11:00 | |||

Inorder Traversals of Binary Tree 9:00 | |||

Postorder Traversals of Binary Tree 9:00 | |||

Concept of Binary Search Tree (BST) in DSA 14:00 | |||

Deletion into Binary Search Tree 12:00 | |||

AVL Tree in DSA 18:00 | |||

Rotations in AVL Tree-Part-1 21:00 | |||

Rotations in AVL Tree-Part-2 17:00 | |||

AVL Tree Example 14:00 | |||

Insertion in Heap Tree 16:00 | |||

Deletion in Heap Tree 10:00 | |||

B Tree Insertion 15:00 | |||

Java program to find the sum of all the nodes of a binary tree 12:00 | |||

Java program to find the smallest element in a tree 12:00 | |||

Java program to find the maximum height of a tree 13:00 | |||

Java program to find the largest element in a Binary Tree 7:00 | |||

Java program to find maximum width of a binary tree 11:00 | |||

Java program to determine whether two trees are identical 9:00 | |||

Java program to determine whether all leaves are at same level 9:00 | |||

Java program to find the total number of possible Binary Search Trees with N keys 7:00 | |||

Java program to search a node in a Binary Tree 11:00 | |||

Graph in DSA | |||

Introduction to Graph in DSA 22:00 | |||

Representation of Graph in DSA 14:00 | |||

Spanning Tree Algorithm - Kruskal's Algorithm 18:00 | |||

Prim's Algorithm - Spanning Tree in DSA 10:00 | |||

Shortest Path Algorithms in DSA(Dijkstra's shortest path algorithm) 20:00 | |||

Graph Traversal Algorithms - Breadth First Search 10:00 | |||

Graph Traversal Algorithms - Depth First Search 6:00 | |||

Java program to print BFS traversal from a given source vertex 15:00 | |||

Java program to print DFS traversal from a given graph 10:00 | |||

Java program to represent graph as a 2-D array 22:00 | |||

Java program to represent graph as a adjacency matrix 5:00 | |||

Java Program to Represent Graph Using Adjacency List 13:00 | |||

Searching and Sorting in DSA | |||

Java Program to Implement Bubble Sort 12:00 | |||

Java Program to Implement Insertion Sort 9:00 | |||

Java Program to Implement Selection Sort 11:00 | |||

Java Program to Implement Merge Sort 12:00 | |||

Java Program to Implement Heap Sort 13:00 | |||

Java Program to Implement Sorting in O(n) Complexity 12:00 | |||

Java Program to Implement Shell Sort 11:00 | |||

Java Program to Implement Quick sort 15:00 | |||

Java Program to Implement Quick Sort Using Randomization 17:00 | |||

Java Program to Implement Radix Sort 16:00 | |||

Java Program to Implement Merge Sort Algorithm on Linked List 16:00 | |||

Hashing in DSA | |||

Hashing Data Structure 14:00 | |||

Types of hash function 11:00 | |||

Collision resolution technique 29:00 |

After successful purchase, this item would be added to your courses.

You can access your courses in the following ways :

Reviews

Other Courses

Launch your Graphy

100K+ creators trust Graphy to teach online