MyPage is a personalized page based on your interests.The page is customized to help you to find content that matters you the most.

I'm not curious

# Introduction to Data Structures & Algorithms in Java

### Course Summary

Designed to help understand the fundamentals of DS & Algorithms really well. A must have for programming interviews.

• +

### Course Syllabus

• Introduction to Algorithms
• Introduction
• Euclid's algorithm
• Bubble Sort algorithm
• Why study data structures & algorithms
• Correctness of an algorithm
• Chapter Quiz
• Analysis of Algorithms
• Introduction
• How to calculate the time complexity
• The RAM model of computation
• Time complexity of Bubble sort algorithm
• Pseudo code : Bubble sort algorithm
• The Big O notation
• Using Big O notation : Examples
• Comparison of running times
• Chapter Quiz
• Basic Sorting and Search Algorithms
• Selection Sort
• Selection Sort : Pseudocode
• Introduction to Insertion Sort
• Applying Insertion Sort algorithm to cue balls
• Insertion Sort: Pseudocode
• O(n²) sorting algorithms - Comparison
• In place sorting
• Stable Vs Unstable Sorts
• Searching elements in an un ordered array
• Searching elements in an ORDERED array
• Searching elements in an ORDERED array - contd.
• Inserting and Deleting items in an ORDERED array
• Sorting any type of object
• Chapter Quiz
• Assignment
• What is a Linked List?
• Implementing a Linked List in Java
• Inserting a new Node
• Length of a Linked List
• Deleting the head node
• Searching for an Item
• Using java generics to parameterize the LinkedList
• Doubly Ended Lists
• Inserting data in a sorted Linked List
• Doubly Linked List
• Insertion Sort revisited
• Chapter Quiz
• Assignment
• Stacks and Queues
• Stacks
• Abstract Data Types
• Implementing Stacks using Arrays
• Queues
• Queues using Arrays
• Double Ended Queues
• Double Ended Queues using Arrays
• Chapter Quiz
• Assignment
• Recursion
• Introduction
• Understanding Recursion
• Tail recursion
• Tower of Hanoi
• Tower of Hanoi - Implementation
• Merge Sort
• Merge Sort - Pseudocode
• Merge Step - Pseudocode
• Time Complexity of Merge Sort
• Chapter Quiz
• Assignment
• Binary Search Trees
• The Tree Data structure
• Binary Trees
• Binary Search Trees
• Finding an item in a Binary Search Tree
• Implementing the find method
• Inserting an item in a Binary Search Tree
• Deleting an Item : Case 1
• Deleting an Item - Case 2
• Deleting an Item - Case 3
• Deleting an Item - Soft Delete
• Finding smallest & largest values
• Tree Traversal : In Order
• Tree Traversal : Pre Order
• Tree Traversal : Post Order
• Unbalanced Trees Vs Balanced Trees
• Height of a Binary Tree
• Time Complexity of Operations on Binary Search Trees
• Chapter Quiz
• Assignment
• More Sorting Algorithms
• Introduction
• QuickSort
• QuickSort: The partition step
• Shell Sort
• Shell Sort: Example
• Counting Sort
• Bucket Sort
• Chapter Quiz
• Assignment
• Heaps
• Introduction
• Deleting the root
• Inserting an item in a heap
• Heaps as Priority Queues
• Representing heaps using Arrays
• Heap Sort
• Building a heap
• Chapter Quiz
• Assignment
• Hashtables
• Introduction
• Direct Access Tables
• Hashing
• Resolving collisions through chaining
• The Hash function
• Open Addressing to resolve collisions
• Strategies for Open Addressing
• Time Complexity: Open Addressing
• Chapter Quiz
• Assignment
• Conclusion

Course Fee:
USD 65

Self-Study

### Course Status:

Active

1 - 4 hours / week

This course is listed under Development & Implementations Community

Related Posts:

## Java

Awards & Accolades for MyTechLogy
Winner of
REDHERRING
Top 100 Asia
Finalist at SiTF Awards 2014 under the category Best Social & Community Product
Finalist at HR Vendor of the Year 2015 Awards under the category Best Learning Management System
Finalist at HR Vendor of the Year 2015 Awards under the category Best Talent Management Software