Data Structure and Algorithms in Java

Overview

Save Big on Coursera Plus. 7,000+ courses at $160 off. Limited Time Only!

Grab it

Dive into a comprehensive 9-hour course on Data Structures and Algorithms using Java programming. Explore fundamental concepts including arrays, linked lists, stacks, queues, trees, and graphs. Learn implementation techniques, advantages, and disadvantages of each data structure. Master algorithmic analysis, various sorting and searching algorithms, and their complexity. Discover advanced programming approaches like Greedy, Dynamic, and Divide and Conquer. Gain practical coding experience through hands-on implementations and real-world examples. Enhance your problem-solving skills and prepare for technical interviews with this in-depth exploration of essential computer science concepts.

Syllabus

Introduction.
Agenda .
Introduction to Data Structure .
Types of Data Structure .
Arrays Introduction .
Arrays Implementation .
Advantages and Disadvantages of Arrays .
Stack introduction .
Stack implementation .
Advantages and Disadvantages of Stack .
Queue introduction .
Queue implementation .
Advantages and Disadvantages of Queue.
Linked list introduction .
Linked list types .
Linked List implementation .
Circular Linked list implementation .
Advantages and Disadvantages of Linked List .
Binary tree introduction .
Binary tree implementation .
Advantages and Disadvantages of Binary Tree .
Binary search tree introduction .
Binary search tree implementation .
Advantages and Disadvantages of Binary search Tree .
Graphs introduction.
Breadth first search implementation .
Depth first search implementation .
Hash tables introduction .
Hashing implementation .
Algorithms introduction and algorithmic analysis .
Finding space and time complexity .
Linear Search .
Linear search implementation .
Complexity analysis of Linear Search .
Binary Search .
Bnary search implementation .
Complexity analysis of Binary Search .
Insertion sort .
Insertion sort implementation .
Complexity analysis of Insertion sort .
Selection sort .
Selection sort implementation .
Complexity analysis of Selection sort .
Quick sort .
Quick sort implementation .
Complexity analysis of Quick sort .
Introduction to Divide and Conquor approach .
Merge sort .
merge sort implementation .
Introduction to Greedy's approach .
Prim's minimal Spanning Tree algorithm .
Prim's minimal Spanning Tree algorithm implementation .
Introduction to Dynamic Programming .
Tower of Hanoi .
Tower of Hanoi implementation .
Summary .