Udemy - Introduction to Data Structures & Algorithms in Java [Last updated 3-2016]

Category: Technical

Tag: Java


Posted on 2020-01-09, by phaelx.

Description



Date: Last updated 3-2016
Author: Raghavendra Dixit

Size: 597 MB
Format: MP4
Download     >>    https://adlvy.com/yUEr8
What you'll learn
   *Be able to know and implement various data structures and algorithms
   *Be able to write your own algorithms and understand if their running time is good or bad


Course content

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
   Euclid's algorithm
   Bubble Sort algorithm
   Why study data structures & algorithms
   Correctness of an algorithm
   Chapter Quiz
   Note on this section
   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
   Introduction
   Euclid's algorithm
   Bubble Sort algorithm
   Why study data structures & algorithms
   Correctness of an algorithm
   Chapter Quiz
   Note on this section
   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
   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

Linked Lists
   Introduction
   Euclid's algorithm
   Bubble Sort algorithm
   Why study data structures & algorithms
   Correctness of an algorithm
   Chapter Quiz
   Note on this section
   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
   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
   Introduction
   Euclid's algorithm
   Bubble Sort algorithm
   Why study data structures & algorithms
   Correctness of an algorithm
   Chapter Quiz
   Note on this section
   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
   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
   Abstract Data Types
   Implementing Stacks using Arrays
   Queues
   Queues using Arrays
   Double Ended Queues
   Double Ended Queues using Arrays
   Chapter Quiz
   Assignment

Recursion
   Introduction
   Euclid's algorithm
   Bubble Sort algorithm
   Why study data structures & algorithms
   Correctness of an algorithm
   Chapter Quiz
   Note on this section
   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
   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
   Abstract Data Types
   Implementing Stacks using Arrays
   Queues
   Queues using Arrays
   Double Ended Queues
   Double Ended Queues using Arrays
   Chapter Quiz
   Assignment
   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
   Introduction
   Euclid's algorithm
   Bubble Sort algorithm
   Why study data structures & algorithms
   Correctness of an algorithm
   Chapter Quiz
   Note on this section
   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
   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
   Abstract Data Types
   Implementing Stacks using Arrays
   Queues
   Queues using Arrays
   Double Ended Queues
   Double Ended Queues using Arrays
   Chapter Quiz
   Assignment
   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
   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
   Euclid's algorithm
   Bubble Sort algorithm
   Why study data structures & algorithms
   Correctness of an algorithm
   Chapter Quiz
   Note on this section
   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
   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
   Abstract Data Types
   Implementing Stacks using Arrays
   Queues
   Queues using Arrays
   Double Ended Queues
   Double Ended Queues using Arrays
   Chapter Quiz
   Assignment
   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
   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
   Introduction
   QuickSort
   QuickSort: The partition step
   Shell Sort
   Shell Sort: Example
   Counting Sort
   Radix Sort
   Bucket Sort
   Chapter Quiz
   Assignment

Heaps
   Introduction
   Euclid's algorithm
   Bubble Sort algorithm
   Why study data structures & algorithms
   Correctness of an algorithm
   Chapter Quiz
   Note on this section
   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
   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
   Abstract Data Types
   Implementing Stacks using Arrays
   Queues
   Queues using Arrays
   Double Ended Queues
   Double Ended Queues using Arrays
   Chapter Quiz
   Assignment
   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
   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
   Introduction
   QuickSort
   QuickSort: The partition step
   Shell Sort
   Shell Sort: Example
   Counting Sort
   Radix Sort
   Bucket Sort
   Chapter Quiz
   Assignment
   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
   Euclid's algorithm
   Bubble Sort algorithm
   Why study data structures & algorithms
   Correctness of an algorithm
   Chapter Quiz
   Note on this section
   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
   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
   Abstract Data Types
   Implementing Stacks using Arrays
   Queues
   Queues using Arrays
   Double Ended Queues
   Double Ended Queues using Arrays
   Chapter Quiz
   Assignment
   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
   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
   Introduction
   QuickSort
   QuickSort: The partition step
   Shell Sort
   Shell Sort: Example
   Counting Sort
   Radix Sort
   Bucket Sort
   Chapter Quiz
   Assignment
   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
   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


Sponsored High Speed Downloads
5153 dl's @ 2533 KB/s
Download Now [Full Version]
5344 dl's @ 2124 KB/s
Download Link 1 - Fast Download
6135 dl's @ 3403 KB/s
Download Mirror - Direct Download



Search More...
Udemy - Introduction to Data Structures & Algorithms in Java [Last updated 3-2016]

Search free ebooks in ebookee.com!


Links
Download this book

No active download links here?
Please check the description for download links if any or do a search to find alternative books.


Related Books


Comments

No comments for "Udemy - Introduction to Data Structures & Algorithms in Java [Last updated 3-2016]".


    Add Your Comments
    1. Download links and password may be in the description section, read description carefully!
    2. Do a search to find mirrors if no download links or dead links.
    Back to Top