Applied Data Structures & Algorithms in Java
Applied Data Structures & Algorithms in Java
Learn Data Structures & Algorithms (DSA) in Java to excel in coding interviews and software development. Learn linked lists, trees, graphs, heaps, hashing, sorting and more while building efficient, optimized solutions.
Earn a certificate with an Academy Pro subscription

Stand out to recruiters

Share on professional channels

Globally recognised

Land your dream job

Course outline
Industry focussed curriculum designed by experts
Introduction to Data Structure and Algorithm
6 items
1.11 hr
- Algorithmic Analysis
- Types of Algorithmic Analysis
- Need to learn Complexity Theory
- Time Complexity
- Space Complexity
- Data Structure and its Types
Linked List
6 items
0.36 hr
- Types of Linked Lists
- Implementation of Circular Linked List
- Implementation of Doubly Linked List
- Linked Stack and Queue
- Implementation of Linked Queue
- Implementation of Linked Stack
Stack and Queue
4 items
0.22 hr
- Introduction to Stack
- Array Representation of Stack
- Implementation of Stack using Arrays
- Infix to Postfix conversion - Demo
- Postfix Evaluation - Demo
- Queue
Trees and Trie
4 items
0.36 hr
- Storing Strings - Binary Search Tree
- Advantages and Challenges of Binary Search Tree
- Introduction to Trie
- Implementation to Trie
Graphs
6 items
1.11 hr
- Introduction to Graph
- Types of Graph
- Introduction to BFS
- Implementation of BFS
- Introduction to DFS
- Implementing DFS using Stack
Heaps
5 items
0.36 hr
- Introduction to Heap
- Min Heap
- Min Heap - Demo
- Max Heap
- Max Heap - Demo
Hashing
5 items
0.44 hr
- Introduction to Hash Table
- Introduction to Hashing
- How is Hashing Performed
- Linear Probing
- Collision Resolution
Collections
19 items
2.23 hr
- What is Collection
- Collections Framework - Introduction
- Collections Framework Hierarchy
- ArrayList
- ArrayList Implementation
- Linked List - 1
- Linked List - 2
- Linked List Implementation
- Stack Class
- Implementation of Stack
- Queue Interface
- Set Interface
- List Interface
- Priority Queue - Introduction
- Priority Queue - Implementation
- HashSet - Introduction
- HashSet - Implementation
- Linked HashSet
- Linked HashSet Implementation
Searching
7 items
1.09 hr
- Introduction to Searching
- Linear Search
- Linear Search - Implementation
- Binary Search
- Binary Search - Implementation
- Three Sum - Implementation
- Highest Frequency Number - Implementation
Sorting
18 items
1.33 hr
- Introduction to Bubble Sort
- Implementation of Bubble Sort
- Bubble Sort - Analysis
- Introduction to Insertion Sort
- Implementation of Insertion Sort
- Insertion Sort - Analysis
- Introduction to Selection Sort
- Implementation of Selection Sort
- Selection Sort - Analysis
- Bubble Sort Vs Selection Sort Vs Insertion Sort
- Introduction to Merge Sort
- Implementation of Merge Sort
- Merge Sort - Analysis
- Introduction to Quick Sort
- Implementation of Quick Sort
- Quick Sort - Analysis
- Heap Sort
- Implementation of Heap Sort
Types of Programming
11 items
2.22 hr
- Introduction to Divide & Conquer
- Divide & Conquer - Application
- Introduction to Greedy Algorithm
- Application of Greedy Algorithm
- Introduction to Huffman Coding
- Huffman Coding - Implementation
- Introduction to Dynamic Programming
- Bellman Ford Algorithm
- Bellman Ford Algorithm - Implementation
- Introduction to Recursion
- Understanding Tower of Hanoi
- Tower of Hanoi - Implementation
Get access to the complete curriculum with your free trial
Start 7-Day Free TrialGuided Projects
Solve real-world projects with a step-by-step guide, starter code templates, and access to model solutions to boost your skills and build a standout resume.
- GUIDED PROJECT 1
- Pathfinding in a City Map
- This project focuses on designing a program that represents a city map as a graph and implements pathfinding algorithms to find the shortest or most efficient route between two locations. Students will learn graph representation, traversal algorithms like BFS and DFS, and can extend to weighted shortest-path algorithms like Dijkstra’s or A*.
- GUIDED PROJECT 2
- E-commerce Order Processing System
- This project simulates an e-commerce platform’s order management system, handling order insertion, priority-based delivery, searching and sorting of orders and efficient storage using hashing. It incorporates advanced data structures like heaps, hash tables and sorting/searching algorithms.
Gain skills & build your resume with complete access to guided projects in your free trial
Start 7-Day Free TrialCourse Instructors
Mr. Vishwa Mohan
Staff Engineer @ LinkedIn | IIT Grad | Technology enthusiast | Mentor | Public Speaker
Gain work-ready skills with an Academy Pro subscription
Get unlimited access to in-demand courses that get you noticed at work
Subscribe To Pro • $25/MonthShare your certificate online
Share your professional certificate & updated resume on LinkedIn


Learn from the best
Taught by top faculty & industry experts


Learn by doing
Apply skills with guided projects and interactive coding exercises
AI Mock Interviews
30+ Guided Projects
200+ Coding Exercises

Learn with AI
Get AI-powered coding hints & instant doubt resolution
24x7 Doubt resolution
Coding Hints
Advance your career with
Top University programs
Gain industry-relevant skills through learning from top faculty, guidance from industry mentors, and hands-on projects.






MIT Professional Education
12 Weeks  • Online









McCombs School of Business at The University of Texas at Austin
7 months  • Online



McCombs School of Business at The University of Texas at Austin
7 months  • Online



McCombs School of Business at The University of Texas at Austin
6 months  • Online


