UDEMY: Introduction to Data Structures & Algorithms in Java

seeders: 2
leechers: 79
Added on October 17, 2015 by DecompileCodexin Other > Tutorials
Torrent verified.



UDEMY: Introduction to Data Structures & Algorithms in Java (Size: 595.36 MB)
 002 Euclids algorithm.mp410.97 MB
 003 Bubble Sort algorithm.mp47.84 MB
 004 Why study data structures algorithms.mp47.22 MB
 005 Correctness of an algorithm.mp43.13 MB
 001 Introduction.mp41.72 MB
 001 Chapter Quiz Quiz.html7 KB
 007 Using Big O notation Examples.mp46.95 MB
 008 Comparison of running times.mp46.83 MB
 001 Introduction.mp46.18 MB
 006 The Big O notation.mp45.6 MB
 004 Time complexity of Bubble sort algorithm.mp45.15 MB
 005 Pseudo code Bubble sort algorithm.mp45.1 MB
 002 How to calculate the time complexity.mp44.78 MB
 003 The RAM model of computation.mp44.01 MB
 001 Chapter Quiz Quiz.html9.93 KB
 010 Searching elements in an ORDERED array - contd..mp49.7 MB
 009 Searching elements in an ORDERED array.mp49.01 MB
 007 Stable Vs Unstable Sorts.mp47.99 MB
 008 Searching elements in an un ordered array.mp46.6 MB
 001 Selection Sort.mp46.45 MB
 004 Applying Insertion Sort algorithm to cue balls.mp45.39 MB
 002 Selection Sort Pseudocode.mp44.14 MB
 005 Insertion Sort Pseudocode.mp44.14 MB
 003 Introduction to Insertion Sort.mp43.64 MB
 012 Sorting any type of object.mp43.62 MB
 010 Insertion Sort revisited.mp420.64 MB
 009 Doubly Linked List.mp419.05 MB
 003 Inserting a new Node.mp411.63 MB
 008 Inserting data in a sorted Linked List.mp48.07 MB
 007 Doubly Ended Lists.mp48.06 MB
 006 Searching for an Item.mp47.66 MB
 001 What is a Linked List.mp46.33 MB
 005 Deleting the head node.mp46.13 MB
 004 Length of a Linked List.mp45.73 MB
 002 Implementing a Linked List in Java.mp42.21 MB
 005 Queues using Arrays.mp49.6 MB
 007 Double Ended Queues using Arrays.mp46.98 MB
 003 Implementing Stacks using Arrays.mp46.65 MB
 001 Stacks.mp44.54 MB
 004 Queues.mp43.78 MB
 006 Double Ended Queues.mp42.85 MB
 002 Abstract Data Types.mp41.06 MB
 001 Chapter Quiz Quiz.html9.06 KB
 001 Assignment.html2.32 KB
 004 Tower of Hanoi.mp416.69 MB
 007 Merge Sort - Pseudocode.mp49.92 MB
 008 Merge Step - Pseudocode.mp49.72 MB
 001 Introduction.mp48.95 MB
 006 Merge Sort.mp47.59 MB
 005 Tower of Hanoi - Implementation.mp47 MB
 002 Understanding Recursion.mp45.43 MB
 009 Time Complexity of Merge Sort.mp45.42 MB
 003 Tail recursion.mp43.89 MB
 001 Chapter Quiz Quiz.html10.08 KB
 001 Assignment.html1.91 KB
 007 Deleting an Item Case 1.mp413.63 MB
 009 Deleting an Item - Case 3.mp411.15 MB
 002 Binary Trees.mp410.82 MB
 006 Inserting an item in a Binary Search Tree.mp49.73 MB
 008 Deleting an Item - Case 2.mp48.2 MB
 011 Finding smallest largest values.mp47.96 MB
 001 The Tree Data structure.mp46.86 MB
 005 Implementing the find method.mp46.71 MB
 012 Tree Traversal In Order.mp46.65 MB
 010 Deleting an Item - Soft Delete.mp45.6 MB
 004 Shell Sort.mp49.57 MB
 006 Counting Sort.mp49.12 MB
 002 QuickSort.mp48.36 MB
 005 Shell Sort Example.mp46.47 MB
 008 Bucket Sort.mp45.35 MB
 003 QuickSort The partition step.mp44.14 MB
 007 Radix Sort.mp43.95 MB
 001 Introduction.mp42.3 MB
 001 Chapter Quiz Quiz.html7.49 KB
 001 Assignment.html1.39 KB
 007 Building a heap.mp47.52 MB
 001 Introduction.mp46.98 MB
 006 Heap Sort.mp44.64 MB
 004 Heaps as Priority Queues.mp44.52 MB
 005 Representing heaps using Arrays.mp43.67 MB
 003 Inserting an item in a heap.mp43.5 MB
 002 Deleting the root.mp43.33 MB
 001 Chapter Quiz Quiz.html8.5 KB
 001 Assignment.html1.33 KB
 005 The Hash function.mp410.9 MB
 004 Resolving collisions through chaining.mp47.69 MB
 008 Time Complexity Open Addressing.mp45.68 MB
 007 Strategies for Open Addressing.mp45.66 MB
 001 Introduction.mp45.64 MB
 006 Open Addressing to resolve collisions.mp44.67 MB
 002 Direct Access Tables.mp43.73 MB
 003 Hashing.mp42.87 MB
 009 Conclusion.mp41.32 MB
 001 Chapter Quiz Quiz.html9 KB
 001 Assignment.html1.72 KB

Description

Click for course curriculum

Course Description

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.

What are the requirements?

Although any programming language may be used by the student, we use the java programming language to implement algorithms.
What am I going to get from this course?

Over 102 lectures and 5 hours of content!
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

What is the target audience?

Anyone who wants to learn data structures and algorithms (introductory)
Anyone appearing for interviews, can be used to understand from grounds up, or as a quick revision

Sharing Widget


Download torrent
595.36 MB
seeders:2
leechers:79
UDEMY: Introduction to Data Structures & Algorithms in Java