Introduction to Data Structures & Algorithms in Java
Designed to help understand the fundamentals of DS & Algorithms really well. A must have for programming interviews.
FREE CODE:
https://www.udemy.com/introduction-to-data-structures-algorithms-in-java/?couponCode=DSALGPR1
https://www.udemy.com/introduction-to-data-structures-algorithms-in-java/?couponCode=DSALGPR1
by Raghavendra Dikshit
This course introduces some basic data structures (arrays, linked lists, stacks, queues, trees and heaps) and algorithms (various sorting algorithms, and algorithms for operations on binary search trees and heaps). We will also cover recursion in this course. Use of graphics and animations makes the lectures very easy to understand and digest. After taking this course, you will loose your fear for data structures and algorithms.
SECTION 1: Introduction to Algorithms
01:08
Lecture 1:
Introduction
04:49
Lecture 2:
Euclid's algorithm
02:52
Lecture 3:
Bubble Sort algorithm
03:10
Lecture 4:
Why study data structures &...
01:35
Lecture 5:
Correctness of an algorithm
SECTION 2: Analysis of Algorithms
03:20
Lecture 6:
Introduction
02:52
Lecture 7:
How to calculate the time complexity
02:07
Lecture 8:
The RAM model of computation
03:25
Lecture 9:
Time complexity of Bubble sort algorithm
03:02
Lecture 10:
Pseudo code : Bubble sort algorithm
03:26
Lecture 11:
The Big O notation
04:41
Lecture 12:
Using Big O notation : Examples
04:02
Lecture 13:
Comparison of running times
3 questions
Quiz 1:
Chapter Quiz
SECTION 3: Basic Sorting and Search Algorithms
SECTION 4: Linked Lists
SECTION 5: Stacks and Queues
SECTION 6: Recursion
SECTION 7: More Sorting Algorithms
SECTION 8: Binary Search Trees
SECTION 9: Hashtables
SECTION 10: Heaps
SECTION 11: Conclusion
SECTION 1: Introduction to Algorithms
01:08
Lecture 1:
Introduction
04:49
Lecture 2:
Euclid's algorithm
02:52
Lecture 3:
Bubble Sort algorithm
03:10
Lecture 4:
Why study data structures &...
01:35
Lecture 5:
Correctness of an algorithm
SECTION 2: Analysis of Algorithms
03:20
Lecture 6:
Introduction
02:52
Lecture 7:
How to calculate the time complexity
02:07
Lecture 8:
The RAM model of computation
03:25
Lecture 9:
Time complexity of Bubble sort algorithm
03:02
Lecture 10:
Pseudo code : Bubble sort algorithm
03:26
Lecture 11:
The Big O notation
04:41
Lecture 12:
Using Big O notation : Examples
04:02
Lecture 13:
Comparison of running times
3 questions
Quiz 1:
Chapter Quiz
SECTION 3: Basic Sorting and Search Algorithms
SECTION 4: Linked Lists
SECTION 5: Stacks and Queues
SECTION 6: Recursion
SECTION 7: More Sorting Algorithms
SECTION 8: Binary Search Trees
SECTION 9: Hashtables
SECTION 10: Heaps
SECTION 11: Conclusion