From 0 to 1: Data Structures & Algorithms in Java
Learn data structuring & Algorithms in Java from basics to advanced level and also, become a pro in framing algorithms Java.
This course will cover Big-O Notation and complexity, queues, trees, heaps, graphs and graph algorithms, Linked lists sorting, and searching and you will learn data structures and algorithms through visual and spatial ways.
When the information we are gathering is given to us in visual and spatial ways as evolutionary our brains process information differently. It is very hard to understand about Data Structure and Algorithms in other ways as compared to visually granted knowledge. This course has been designed by a team that has put concepts experienced and applied at work.
If you are an experienced Software Engineer or a Computer Science Graduate really looking forward to visualize data structures and internalize the way they work and refresh important fundamental concept.
Layout of this course will be:-
- Introduction
- Data Structures & Algorithms – A Symbiotic Relation
- Complexity Analysis and the Big O-Notation
- Linked Lists
- Stacks and Queues
- Sorting and Searching
- Binary Trees
- Binary Search Trees
- Binary Tree Problems
- Heaps
- Revisiting Sorting
- Heap Problems
- Graphs
- Graphs Algorithms
- Shortest Path Algorithms
- Spanning Tree Algorithms
- Graph Problems
Key en-rollers of this course can be:-
- Computer Science graduates
- Software engineers graduates seeking to refresh fundamental concepts
- IT Professionals seeking to visualize all data structures, and internalize the workflow
- Students or professionals with no data structuring experience
Some exceptional benefits associated with this course enrollment are:
- Gaining knowledge from an instructor group having high-end experience in such topics
- Quality course material on Data Structures and Algorithms in Java
- Lifetime access to the course
- Instant & free course updates
- Access to all Questions & Answers initiated by other students as well
- Personalized support from the instructor’s end on any issue related to the course
- Few free lectures for a quick overview
Don’t miss this unique opportunity and enroll today itself!!
Curriculum
- 1 Section
- 66 Lessons
- 52 Weeks
- Course66
- 2.1You, This course and Us2 Minutes
- 2.2Data Structures And Algorithms Important15 Minutes
- 2.3Performance and Complexity16 Minutes
- 2.4Bog-O Notation15 Minutes
- 2.5What is the complexity of these pieces of code?19 Minutes
- 2.6The Linked List – The Most Basic Of All Data Structures19 Minutes
- 2.7Linked List Problems10 Minutes
- 2.8Linked Lists vs Arrays10 Minutes
- 2.9Meet The Stack – Simple But Powerful15 Minutes
- 2.10Building A Stack Using Java16 Minutes
- 2.11Match Parenthesis To Check A Well Formed Expression11 Minutes
- 2.12Find The Minimum Element In A Stack In Constant Time8 Minutes
- 2.13Meet The Queue – A Familiar Sight In Everyday Life14 Minutes
- 2.14Circular Queue- Tricky But Fast19 Minutes
- 2.15Build A Queue With Two Stacks17 Minutes
- 2.16Sorting Trade-offs10 Minutes
- 2.17Selection Sort15 Minutes
- 2.18Bubble Sort14 Minutes
- 2.19Insertion Sort14 Minutes
- 2.20Shell Sort14 Minutes
- 2.21Merge Sort19 Minutes
- 2.22Quick Sort15 Minutes
- 2.23Binary Search search quickly through a sorted list11 Minutes
- 2.24Meet The Binary Tree – A Hierarchical Data Structure13 Minutes
- 2.25Breadth First Traversal18 Minutes
- 2.26Depth First Traversal – PreOrder Traversal14 Minutes
- 2.27Depth First Traversal – In And Post Order Traversal13 Minutes
- 2.28The Binary Search Tree – an introduction9 Minutes
- 2.29Insertion and Lookup in a Binary Search Tree17 Minutes
- 2.30Minimum Value, Maximum Depth And Mirror12 Minutes
- 2.31Count Trees, Print Range and Is BST14 Minutes
- 2.32The Heap Is Just The Best Way to Implement a Priority Queue17 Minutes
- 2.33Meet The Binary Heap – It’s A Tree At Heart12 Minutes
- 2.34The Binary Heap – Logically A Tree Really An Array17 Minutes
- 2.35The Binary Heap – Making It Real With Code7 Minutes
- 2.36Heapify19 Minutes
- 2.37Insert And Remove From A Heap16 Minutes
- 2.38HeapSort Heapify19 Minutes
- 2.40Maximum Element In A Minimum Heap and K Largest Elements In A Stream15 Minutes
- 2.41Introducing The Graph15 Minutes
- 2.42Types of Graphs7 Minutes
- 2.43Undirected and Directed Graphs14 Minutes
- 2.44Representation A Graph In Code8 Minutes
- 2.45Graph Using An Adjacency Matrix15 Minutes
- 2.46Graph Using An Adjacency List And Adjacency Set17 Minutes
- 2.47Comparison Of Graph Representations10 Minutes
- 2.48Graph Traversal – Depth First And Breadth First14 Minutes
- 2.49Topological Sort In A Graph17 Minutes
- 2.50Implementation Of Topological Sort6 Minutes
- 2.51Introduction To Shortest Path In An Unweighted Graph – The Distance Table12 Minutes
- 2.52The Shortest Path Algorithm Visualized14 Minutes
- 2.53Implementation Of The Shortest Path In An Unweighted Graph6 Minutes
- 2.54Introduction To The Weighted Graph3 Minutes
- 2.55Shortest Path In A Weighted Graph – A Greedy Algorithm18 Minutes
- 2.56Dijkstra’s Algorithm Visualized14 Minutes
- 2.57Implementation Of Dijkstra’s Algorithm8 Minutes
- 2.58Implementation Of Dijkstra’s Algorithm8 Minutes
- 2.59The Bellman Ford Algorithm Visualized11 Minutes
- 2.60Dealing With Negative Cycles In The Bellman Ford Algorithm7 Minutes
- 2.61Implementation Of The Bellman Ford Algorithm6 Minutes
- 2.62Prim’s Algorithm For a Minimal Spanning Tree17 Minutes
- 2.63Use Cases And Implementation Of Prim’s Algorithm9 Minutes
- 2.64Kruskal’s Algorithm For a Minimal Spanning Tree8 Minutes
- 2.65Implementation Of Kruskal’s Algorithm7 Minutes
- 2.66Design A Course Schedule Considering Pre-reqs For Courses13 Minutes
- 2.67Find The Shortest Path In A Weighted Graphs – Fewer Edges Better14 Minutes
An ex-Google, Stanford and Flipkart team
Loonycorn is a team by Janani Ravi and Vitthal Srinivasan, product of Stanford University and IIM Ahmedabad.
We hold several years of working experience in the field of technology in Bay Area, New York, Singapore and Bangalore.
Janani Ravi: 7 Years of work experience (Google, Flipkart and Microsoft)
Vitthal Srinivasan: Worked at Google, Flipkart, Credit Suisse and INSEAD
We have come together to teach and educate on various technological courses in the most easiest and entertaining manner. Also, our courses will be based on practical elaborations & illustrations.
Courses you might be interested in
-
15 Lessons
-
10 Lessons
-
13 Lessons
-
39 Lessons