ATLANT ♆
Администратор
- Регистрация
- 09.05.21
- Сообщения
- 45.103
- Реакции
- 118.316
In this Learning Data Structures and Algorithms training course, expert author Rod Stephens will teach you how to analyze and implement common algorithms used. This course is designed for the absolute beginner, meaning no previous programming experience is required.
You will start by learning about the complexity theory, then jump into learning about numerical algorithms, including randomizing arrays, prime factorization, and numerical integration. From there, Rod will teach you about linked lists, such as singly linked lists, sorted, and doubly linked lists. This video tutorial also covers arrays, stacks and queues, and sorting. You will also learn about searching, hash tables, recursion, and backtracking algorithms. Finally, you will cover trees, balanced trees, decision trees, and network algorithms.
Once you have completed this computer based training course, you will be fully capable of analyzing and implementing algorithms, as well as be able to select the best algorithm for various situations. Working files are included, allowing you to follow along with the author throughout the lessons.
Материал может быть удален по просьбе
Скачать:
You will start by learning about the complexity theory, then jump into learning about numerical algorithms, including randomizing arrays, prime factorization, and numerical integration. From there, Rod will teach you about linked lists, such as singly linked lists, sorted, and doubly linked lists. This video tutorial also covers arrays, stacks and queues, and sorting. You will also learn about searching, hash tables, recursion, and backtracking algorithms. Finally, you will cover trees, balanced trees, decision trees, and network algorithms.
Once you have completed this computer based training course, you will be fully capable of analyzing and implementing algorithms, as well as be able to select the best algorithm for various situations. Working files are included, allowing you to follow along with the author throughout the lessons.
- 01. Introduction
- Introduction And Course Overview
- About The Author
- 0103 How To Access Your Working Files
- 02. Complexity Theory
- Complexity Theory
- Big O Notation
- Typical Runtime Functions
- Comparing Runtime Functions
- P And NP
- 03. Numerical Algorithms
- Random Numbers
- Linear Congruential Generators
- Randomizing Arrays - Part 1
- Randomizing Arrays - Part 2
- GCD
- LCM
- Prime Factorization - Part 1
- Prime Factorization - Part 2
- Finding Primes
- Testing Primality
- Numerical Integration
- 04. Linked Lists
- 0401 Singly Linked Lists - Part 1
- 0402 Singly Linked Lists - Part 2
- 0403 Sorted Linked Lists
- 0404 Sorting With Linked Lists
- 0405 Doubly Linked Lists
- 05. Arrays
- 0501 One-Dimensional Arrays
- 0502 Triangular Arrays - Part 1
- 0503 Triangular Arrays - Part 2
- 0504 Sparse Arrays - Part 1
- 0505 Sparse Arrays - Part 2
- 06. Stacks And Queues
- 0601 Stacks
- 0602 Stack Algorithms
- 0603 Double Stacks
- 0604 Queues
- 07. Sorting
- 0701 Sorting Algorithms
- 0702 Insertionsort
- 0703 Selectionsort
- 0704 Quicksort - Part 1
- 0705 Quicksort - Part 2
- 0706 Heapsort - Part 1
- 0707 Heapsort - Part 2
- 0708 Heapsort - Part 3
- 0709 Mergesort - Part 1
- 0710 Mergesort - Part 2
- 0711 Bubblesort - Part 1
- 0712 Bubblesort - Part 2
- 0713 Countingsort - Part 1
- 0714 Countingsort - Part 2
- 0715 Sorting Summary
- 08. Searching
- 0801 Linear Search
- 0802 Binary Search
- 0803 Interpolation Search
- 09. Hash Tables
- 0901 Hash Tables
- 0902 Chaining
- 0903 Open Addressing - Basics
- 0904 Open Addressing - Linear Probing
- 0905 Open Addressing - Quadratic Probing
- 0906 Open Addressing - Double Hashing
- 10. Recursion
- 1001 Recursion Basics
- 1002 Fibonacci Numbers
- 1003 Tower Of Hanoi
- 1004 Koch Curves
- 1005 Hilbert Curves
- 1006 Gaskets
- 1007 Removing Tail Recursion
- 1008 Removing Recursion With Stacks
- 1009 Fixing Fibonacci
- 1010 Selections
- 1011 Permutations
- 11. Backtracking Algorithms
- 1101 Backtracking
- 1102 The Eight Queens Problem - Part 1
- 1103 The Eight Queens Problem - Part 2
- 1104 The Eight Queens Problem - Part 3
- 1105 The Knights Tour
- 12. Trees
- 1201 Tree Terms
- 1202 Binary Tree Properties
- 1203 Traversals - Preorder
- 1204 Traversals - Postorder
- 1205 Traversals - Inorder
- 1206 Traversals - Breadth-First
- 1207 Building Sorted Trees
- 1208 Editing Sorted Trees
- 13. Balanced Trees
- 1301 Why Do You Need Balanced Trees?
- 1302 B-Trees - B-Tree Basics
- 1303 B-Trees - Adding Items
- 1304 B-Trees - Removing Items
- 1305 AVL Tress - Part 1
- 1306 AVL Tress - Part 2
- 14. Decision Trees
- 1401 Definition
- 1402 Exhaustive Search
- 1403 Branch And Bound
- 1404 Heuristics
- 15. Network Algorithms
- 1501 Network Terminology
- 1502 Network Classes
- 1503 Depth-First Traversal
- 1504 Breadth-First Traversal
- 1505 Spanning Trees - Part 1
- 1506 Spanning Trees - Part 2
- 1507 Shortest Paths - Part 1
- 1508 Shortest Paths - Part 2
- 1509 All Pairs Shortest Path - Part 1
- 1510 All Pairs Shortest Path - Part 2
- 16. Wrap-Up
- 1601 Wrap-U
Материал может быть удален по просьбе
Скачать:
