# معرفی ساختارهای داده و الگوریتم ها در Java

Introduction to Data Structures & Algorithms in JavaPublisher: PacktpubAuthor: Raghavendra DixitDuration: 04:57:09Link:https://www.safaribooksonline.com/library/view/introduction-to-data/9781788628648/#toc-startDesigned to help understand the fundamentals of DS & Algorithms really well. A must have for programming interviews. About This Video Be able to know and implement various data structures ... - Selection from Introduction to Data Structures & Algorithms in Java [Video]
Release Date: July 2017
ISBN: 9781788628648
Video Description
Designed to help understand the fundamentals of DS & Algorithms really well. A must have for programming interviews.About This VideoBe able to know and implement various data structures and algorithmsBe able to write your own algorithms and understand if their running time is good or badIn DetailThis 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.
Chapter 1 : Introduction to Algorithms
Introduction
00:01:09
Euclid's algorithm
00:04:50
Bubble Sort algorithm
00:02:53
Why study data structures & algorithms
00:03:10
Correctness of an algorithm
00:01:36
Chapter 2 : Analysis of Algorithms
Introduction
00:03:20
How to calculate the time complexity
00:02:52
The RAM model of computation
00:02:07
Time complexity of Bubble sort algorithm
00:03:25
Pseudo code : Bubble sort algorithm
00:03:02
The Big O notation
00:03:26
Using Big O notation : Examples
00:04:41
Comparison of running times
00:04:03
Chapter 3 : Basic Sorting and Search Algorithms
Selection Sort
00:02:48
Selection Sort: Pseudocode
00:02:35
Introduction to Insertion Sort
00:01:56
Applying Insertion Sort algorithm to cue balls
00:02:08
Insertion Sort: Pseudocode
00:02:38
O(n²) sorting algorithms – Comparison
00:02:00
Stable Vs Unstable Sorts
00:03:46
Searching elements in an un ordered array
00:03:17
Searching elements in an ORDERED array
00:02:33
Searching elements in an ORDERED array - contd.
00:05:48
Inserting and Deleting items in an ORDERED array
00:02:09
Sorting any type of object
00:01:33
00:03:21
Implementing a Linked List in Java
00:00:56
Inserting a new Node
00:05:25
00:02:11
00:02:11
Searching for an Item
00:03:12
Doubly Ended Lists
00:03:06
Inserting data in a sorted Linked List
00:04:38
00:06:29
Insertion Sort revisited
00:10:32
Chapter 5 : Stacks and Queues
Stacks
00:02:41
Abstract Data Types
00:00:37
Implementing Stacks using Arrays
00:03:22
Queues
00:02:32
Queues using Arrays
00:05:30
Double Ended Queues
00:01:59
Double Ended Queues using Arrays
00:04:20
Chapter 6 : Recursion
Introduction
00:04:33
Understanding Recursion
00:03:04
Tail recursion
00:02:48
Tower of Hanoi
00:08:25
Tower of Hanoi – Implementation
00:02:59
Merge Sort
00:04:10
Merge Sort – Pseudocode
00:04:25
Merge Step – Pseudocode
00:04:32
Time Complexity of Merge Sort
00:02:52
Chapter 7 : Binary Search Trees
The Tree Data structure
00:03:41
Binary Trees
00:03:34
Binary Search Trees
00:02:02
Finding an item in a Binary Search Tree
00:02:25
Implementing the find method
00:03:03
Inserting an item in a Binary Search Tree
00:03:34
Deleting an Item: Case 1
00:06:06
Deleting an Item - Case 2
00:02:59
Deleting an Item - Case 3
00:03:45
Deleting an Item - Soft Delete
00:01:41
Finding smallest & largest values
00:02:34
Tree Traversal: In Order
00:03:19
Tree Traversal: Pre Order
00:01:59
Tree Traversal: Post Order
00:00:57
Unbalanced Trees Vs Balanced Trees
00:02:16
Height of a Binary Tree
00:01:35
Time Complexity of Operations on Binary Search Trees
00:02:16
Chapter 8 : More Sorting Algorithms
Introduction
00:01:27
QuickSort
00:04:54
QuickSort: The partition step
00:02:22
Shell Sort
00:05:27
Shell Sort Example
00:03:28
Counting Sort
00:04:51
00:02:28
Bucket Sort
00:03:12
Chapter 9 : Heaps
Introduction
00:04:07
Deleting the Root
00:01:54
Inserting an item in a heap
00:01:59
Heaps as Priority Queues
00:02:31
Representing heaps using Arrays
00:01:56
Heap Sort
00:02:30
Building a heap
00:04:07
Chapter 10 : Hashtables
Introduction
00:02:41
Direct Access Tables
00:02:04
Hashing
00:01:38
Resolving collisions through chaining
00:04:17
The Hash function
00:06:17
00:02:59
00:03:19
00:03:21
Conclusion
00:00:59

آیا می خواهید برنامه نویسی موبایل را با بهترین تکنولوژی شروع کنید؟

به کمک این دوره آموزشی که توسط مدیر سایت گیت تدریس می شود به راحتی اپلیکیشن های Android و iOS و Windows Phone بسازید.

تمامی مباحث از مقدماتی تا پیشرفته آموزش داده می شوند و شرکت کنندگان دوره به مدت نامحدود پشتیبانی می شوند.
برای اطلاعات بیشتر و استفاده از دوره روی لینک زیر کلیک نمایید:

آموزش برنامه نویسی چندسکویی موبایل

آیا می خواهید طراحی وب را به صورت حرفه ای یاد بگیرید؟

در این دوره آموزشی طراحی وب را در قالب بیش از 72 ساعت آموزش تصویری فارسی فرامیگیرید.
در این دوره HTML5 | CSS3 | Javascript | Jquery | Ajax | Bootstrap4 | PHP | MYSQL | SQL Server | Wordpress آموزش داده می شود.

تمامی مباحث از مقدماتی تا پیشرفته آموزش داده می شوند و شرکت کنندگان دوره به مدت نامحدود پشتیبانی می شوند.
برای اطلاعات بیشتر و استفاده از دوره روی لینک زیر کلیک نمایید:

دوره آموزش طراحی وب

حجم فایل: 533MB